Vertex Deletion Parameterized by Elimination Distance and Even Less

Abstract

We study the parameterized complexity of various classic vertex-deletion problems such as Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid parameterizations. Existing FPT algorithms for these problems either focus on the parameterization by solution size, detecting solutions of size k in time f (k) • n O(1) , or width parameterizations, finding arbitrarily large optimal solutions in time f (w) • n O(1) for some width measure w like treewidth. We unify these lines of research by presenting FPT algorithms for