Diminishable parameterized problems and strict polynomial kernelization

DOI10.1007/978-3-319-94418-0_17zbMath1485.68116arXiv1611.03739OpenAlexW2964273883MaRDI QIDQ1670737

Henning Fernau, Andreas Krebs, Rolf Niedermeier, Hendrik Molter, Danny Hermelin, Till Fluschnik

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1611.03739

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

A multivariate analysis of the strict terminal connection problem ⋮ On some FPT problems without polynomial Turing compressions

This page was built for publication: Diminishable parameterized problems and strict polynomial kernelization