Aistis Atminas

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 19

Top Topics

Graph Properties

Graph Representations

Top Venues

Publications

Aistis Atminas, Vadim V. Lozin
Deciding atomicity of subword-closed languages. Theor. Comput. Sci. 1003 (2024)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev
Graph parameters, implicit representations and factorial properties. Discret. Math. 346 (10) (2023)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph parameters, implicit representations and factorial properties. CoRR (2023)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85 (3) (2023)
Aistis Atminas
Classes of graphs without star forests and related graphs. Discret. Math. 345 (12) (2022)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA (2022)
Aistis Atminas, Vadim V. Lozin
Deciding Atomicity of Subword-Closed Languages. DLT (2022)
Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. Discret. Appl. Math. 295 (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
Graph functionality. J. Comb. Theory, Ser. B 147 (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph classes with linear Ramsey numbers. Discret. Math. 344 (4) (2021)
Aistis Atminas, Robert Brignall
Well-quasi-ordering and finite distinguishing number. J. Graph Theory 95 (1) (2020)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin
Graph Functionality. WG (2019)
Aistis Atminas, Viktor Zamaraev
On Forbidden Induced Subgraphs for Unit Disk Graphs. Discret. Comput. Geom. 60 (1) (2018)
Michael H. Albert, Aistis Atminas, Robert Brignall
Characterising inflations of monotone grid classes of permutations. J. Comb. Theory, Ser. A 154 (2018)
Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Linear Ramsey Numbers. IWOCA (2018)
Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
WQO is decidable for factorial languages. Inf. Comput. 256 (2017)
Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
Scattered packings of cycles. Theor. Comput. Sci. 647 (2016)
Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
Deciding the Bell Number for Hereditary Graph Properties. SIAM J. Discret. Math. 30 (2) (2016)
Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev
Implicit representations and factorial properties of graphs. Discret. Math. 338 (2) (2015)
Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22 (2) (2015)
Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR (2015)
Aistis Atminas, Vadim V. Lozin
Labelled Induced Subgraphs and Well-Quasi-Ordering. Order 32 (3) (2015)
Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
Induced packings of cycles. CoRR (2014)
Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). WG (2014)
Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov
Deciding WQO for Factorial Languages. LATA (2013)
Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich
Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. 5 (4) (2013)
Aistis Atminas, Vadim V. Lozin, Igor Razgon
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT (2012)