Aistis Atminas

From MaRDI portal
Person:306705

Available identifiers

zbMath Open atminas.aistisMaRDI QIDQ306705

List of research outcomes





PublicationDate of PublicationType
Deciding atomicity of subword-closed languages2024-06-04Paper
Graph parameters, implicit representations and factorial properties2023-07-19Paper
Combinatorics and algorithms for quasi-chain graphs2023-03-09Paper
Classes of graphs without star forests and related graphs2022-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 number2022-03-31Paper
Combinatorics and algorithms for quasi-chain graphs2022-03-22Paper
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs2021-04-01Paper
Graph classes with linear Ramsey numbers2021-03-25Paper
Graph functionality2021-02-03Paper
Graph functionality2020-02-24Paper
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation2019-01-28Paper
Linear Ramsey numbers2018-09-06Paper
On forbidden induced subgraphs for unit disk graphs2018-07-26Paper
Characterising inflations of monotone grid classes of permutations2017-11-09Paper
WQO is decidable for factorial languages2017-09-28Paper
Scattered packings of cycles2016-09-01Paper
Deciding the Bell number for hereditary graph properties2016-05-26Paper
Well-quasi-ordering and finite distinguishing number2015-12-18Paper
Labelled induced subgraphs and well-quasi-ordering2015-11-09Paper
Deciding the Bell Number for Hereditary Graph Properties2015-09-09Paper
Well-quasi-order for permutation graphs omitting a path and a clique2015-05-18Paper
Implicit representations and factorial properties of graphs2014-11-20Paper
Universal graphs and universal permutations2014-01-28Paper
Deciding WQO for Factorial Languages2013-03-18Paper
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths2012-08-14Paper

Research outcomes over time

This page was built for person: Aistis Atminas