research
∙
04/27/2020
Approximate Turing Kernelization for Problems Parameterized by Treewidth
We extend the notion of lossy kernelization, introduced by Lokshtanov et...
share
research
∙
05/09/2019
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
The Vertex Cover problem plays an essential role in the study of polynom...
research
∙
01/11/2019
On Kernelization for Edge Dominating Set under Structural Parameters
In the NP-hard Edge Dominating Set problem (EDS) we are given a graph G=...
research
∙
11/13/2017