2 citations · 4 across the 22 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Dániel Marx, Pranabendu Misra, Daniel Neuen +1
Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this pa…
cs.DS2021
-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Fredrik Manne, Geevarghese Philip, Saket Saurabh +1
Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms in preserving approxim…