Diminishable parameterized problems and strict polynomial kernelization
Computability, pp. 1-24, 2020.
Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP ...More
Full Text (Upload PDF)
PPT (Upload PPT)