2 papers
cs.DS2025
Boundaried Kernelization via Representative Sets
Leonid Antipov, Stefan Kratsch
A kernelization is an efficient algorithm that given an instance of a parameterized problem returns an equivalent instance of size bounded by some function of the input parameter v…
cs.DS2025
Boundaried Kernelization
Leonid Antipov, Stefan Kratsch
The notion of a (polynomial) kernelization from parameterized complexity is a well-studied model for efficient preprocessing for hard computational problems. By now, it is quite we…