research
∙
09/14/2023
Dynamic programming on bipartite tree decompositions
We revisit a graph width parameter that we dub bipartite treewidth, alon...
share
research
∙
07/15/2020
Adapting the Directed Grid Theorem into an FPT Algorithm
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the mo...
research
∙
04/27/2020
An FPT-algorithm for recognizing k-apices of minor-closed graph classes
Let G be a graph class. We say that a graph G is a k-apex of G if G cont...
research
∙
07/09/2019
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
For a fixed connected graph H, the {H}-M-DELETION problem asks, given a ...
research
∙
04/11/2018
