activity
20082026
most citedRank-width and Tree-width of H-minor-free Graphs

30 citations · 157 across the 83 of their papers we have counts for

collaborators
Showing 2013 · math.COShow all

5 papers · 2 filters

math.CO2013

An edge variant of the Erdős-Pósa property

Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos

For every , we denote by the multigraph with two vertices and parallel edges. Given a graph , we say that a subgraph of is a model of $θ_{r}…

math.CO2013

Nearly Planar Graphs and λ-flat Graphs

Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos

A graph G is ξ-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most ξ times. The family of ξ-nearly planar graphs is widely extending the…

math.CO2013

Irrelevant Vertices for the Planar Disjoint Paths Problem

Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause +3

The Disjoint Paths Problem asks, given a graph and a set of pairs of terminals , whether there is a collection of pairwise vertex-disjoi…

math.CO2013★ 4 cited

Low Polynomial Exclusion of Planar Graph Patterns

Jean-Florent Raymond, Dimitrios M. Thilikos

The celebrated grid exclusion theorem states that for every -vertex planar graph , there is a constant such that if a graph does not contain as a minor then $…

math.CO2013★ 2 cited

Excluding Graphs as Immersions in Surface Embedded Graphs

Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos

We prove a structural characterization of graphs that forbid a fixed graph as an immersion and can be embedded in a surface of Euler genus . In particular, we prove that a g…