Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. - Aistis Atminas; Vadim V. Lozin; Igor Razgon (SWAT, 2012)

Deciding WQO for Factorial Languages. - Aistis Atminas; Vadim V. Lozin; Mikhail Moshkov (LATA, 2013)

Universal graphs and Universal Permutations. - Aistis Atminas; Vadim V. Lozin; Sergey Kitaev; Alexandr Valyuzhenich (Discret. Math. Algorithms Appl., 2013)

Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). - Aistis Atminas; Andrew Collins 004; Jan Foniok; Vadim V. Lozin (WG, 2014)

Induced packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (CoRR, 2014)

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. - Aistis Atminas; Robert Brignall; Nicholas Korpelainen; Vadim V. Lozin; Vincent Vatter (Electron. J. Comb., 2015)

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (CoRR, 2015)

Implicit representations and factorial properties of graphs. - Aistis Atminas; Andrew Collins 004; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2015)

Labelled Induced Subgraphs and Well-Quasi-Ordering. - Aistis Atminas; Vadim V. Lozin (Order, 2015)

Deciding the Bell Number for Hereditary Graph Properties. - Aistis Atminas; Andrew Collins 004; Jan Foniok; Vadim V. Lozin (SIAM J. Discret. Math., 2016)

Scattered packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (Theor. Comput. Sci., 2016)

WQO is decidable for factorial languages. - Aistis Atminas; Vadim V. Lozin; Mikhail Moshkov (Inf. Comput., 2017)

Linear Ramsey Numbers. - Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (IWOCA, 2018)

On Forbidden Induced Subgraphs for Unit Disk Graphs. - Aistis Atminas; Viktor Zamaraev (Discret. Comput. Geom., 2018)

Characterising inflations of monotone grid classes of permutations. - Michael H. Albert; Aistis Atminas; Robert Brignall (J. Comb. Theory A, 2018)

Well-quasi-ordering and finite distinguishing number. - Aistis Atminas; Robert Brignall (J. Graph Theory, 2020)

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. - Aistis Atminas; Robert Brignall; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2021)

Graph classes with linear Ramsey numbers. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (Discret. Math., 2021)

Graph functionality. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin (J. Comb. Theory B, 2021)

Classes of graphs without star forests and related graphs. - Aistis Atminas (Discret. Math., 2022)

Graph parameters, implicit representations and factorial properties. - Bogdan Alecu; Vladimir E. Alekseev; Aistis Atminas; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2023)

Combinatorics and Algorithms for Quasi-Chain Graphs. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin; Dmitriy S. Malyshev (Algorithmica, 2023)

Deciding atomicity of subword-closed languages. - Aistis Atminas; Vadim V. Lozin (Theor. Comput. Sci., 2024)