2 papers
cs.DS2021
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
Huib Donkers, Bart M. P. Jansen, Michał Włodarczyk
In the -Minor-Free Deletion problem one is given an undirected graph , an integer , and the task is to determine whether there exists a vertex set of size at…
cs.DS2019
A Turing Kernelization Dichotomy for Structural Parameterizations of -Minor-Free Deletion
Huib Donkers, Bart M. P. Jansen
For a fixed finite family of graphs , the -Minor-Free Deletion problem takes as input a graph and an integer and asks whether there exists a se…