114 citations · 306 across the 50 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017★ 3 cited
Smaller parameters for vertex cover kernelization
Eva-Maria C. Hols, Stefan Kratsch
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Strømme [WG 2016] who gave a ke…
cs.DS2017★ 1 cited
Robust and adaptive search
Yann Disser, Stefan Kratsch
Binary search finds a given element in a sorted array with an optimal number of queries. However, binary search fails even when the array is only slightly disordered or ac…