research
∙
04/10/2023
Approximating branchwidth on parametric extensions of planarity
The branchwidth of a graph has been introduced by Roberson and Seymour a...
share
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
∙
10/05/2021
Two Disjoint Alternating Paths in Bipartite Graphs
A bipartite graph B is called a brace if it is connected and every match...
research
∙
02/17/2019
