Dynamic Meta-Kernelization
Christian Bertram, Deborah Haun, Mads Vestergaard Jensen, Tuukka Korhonen · 2026
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper, we lift these results to the dynamic setting.