Sebastian Wiederrecht

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 41

Top Topics

Bipartite Graph

Top Venues

Publications

Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Obstructions to Erdös-Pósa Dualities for Minors. CoRR (2024)
Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht
Packing Even Directed Circuits Quarter-Integrally. STOC (2024)
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR (2024)
Archontia C. Giannopoulou, Sebastian Wiederrecht
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. STOC (2024)
Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR (2024)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a Vortex. J. ACM 71 (4) (2024)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Excluding a planar matching minor in bipartite graphs. J. Comb. Theory, Ser. B 164 (2024)
J. Pascal Gollin, Sebastian Wiederrecht
Odd-Minors I: Excluding small parity breaks. CoRR (2023)
Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht
Packing even directed circuits quarter-integrally. CoRR (2023)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Approximating branchwidth on parametric extensions of planarity. CoRR (2023)
Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht
Matching theory and Barnette's conjecture. Discret. Math. 346 (2) (2023)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. SODA (2023)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA (2023)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a Vortex. CoRR (2022)
Dimitrios M. Thilikos, Sebastian Wiederrecht
Killing a vortex. FOCS (2022)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR (2022)
Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht
Colouring Non-Even Digraphs. Electron. J. Comb. 29 (4) (2022)
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR (2022)
Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht
Matching Theory and Barnette's Conjecture. CoRR (2022)
Archontia C. Giannopoulou, Sebastian Wiederrecht
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR (2021)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Excluding a Planar Matching Minor in Bipartite Graphs. CoRR (2021)
Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht
Directed Width Parameters on Semicomplete Digraphs. COCOA (2021)
Archontia C. Giannopoulou, Sebastian Wiederrecht
Two Disjoint Alternating Paths in Bipartite Graphs. CoRR (2021)
Raphael Steiner, Sebastian Wiederrecht
Parameterized Algorithms for Directed Modular Width. CALDAM (2020)
Sebastian Wiederrecht
Digraphs of directed treewidth one. Discret. Math. 343 (12) (2020)
Karl Heuer, Raphael Steiner, Sebastian Wiederrecht
Even Circuits in Oriented Matroids. CoRR (2020)
Sebastian Wiederrecht
A Note on Directed Treewidth. CoRR (2019)
Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
Braces of Perfect Matching Width 2. CoRR (2019)
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht
On Polynomial-Time Congestion-Free Software-Defined Network Updates. Networking (2019)
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG (2019)
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. CoRR (2019)
Raphael Steiner, Sebastian Wiederrecht
Parametrised Algorithms for Directed Modular Width. CoRR (2019)
Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht
Colouring Non-Even Digraphs. CoRR (2019)
Robert Scheidweiler, Sebastian Wiederrecht
On chordal graph and line graph squares. Discret. Appl. Math. 243 (2018)
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht
Short Schedules for Fast Flow Rerouting. CoRR (2018)
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht
Congestion-Free Rerouting of Flows on DAGs. ICALP (2018)
Meike Hatzel, Sebastian Wiederrecht
On Perfect Linegraph Squares. WG (2018)
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. 61 (2017)
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht
Congestion-Free Rerouting of Flows on DAGs. CoRR (2016)