Aistis Atminas

28 papers B 2C 5Journal 20Unranked 1

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