5 citations · 6 across the 12 of their papers we have counts for
13 papers · 1 filter
Obstructions for Minor-Closed Classes of limiting Densities Below 3/2
Antonios Kominatos, Reem Mahmoud, Dimitrios M. Thilikos
Given a graph class , the limiting density of is defined as where $\mathsf{ex}(\mathcal{…
The Graph Minor Structure Theorem through Bidimensionality
Dimitrios M. Thilikos, Sebastian Wiederrecht
The bidimensionality of a set of vertices in a graph is the maximum for which contains as a -rooted minor the -grid. This notion allows for the fol…
Optimal Bounds for the k-Disjoint Paths Problem
Dario Cavallaro, Maximilian Gorsky, Stephan Kreutzer +2
The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Path…
Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A -colorful graph is defined as a pair where is a…
The Local Structure Theorem for Graph Minors with finite index
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos +1
The Local Structure Theorem (LST) for Graph Minors roughly states that for every -minor-free graph that contains a sufficiently large wall , there is a small vertex subse…
Approximating branchwidth on parametric extensions of planarity
Dimitrios M. Thilikos, Sebastian Wiederrecht
The branchwidth of a graph has been introduced by Roberson and Seymour as a measure of the tree-decomposability of a graph, alternative to treewidth. Branchwidth is polynomially co…