23 citations · 60 across the 50 of their papers we have counts for
53 papers · 1 filter
Kernelization dichotomies for hitting minors under structural parameterizations
Marin Bougeret, Eric Brandwein, Ignasi Sau
For a finite collection of connected graphs , the -MINOR-DELETION problem consists in, given a graph and an integer , deciding whether conta…
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…
Constant congestion linkages in polynomially strong digraphs in polynomial time
Raul Lopes, Ignasi Sau
Given integers , we say that a digraph is -linked if for every pair of ordered sets and of vertices of , there…
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
For a fixed graph , the -SUBGRAPH HITTING problem consists in deleting the minimum number of vertices from an input graph to obtain a graph without any occurrence of as a…
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…