23 citations · 76 across the 30 of their papers we have counts for
40 papers
An Overview of Universal Obstructions for Graph Parameters
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering on graphs. Towar…
Graph Parameters, Universal Obstructions, and WQO
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
We establish a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering on graphs. At the center of this fr…
Tree-layout based graph classes: proper chordal graphs
Christophe Paul, Evangelos Protopapas
Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others…
The mixed search game against an agile and visible fugitive is monotone
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
We consider the mixed search game against an agile and visible fugitive. This is the variant of the classic fugitive search game on graphs where searchers may be placed to (or remo…
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…
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes +2
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine…