Faster parameterized algorithms for modification problems to minor-closed classes

Laure Morelle, Ignasi Sau, Giannos Stamoulis +1

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