Abstract
We show that OddCycleTransversal and VertexMultiwayCut admit deterministic polynomial kernels when restricted to planar graphs and parameterized by the solution size. This answers a question of Saurabh. On the way to these results, we provide an efficient sparsification routine in the flavor of the sparsification routine used for the SteinerTree
... read more