Matching Connectivity: On the Structure of Graphs with Perfect Matchings. - Archontia C. Giannopoulou; Stephan Kreutzer; Sebastian Wiederrecht (Electron. Notes Discret. Math., 2017)

Congestion-Free Rerouting of Flows on DAGs. - Saeed Akhoondian Amiri; Szymon Dudycz; Stefan Schmid 001; Sebastian Wiederrecht (ICALP, 2018)

On Perfect Linegraph Squares. - Meike Hatzel; Sebastian Wiederrecht (WG, 2018)

Short Schedules for Fast Flow Rerouting. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (CoRR, 2018)

On chordal graph and line graph squares. - Robert Scheidweiler; Sebastian Wiederrecht (Discret. Appl. Math., 2018)

On Polynomial-Time Congestion-Free Software-Defined Network Updates. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (Networking, 2019)

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. - Meike Hatzel; Roman Rabinovich 001; Sebastian Wiederrecht (WG, 2019)

Braces of Perfect Matching Width 2. - Archontia C. Giannopoulou; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2019)

Parametrised Algorithms for Directed Modular Width. - Raphael Steiner; Sebastian Wiederrecht (CoRR, 2019)

A Note on Directed Treewidth. - Sebastian Wiederrecht (CoRR, 2019)

Parameterized Algorithms for Directed Modular Width. - Raphael Steiner; Sebastian Wiederrecht (CALDAM, 2020)

Digraphs of directed treewidth one. - Sebastian Wiederrecht (Discret. Math., 2020)

Directed Width Parameters on Semicomplete Digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs; Sebastian Wiederrecht (COCOA, 2021)

Two Disjoint Alternating Paths in Bipartite Graphs. - Archontia C. Giannopoulou; Sebastian Wiederrecht (CoRR, 2021)

Colouring Non-Even Digraphs. - Marcelo Garlet Millani; Raphael Steiner; Sebastian Wiederrecht (Electron. J. Comb., 2022)

Even circuits in oriented matroids. - Karl Heuer; Raphael Steiner; Sebastian Wiederrecht (Comb. Theory, 2022)

Kernelization for Graph Packing Problems via Rainbow Matching. - Stéphane Bessy; Marin Bougeret; Dimitrios M. Thilikos; Sebastian Wiederrecht (SODA, 2023)

Excluding Single-Crossing Matching Minors in Bipartite Graphs. - Archontia C. Giannopoulou; Dimitrios M. Thilikos; Sebastian Wiederrecht (SODA, 2023)

Odd-Minors I: Excluding small parity breaks. - J. Pascal Gollin; Sebastian Wiederrecht (CoRR, 2023)

Matching theory and Barnette's conjecture. - Maximilian Gorsky; Raphael Steiner; Sebastian Wiederrecht (Discret. Math., 2023)

Obstructions to Erdös-Pósa Dualities for Minors. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (FOCS, 2024)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (ICALP, 2024)

A Flat Wall Theorem for Matching Minors in Bipartite Graphs. - Archontia C. Giannopoulou; Sebastian Wiederrecht (STOC, 2024)

Packing Even Directed Circuits Quarter-Integrally. - Maximilian Gorsky; Ken-ichi Kawarabayashi; Stephan Kreutzer; Sebastian Wiederrecht (STOC, 2024)

Approximating Branchwidth on Parametric Extensions of Planarity. - Dimitrios M. Thilikos; Sebastian Wiederrecht (WG, 2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. - Clément Dallard; Matjaz Krnc; O-joung Kwon; Martin Milanic; Andrea Munaro; Kenny Storgel; Sebastian Wiederrecht (CoRR, 2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors. - Maria Chudnovsky; Meike Hatzel; Tuukka Korhonen; Nicolas Trotignon; Sebastian Wiederrecht (CoRR, 2024)

Excluding a planar matching minor in bipartite graphs. - Archontia C. Giannopoulou; Stephan Kreutzer; Sebastian Wiederrecht (J. Comb. Theory B, 2024)

Killing a Vortex. - Dimitrios M. Thilikos; Sebastian Wiederrecht (J. ACM, 2024)

Twin-Width One. - Jungho Ahn; Hugo Jacob 001; Noleen Köhler; Christophe Paul; Amadeus Reinald; Sebastian Wiederrecht (STACS, 2025)

A note on the 2-factor Hamiltonicity Conjecture. - Maximilian Gorsky; Theresa Johanni; Sebastian Wiederrecht (Discret. Math., 2025)

Bounds on treewidth via excluding disjoint unions of cycles. - Meike Hatzel; Chun-Hung Liu; Bruce Reed; Sebastian Wiederrecht (CoRR, 2025)

Polynomial Bounds for the Graph Minor Structure Theorem. - Maximilian Gorsky; Michal T. Seweryn; Sebastian Wiederrecht (CoRR, 2025)

On graphs with a simple structure of maximal cliques. - J. Pascal Gollin; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2025)

Excluding an induced wheel minor in graphs without large induced stars. - Mujin Choi; Claire Hilaire; Martin Milanic; Sebastian Wiederrecht (CoRR, 2025)

Catching Rats in H-minor-free Graphs. - Maximilian Gorsky; Giannos Stamoulis; Dimitrios M. Thilikos; Sebastian Wiederrecht (CoRR, 2025)

The Local Structure Theorem for Graph Minors with Finite Index. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (CoRR, 2025)

Colorful Minors. - Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (CoRR, 2025)

Unavoidable butterfly minors in digraphs of large cycle rank. - Meike Hatzel; O-joung Kwon; Myounghwan Lee; Sebastian Wiederrecht (CoRR, 2025)