12 citations · 47 across the 20 of their papers we have counts for
3 papers · 1 filter
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…
The canonical directed tree decomposition and its applications to the directed disjoint paths problem
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer +1
The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algo…
Neighborhood complexity and kernelization for nowhere dense classes of graphs
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer +4
We prove that whenever is a graph from a nowhere dense graph class , and is a subset of vertices of , then the number of subsets of that are realized as…