research
∙
09/14/2023
Dynamic programming on bipartite tree decompositions
We revisit a graph width parameter that we dub bipartite treewidth, alon...
share
research
∙
04/27/2023
Universal Obstructions of Graph Parameters
We introduce a graph-parametric framework for obtaining obstruction char...
research
∙
04/10/2023
Approximating branchwidth on parametric extensions of planarity
The branchwidth of a graph has been introduced by Roberson and Seymour a...
research
∙
02/14/2023
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends first-order logic (𝖥𝖮) with...
research
∙
12/19/2022
Excluding Single-Crossing Matching Minors in Bipartite Graphs
By a seminal result of Valiant, computing the permanent of (0,1)-matrice...
research
∙
07/14/2022
Kernelization for Graph Packing Problems via Rainbow Matching
We introduce a new kernelization tool, called rainbow matching technique...
research
∙
07/11/2022
Killing a Vortex
The Structural Theorem of the Graph Minors series of Robertson and Seymo...
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
∙
08/02/2018
