The following pages link to Aistis Atminas (Q306705):
Displaying 28 items.
- Scattered packings of cycles (Q306707) (← links)
- (Q472960) (redirect page) (← links)
- Implicit representations and factorial properties of graphs (Q472962) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Linear Ramsey numbers (Q1670979) (← links)
- Characterising inflations of monotone grid classes of permutations (Q1679336) (← links)
- Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation (Q1713790) (← links)
- Deciding atomicity of subword-closed languages (Q2163979) (← links)
- Graph parameters, implicit representations and factorial properties (Q2169939) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Graph classes with linear Ramsey numbers (Q2659214) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Classes of graphs without star forests and related graphs (Q2675850) (← links)
- UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS (Q2874053) (← links)
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths (Q2904550) (← links)
- Deciding WQO for Factorial Languages (Q4910442) (← links)
- Well‐quasi‐ordering and finite distinguishing number (Q5066907) (← links)
- Deciding the Bell Number for Hereditary Graph Properties (Q5890662) (← links)
- Deciding the Bell Number for Hereditary Graph Properties (Q5892155) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Graph functionality (Q5919068) (← links)
- Graph functionality (Q5919467) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Graph parameters, implicit representations and factorial properties (Q6172309) (← links)
- Well-quasi-ordering and finite distinguishing number (Q6268534) (← links)
- Deciding atomicity of subword-closed languages (Q6549668) (← links)
