k-apices of minor-closed graph classes. II. Parameterized algorithms

Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs…