Aistis Atminas

From MaRDI portal
(Redirected from Person:306705)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Deciding atomicity of subword-closed languages
Theoretical Computer Science
2024-06-04Paper
Graph parameters, implicit representations and factorial properties
Discrete Mathematics
2023-07-19Paper
Combinatorics and algorithms for quasi-chain graphs
Algorithmica
2023-03-09Paper
Classes of graphs without star forests and related graphs
Discrete Mathematics
2022-09-26Paper
Graph parameters, implicit representations and factorial properties2022-08-30Paper
Deciding atomicity of subword-closed languages2022-08-11Paper
A dichotomy for graphs of bounded degeneracy2022-06-18Paper
Well‐quasi‐ordering and finite distinguishing number
Journal of Graph Theory
2022-03-31Paper
Combinatorics and algorithms for quasi-chain graphs
Lecture Notes in Computer Science
2022-03-22Paper
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
Discrete Applied Mathematics
2021-04-01Paper
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
Discrete Applied Mathematics
2021-04-01Paper
Graph classes with linear Ramsey numbers
Discrete Mathematics
2021-03-25Paper
Graph functionality
Journal of Combinatorial Theory. Series B
2021-02-03Paper
Graph functionality
Graph-Theoretic Concepts in Computer Science
2020-02-24Paper
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation
Journal of Combinatorics
2019-01-28Paper
Linear Ramsey numbers2018-09-06Paper
On forbidden induced subgraphs for unit disk graphs
Discrete & Computational Geometry
2018-07-26Paper
Characterising inflations of monotone grid classes of permutations
Journal of Combinatorial Theory. Series A
2017-11-09Paper
Characterising inflations of monotone grid classes of permutations
Journal of Combinatorial Theory. Series A
2017-11-09Paper
WQO is decidable for factorial languages
Information and Computation
2017-09-28Paper
Scattered packings of cycles
Theoretical Computer Science
2016-09-01Paper
Deciding the Bell number for hereditary graph properties
SIAM Journal on Discrete Mathematics
2016-05-26Paper
Well-quasi-ordering and finite distinguishing number
(available as arXiv preprint)
2015-12-18Paper
Labelled induced subgraphs and well-quasi-ordering
Order
2015-11-09Paper
Deciding the Bell number for hereditary graph properties
Graph-Theoretic Concepts in Computer Science
2015-09-09Paper
Deciding the Bell number for hereditary graph properties
Graph-Theoretic Concepts in Computer Science
2015-09-09Paper
Well-quasi-order for permutation graphs omitting a path and a clique
The Electronic Journal of Combinatorics
2015-05-18Paper
Well-quasi-order for permutation graphs omitting a path and a clique
The Electronic Journal of Combinatorics
2015-05-18Paper
Implicit representations and factorial properties of graphs
Discrete Mathematics
2014-11-20Paper
Universal graphs and universal permutations
Discrete Mathematics, Algorithms and Applications
2014-01-28Paper
Deciding WQO for factorial languages
Language and Automata Theory and Applications
2013-03-18Paper
Linear time algorithm for computing a small biclique in graphs without long induced paths
Algorithm Theory – SWAT 2012
2012-08-14Paper


Research outcomes over time


This page was built for person: Aistis Atminas