3 citations · 3 across the 2 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for N…
cs.DS2019
On Kernelization for Edge Dominating Set under Structural Parameters
Eva-Maria C. Hols, Stefan Kratsch
In the NP-hard Edge Dominating Set problem (EDS) we are given a graph and an integer , and need to determine whether there is a set of at most edges…