D. Thilikos

activity

20242026

most citedThe Graph Minor Structure Theorem through Bidimensionality

1 citations · 1 across the 9 of their papers we have counts for

collaborators

Showing cs.LOShow all

3 papers · 1 filter

cs.LO2026

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes

Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz +3

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions o…

cs.LO2026

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis +2

Disjoint-paths logic, denoted $FO$ + $dp$ , extends first-order logic ( $FO$ ) with atomic predicates $dp_{r} [(x_{1}, y_{1}), \dots, (x_{r}, y_{r})]$ , expressing…

cs.LO2024

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes

Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

Given a graph $G$ and a vertex set $X$ , the annotated treewidth tw $(G, X)$ of $X$ in $G$ is the maximum treewidth of an $X$ -rooted minor of $G$ , i.e., a minor $H$ where the model of…