4 papers
cs.DS2026
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…
cs.DS2025
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…
cs.DS2025
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…
cs.DS2024
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…