Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma

Tomohiro Koana, André Nichterlein, Niklas Wünsche

Given a graph and two integers $k$ and $\ell$, Partial Vertex Cover asks for a set of at most $k$ vertices whose deletion results in a graph with at most $\ell$ edges. Based on the…