Sebastian Wiederrecht

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces2026-01-14Paper
Matching minors in bipartite graphs
Foundations of Computing
2024-11-01Paper
Colouring non-even digraphs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Kernelization for graph packing problems via rainbow matching2024-05-14Paper
Excluding a planar matching minor in bipartite graphs
Journal of Combinatorial Theory. Series B
2024-01-29Paper
Packing even directed circuits quarter-integrally2023-11-28Paper
Odd-Minors I: Excluding small parity breaks2023-04-10Paper
Approximating branchwidth on parametric extensions of planarity2023-04-10Paper
Excluding Single-Crossing Matching Minors in Bipartite Graphs2022-12-19Paper
Matching theory and Barnette's conjecture
Discrete Mathematics
2022-11-23Paper
Even circuits in oriented matroids
Combinatorial Theory
2022-11-21Paper
Colouring non-even digraphs
The Electronic Journal of Combinatorics
2022-11-08Paper
Directed width parameters on semicomplete digraphs2022-06-29Paper
A Flat Wall Theorem for Matching Minors in Bipartite Graphs2021-10-14Paper
Two Disjoint Alternating Paths in Bipartite Graphs2021-10-05Paper
Congestion-free rerouting of flows on DAGs
(available as arXiv preprint)
2021-07-28Paper
Digraphs of directed treewidth one
Discrete Mathematics
2020-10-08Paper
Parameterized algorithms for directed modular width
(available as arXiv preprint)
2020-07-21Paper
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
(available as arXiv preprint)
2020-02-24Paper
A Note on Directed Treewidth2019-10-04Paper
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
(available as arXiv preprint)
2019-02-04Paper
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs2018-12-13Paper
On perfect linegraph squares2018-11-22Paper
On chordal graph and line graph squares
Discrete Applied Mathematics
2018-05-24Paper
Matching connectivity: on the structure of graphs with perfect matchings
(available as arXiv preprint)
2018-01-18Paper
The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares2017-11-09Paper
Braces of Perfect Matching Width 2
(available as arXiv preprint)
N/APaper
Killing a Vortex
(available as arXiv preprint)
N/APaper
Excluding Surfaces as Minors in Graphs
(available as arXiv preprint)
N/APaper
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
(available as arXiv preprint)
N/APaper
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Sebastian Wiederrecht