| Publication | Date of Publication | Type |
|---|
Braces of Perfect Matching Width 2
(available as arXiv preprint) | N/A | Paper |
Killing a Vortex
(available as arXiv preprint) | N/A | Paper |
Excluding Surfaces as Minors in Graphs
(available as arXiv preprint) | N/A | Paper |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
(available as arXiv preprint) | N/A | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
(available as arXiv preprint) | N/A | Paper |
| Catching rats in H-minor-free graphs | 2026-07-13 | Paper |
| The Erdős-Pósa property for circle graphs as vertex-minors | 2026-07-13 | Paper |
| Excluding an induced wheel minor in graphs without large induced stars | 2026-07-10 | Paper |
| Twin-width one | 2026-06-24 | Paper |
| Obstructions to Erdös-Pósa dualities for minors | 2026-06-23 | Paper |
Two disjoint alternating paths in bipartite graphs: conformal crosses
Combinatorica | 2026-05-11 | Paper |
Approximating branchwidth on parametric extensions of planarity
Journal of Computer and System Sciences | 2026-05-08 | Paper |
| Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces | 2026-01-14 | Paper |
The Local Structure Theorem for Graph Minors with finite index
(available as arXiv preprint) | 2026-01-01 | Paper |
Colorful Minors
(available as arXiv preprint) | 2026-01-01 | Paper |
Excluding surfaces as minors in graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
The price of homogeneity is polynomial
(available as arXiv preprint) | 2026-01-01 | Paper |
Quickly excluding an annotated planar graph
(available as arXiv preprint) | 2026-01-01 | Paper |
Optimal Bounds for the k-Disjoint Paths Problem
(available as arXiv preprint) | 2026-01-01 | Paper |
An Erdős-Pósa theorem for cycles and faces of distinct lengths
(available as arXiv preprint) | 2026-01-01 | Paper |
Spanning Paths and Cycles: Structural Limitations of the Irrelevant Vertex Technique
(available as arXiv preprint) | 2026-01-01 | Paper |
A directed flat wall theorem excluding a crossrow grid
(available as arXiv preprint) | 2026-01-01 | Paper |
A relaxation of the Bermond-Thomassen conjecture
(available as arXiv preprint) | 2026-01-01 | Paper |
The Erdős-Pósa Property for Colorful Minors
(available as arXiv preprint) | 2026-01-01 | Paper |
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
SIAM Journal on Discrete Mathematics | 2025-10-29 | Paper |
| Killing a vortex | 2025-08-15 | Paper |
| Approximating branchwidth on parametric extensions of planarity | 2025-05-02 | Paper |
Killing a vortex
Journal of the ACM | 2025-04-25 | Paper |
Braces of perfect matching width 2
The Electronic Journal of Combinatorics | 2025-03-25 | Paper |
A note on the 2-factor Hamiltonicity conjecture
Discrete Mathematics | 2025-03-11 | Paper |
Twin-width one
(available as arXiv preprint) | 2025-01-01 | Paper |
Bounds on treewidth via excluding disjoint unions of cycles
(available as arXiv preprint) | 2025-01-01 | Paper |
Polynomial Bounds for the Graph Minor Structure Theorem
(available as arXiv preprint) | 2025-01-01 | Paper |
On graphs with a simple structure of maximal cliques
(available as arXiv preprint) | 2025-01-01 | Paper |
The Erdős-Pósa property for circle graphs as vertex-minors
(available as arXiv preprint) | 2025-01-01 | Paper |
Excluding an induced wheel minor in graphs without large induced stars
(available as arXiv preprint) | 2025-01-01 | Paper |
Excluding Pinched Spheres
(available as arXiv preprint) | 2025-01-01 | Paper |
Catching Rats in H-minor-free Graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Unavoidable butterfly minors in digraphs of large cycle rank
(available as arXiv preprint) | 2025-01-01 | Paper |
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
(available as arXiv preprint) | 2025-01-01 | Paper |
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
(available as arXiv preprint) | 2025-01-01 | Paper |
Matching minors in bipartite graphs
Foundations of Computing | 2024-11-01 | Paper |
Colouring non-even digraphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Kernelization for graph packing problems via rainbow matching | 2024-05-14 | Paper |
Excluding a planar matching minor in bipartite graphs
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
(available as arXiv preprint) | 2024-01-01 | Paper |
Obstructions to Erdős-Pósa Dualities for Minors
(available as arXiv preprint) | 2024-01-01 | Paper |
A note on the 2-Factor Hamiltonicity Conjecture
(available as arXiv preprint) | 2024-01-01 | Paper |
Treewidth, Hadwiger Number, and Induced Minors
(available as arXiv preprint) | 2024-01-01 | Paper |
Generating strongly 2-connected digraphs
(available as arXiv preprint) | 2024-01-01 | Paper |
| Packing even directed circuits quarter-integrally | 2023-11-28 | Paper |
| Odd-Minors I: Excluding small parity breaks | 2023-04-10 | Paper |
| Approximating branchwidth on parametric extensions of planarity | 2023-04-10 | Paper |
Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
(available as arXiv preprint) | 2023-01-01 | Paper |
Packing even directed circuits quarter-integrally
(available as arXiv preprint) | 2023-01-01 | Paper |
| Excluding Single-Crossing Matching Minors in Bipartite Graphs | 2022-12-19 | Paper |
Matching theory and Barnette's conjecture
Discrete Mathematics | 2022-11-23 | Paper |
Even circuits in oriented matroids
Combinatorial Theory | 2022-11-21 | Paper |
Colouring non-even digraphs
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
| Directed width parameters on semicomplete digraphs | 2022-06-29 | Paper |
| A Flat Wall Theorem for Matching Minors in Bipartite Graphs | 2021-10-14 | Paper |
| Two Disjoint Alternating Paths in Bipartite Graphs | 2021-10-05 | Paper |
Congestion-free rerouting of flows on DAGs
(available as arXiv preprint) | 2021-07-28 | Paper |
Two Disjoint Alternating Paths in Bipartite Graphs
(available as arXiv preprint) | 2021-01-01 | Paper |
A Flat Wall Theorem for Matching Minors in Bipartite Graphs
(available as arXiv preprint) | 2021-01-01 | Paper |
Digraphs of directed treewidth one
Discrete Mathematics | 2020-10-08 | Paper |
Parameterized algorithms for directed modular width
(available as arXiv preprint) | 2020-07-21 | Paper |
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
(available as arXiv preprint) | 2020-02-24 | Paper |
| A Note on Directed Treewidth | 2019-10-04 | Paper |
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
(available as arXiv preprint) | 2019-02-04 | Paper |
A Note on Directed Treewidth
(available as arXiv preprint) | 2019-01-01 | Paper |
| The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs | 2018-12-13 | Paper |
| On perfect linegraph squares | 2018-11-22 | Paper |
On chordal graph and line graph squares
Discrete Applied Mathematics | 2018-05-24 | Paper |
Matching connectivity: on the structure of graphs with perfect matchings
(available as arXiv preprint) | 2018-01-18 | Paper |
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
(available as arXiv preprint) | 2018-01-01 | Paper |
| The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares | 2017-11-09 | Paper |
The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares
(available as arXiv preprint) | 2017-01-01 | Paper |
