2 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
On the parameterized complexity of computing good edge-labelings
Davi de Andrade, Júlio Araújo, Laure Morelle +2
A good edge-labeling (gel for short) of a graph is a function such that, for any ordered pair of vertices of , there do not exist two disti…
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…