Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell +1

The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time $2^{O(tw)}{n}^{O(1)}$, for F…