activity
20182026
most citedMinor Containment and Disjoint Paths in almost-linear time

2 citations · 6 across the 22 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2021

Block Elimination Distance

Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis +1

We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class , the class ${\cal B}({\cal…

cs.DM2021

A more accurate view of the Flat Wall Theorem

Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

We introduce a supporting combinatorial framework for the Flat Wall Theorem. In particular, we suggest two variants of the theorem and we introduce a new, more versatile, concept o…