Elimination distances, blocking sets, and kernels for Vertex Cover

DOI10.4230/LIPIcs.STACS.2020.36OpenAlexW3014089325MaRDI QIDQ5874309

Stefan Kratsch, Astrid Pieterse, Eva-Maria C. Hols

Publication date: 7 February 2023

Full work available at URL: http://arxiv.org/pdf/1905.03631.pdf

zbMATH Keywords

blocking setsvertex coverstructural parameterskernelizationelimination distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ⋮ A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs ⋮ FPT algorithms to compute the elimination distance to bipartite graphs and more ⋮ First-order Logic with Connectivity Operators ⋮ On the Parameterized Complexity of Clique Elimination Distance ⋮ Elimination Distance to Bounded Degree on Planar Graphs

This page was built for publication: Elimination distances, blocking sets, and kernels for Vertex Cover