FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

Bart M. P. Jansen, Jari J. H. de Kroon

For a hereditary graph class $\mathcal{H}$, the $\mathcal{H}$-elimination distance of a graph $G$ is the minimum number of rounds needed to reduce $G$ to a member of $\mathcal{H}$…