Aistis Atminas

According to our database, Aistis Atminas authored at least 23 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

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, Viktor Zamaraev

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Deciding Atomicity of Subword-Closed Languages.

Aistis Atminas, Vadim V. Lozin

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Graph classes with linear Ramsey numbers.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev

Discret. Math., 2021

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

Combinatorics and Algorithms for Quasi-chain Graphs.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Well-quasi-ordering and finite distinguishing number.

Aistis Atminas, Robert Brignall

J. Graph Theory, 2020

2019

Graph Functionality.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

Characterising inflations of monotone grid classes of permutations.

Michael H. Albert, Aistis Atminas, Robert Brignall

J. Comb. Theory A, 2018

On Forbidden Induced Subgraphs for Unit Disk Graphs.

Aistis Atminas, Viktor Zamaraev

Discret. Comput. Geom., 2018

Linear Ramsey Numbers.

Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

WQO is decidable for factorial languages.

Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov

Inf. Comput., 2017

2016

Scattered packings of cycles.

Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond

Theor. Comput. Sci., 2016

Deciding the Bell Number for Hereditary Graph Properties.

Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin

SIAM J. Discret. Math., 2016

2015

Labelled Induced Subgraphs and Well-Quasi-Ordering.

Aistis Atminas, Vadim V. Lozin

Order, 2015

Implicit representations and factorial properties of graphs.

Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev

Discret. Math., 2015

Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.

Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho

CoRR, 2015

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

2014

Induced packings of cycles.

Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond

CoRR, 2014

Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract).

Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Universal graphs and Universal Permutations.

Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich

Discret. Math. Algorithms Appl., 2013

Deciding WQO for Factorial Languages.

Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths.

Aistis Atminas, Vadim V. Lozin, Igor Razgon

Proceedings of the Algorithm Theory - SWAT 2012, 2012