Sebastian Wiederrecht

CoRR, February, 2026

The price of homogeneity is polynomial.

[BibT_eX]

[DOI]

Michal T. Seweryn

CoRR, February, 2026

Catching Rats in H-minor-free Graphs.

[BibT_eX]

[DOI]

Giannos Stamoulis

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

The Erdős-Pósa property for circle graphs as vertex-minors.

[BibT_eX]

[DOI]

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes.

[BibT_eX]

[DOI]

CoRR, November, 2025

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars.

[BibT_eX]

[DOI]

Mujin Choi

CoRR, September, 2025

Unavoidable butterfly minors in digraphs of large cycle rank.

[BibT_eX]

[DOI]

O-joung Kwon

Myounghwan Lee

CoRR, July, 2025

Colorful Minors.

[BibT_eX]

[DOI]

CoRR, July, 2025

The Local Structure Theorem for Graph Minors with Finite Index.

[BibT_eX]

[DOI]

Christophe Paul

CoRR, July, 2025

Catching Rats in <i>H</i>-minor-free Graphs.

[BibT_eX]

[DOI]

Giannos Stamoulis

CoRR, June, 2025

On graphs with a simple structure of maximal cliques.

[BibT_eX]

[DOI]

Jochen Pascal Gollin

CoRR, April, 2025

Bounds on treewidth via excluding disjoint unions of cycles.

[BibT_eX]

[DOI]

Chun-Hung Liu

Bruce Reed

CoRR, January, 2025

Unavoidable Induced Subgraphs in Graphs with Complete Bipartite Induced Minors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

A note on the 2-factor Hamiltonicity Conjecture.

[BibT_eX]

[DOI]

Theresa Johanni

Discret. Math., 2025

Braces of Perfect Matching Width 2.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars.

[BibT_eX]

[DOI]

Mujin Choi

Claire Hilaire

Martin Milanic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2025

Twin-Width One.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Polynomial bounds for the Graph Minor Structure Theorem.

[BibT_eX]

[DOI]

Michal T. Seweryn

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Excluding a planar matching minor in bipartite graphs.

[BibT_eX]

[DOI]

Stephan Kreutzer

J. Comb. Theory B, January, 2024

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating Branchwidth on Parametric Extensions of Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Packing Even Directed Circuits Quarter-Integrally.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Stephan Kreutzer

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

A Flat Wall Theorem for Matching Minors in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces.

[BibT_eX]

[DOI]

Christophe Paul

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Obstructions to Erdös-Pósa Dualities for Minors.

[BibT_eX]

[DOI]

Christophe Paul

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Matching theory and Barnette's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2023

Odd-Minors I: Excluding small parity breaks.

[BibT_eX]

[DOI]

Jochen Pascal Gollin

CoRR, 2023

Excluding Single-Crossing Matching Minors in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Kernelization for Graph Packing Problems via Rainbow Matching.

[BibT_eX]

[DOI]

Stéphane Bessy

Marin Bougeret

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Even circuits in oriented matroids.

[BibT_eX]

[DOI]

Karl Heuer

Comb. Theory, 2022

Colouring Non-Even Digraphs.

[BibT_eX]

[DOI]

Marcelo Garlet Millani

Electron. J. Comb., 2022

Killing a vortex.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Two Disjoint Alternating Paths in Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Directed Width Parameters on Semicomplete Digraphs.

[BibT_eX]

[DOI]

Frank Gurski

Dominique Komander

Carolin Rehs

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Digraphs of directed treewidth one.

[BibT_eX]

[DOI]

Discret. Math., 2020

Parameterized Algorithms for Directed Modular Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

A Note on Directed Treewidth.

[BibT_eX]

[DOI]

CoRR, 2019

Parametrised Algorithms for Directed Modular Width.

[BibT_eX]

[DOI]

CoRR, 2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.

[BibT_eX]

[DOI]

Roman Rabinovich

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

On Polynomial-Time Congestion-Free Software-Defined Network Updates.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Szymon Dudycz

Mahmoud Parham

Stefan Schmid

Proceedings of the 2019 IFIP Networking Conference, 2019

2018

On chordal graph and line graph squares.

[BibT_eX]

[DOI]

Robert Scheidweiler

Discret. Appl. Math., 2018

Short Schedules for Fast Flow Rerouting.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Szymon Dudycz

Mahmoud Parham

Stefan Schmid

CoRR, 2018

On Perfect Linegraph Squares.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Congestion-Free Rerouting of Flows on DAGs.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Szymon Dudycz

Stefan Schmid

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Matching Connectivity: On the Structure of Graphs with Perfect Matchings.

[BibT_eX]

[DOI]

Stephan Kreutzer