30 citations · 157 across the 83 of their papers we have counts for
40 papers · 1 filter
Spanning Paths and Cycles: Structural Limitations of the Irrelevant Vertex Technique
Dimitrios M. Thilikos, Sebastian Wiederrecht
The Irrelevant Vertex Technique is one of the cornerstones of algorithmic graph theory, underlying Robertson and Seymour's algorithm for \textsc{Disjoint Paths} and much of the alg…
H-Planarity and Parametric Extensions: when Modulators Act Globally
Fedor V. Fomin, Petr A. Golovach, Laure Morelle +1
We introduce a series of graph decompositions based on the modulator/target scheme of modification problems that enable several algorithmic applications that parametrically extend…
Graph modification of bounded size to minor-closed classes as fast as vertex deletion
Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
A replacement action is a function that maps each graph to a collection of graphs of size at most . Given a graph class , we consider a gener…
Vertex identification to a forest
Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Let be a graph class and . We say a graph admits a \emph{-identification to } if there is a partition of some set $X…
Dynamic programming on bipartite tree decompositions
Lars Jaffke, Laure Morelle, Ignasi Sau +1
We revisit a graph width parameter that we dub bipartite treewidth (btw). Bipartite treewidth can be seen as a common generalization of treewidth and the odd cycle transversal numb…
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle, Ignasi Sau, Giannos Stamoulis +1
Let be a minor-closed graph class and let be an -vertex graph. We say that is a -apex of if contains a set of at most vertices such…