4 citations · 5 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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.DS2021
On the Hardness of Compressing Weights
Bart M. P. Jansen, Shivesh K. Roy, Michał Włodarczyk
We investigate computational problems involving large weights through the lens of kernelization, which is a framework of polynomial-time preprocessing aimed at compressing the inst…