30 citations · 157 across the 83 of their papers we have counts for
4 papers · 2 filters
Edge-trewidth: Algorithmic and combinatorial properties
Loïc Magne, Christophe Paul, Abhijat Sharma +1
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue…
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
We introduce the rendezvous game with adversaries. In this game, two players, {\sl Facilitator} and {\sl Disruptor}, play against each other on a graph. Facilitator has two agents,…
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…
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…