default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAistis Atminas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Aistis Atminas
, Vadim V. Lozin:
Deciding atomicity of subword-closed languages. Theor. Comput. Sci. 1003: 114595 (2024)- 2023
- [j16]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85(3): 642-664 (2023) - [j15]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev:
Graph parameters, implicit representations and factorial properties. Discret. Math. 346(10): 113573 (2023) - [i3]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph parameters, implicit representations and factorial properties. CoRR abs/2303.04453 (2023) - 2022
- [j14]Aistis Atminas:
Classes of graphs without star forests and related graphs. Discret. Math. 345(12): 113089 (2022) - [c8]Aistis Atminas, Vadim V. Lozin:
Deciding Atomicity of Subword-Closed Languages. DLT 2022: 69-77 - [c7]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA 2022: 60-72 - 2021
- [j13]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: 57-69 (2021) - [j12]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph classes with linear Ramsey numbers. Discret. Math. 344(4): 112307 (2021) - [j11]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph functionality. J. Comb. Theory B 147: 139-158 (2021) - [c6]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA 2021: 49-62 - 2020
- [j10]Aistis Atminas, Robert Brignall:
Well-quasi-ordering and finite distinguishing number. J. Graph Theory 95(1): 5-26 (2020)
2010 – 2019
- 2019
- [c5]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph Functionality. WG 2019: 135-147 - 2018
- [j9]Aistis Atminas, Viktor Zamaraev:
On Forbidden Induced Subgraphs for Unit Disk Graphs. Discret. Comput. Geom. 60(1): 57-97 (2018) - [j8]Michael H. Albert, Aistis Atminas, Robert Brignall:
Characterising inflations of monotone grid classes of permutations. J. Comb. Theory A 154: 444-463 (2018) - [c4]Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Linear Ramsey Numbers. IWOCA 2018: 26-38 - 2017
- [j7]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
WQO is decidable for factorial languages. Inf. Comput. 256: 321-333 (2017) - 2016
- [j6]Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin:
Deciding the Bell Number for Hereditary Graph Properties. SIAM J. Discret. Math. 30(2): 1015-1031 (2016) - [j5]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Scattered packings of cycles. Theor. Comput. Sci. 647: 33-42 (2016) - 2015
- [j4]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): 2 (2015) - [j3]Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev:
Implicit representations and factorial properties of graphs. Discret. Math. 338(2): 164-179 (2015) - [j2]Aistis Atminas, Vadim V. Lozin:
Labelled Induced Subgraphs and Well-Quasi-Ordering. Order 32(3): 313-328 (2015) - [i2]Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. CoRR abs/1503.01628 (2015) - 2014
- [c3]Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin:
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). WG 2014: 69-80 - [i1]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Induced packings of cycles. CoRR abs/1409.2733 (2014) - 2013
- [j1]Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich:
Universal graphs and Universal Permutations. Discret. Math. Algorithms Appl. 5(4) (2013) - [c2]Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages. LATA 2013: 68-79 - 2012
- [c1]Aistis Atminas, Vadim V. Lozin, Igor Razgon:
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT 2012: 142-152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
