30 citations · 157 across the 83 of their papers we have counts for
5 papers · 2 filters
Excluding Single-Crossing Matching Minors in Bipartite Graphs
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
\noindent By a seminal result of Valiant, computing the permanent of -matrices is, in general, -hard. In 1913 Pólya asked for which -matrices it is…
Contraction Bidimensionality of Geometric Intersection Graphs
Julien Baste, Dimitrios M. Thilikos
Given a graph , we define as the minimum for which can be contracted to the uniformly triangulated grid . A graph class has the SQG${\bf…
Combing a Linkage in an Annulus
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
A linkage in a graph of size is a subgraph of whose connected components are paths. The pattern of a linkage of size is the set of pairs formed by the e…
Killing a Vortex
Dimitrios M. Thilikos, Sebastian Wiederrecht
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph every -minor-free graph can be obtained by clique-sums of ``almost embeddable'' gr…
On Strict Brambles
Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos +1
A strict bramble of a graph is a collection of pairwise-intersecting connected subgraphs of The order of a strict bramble is the minimum size of a set of vertic…