Sebastian Wiederrecht

According to our database, Sebastian Wiederrecht authored at least 29 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Killing a Vortex.

Dimitrios M. Thilikos, Sebastian Wiederrecht

J. ACM, August, 2024

Excluding a planar matching minor in bipartite graphs.

Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht

J. Comb. Theory B, January, 2024

Unavoidable induced subgraphs in graphs with complete bipartite induced minors.

Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht

CoRR, 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

Approximating Branchwidth on Parametric Extensions of Planarity.

Dimitrios M. Thilikos, Sebastian Wiederrecht

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

Packing Even Directed Circuits Quarter-Integrally.

Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht

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

A Flat Wall Theorem for Matching Minors in Bipartite Graphs.

Archontia C. Giannopoulou, Sebastian Wiederrecht

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.

Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht

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

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

Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht

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

2023

Matching theory and Barnette's conjecture.

Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht

Discret. Math., 2023

Odd-Minors I: Excluding small parity breaks.

J. Pascal Gollin, Sebastian Wiederrecht

CoRR, 2023

Excluding Single-Crossing Matching Minors in Bipartite Graphs.

Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht

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

Kernelization for Graph Packing Problems via Rainbow Matching.

Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht

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

2022

Even circuits in oriented matroids.

Karl Heuer, Raphael Steiner, Sebastian Wiederrecht

Comb. Theory, 2022

Colouring Non-Even Digraphs.

Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht

Electron. J. Comb., 2022

2021

Two Disjoint Alternating Paths in Bipartite Graphs.

Archontia C. Giannopoulou, Sebastian Wiederrecht

CoRR, 2021

Directed Width Parameters on Semicomplete Digraphs.

Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Digraphs of directed treewidth one.

Sebastian Wiederrecht

Discret. Math., 2020

Parameterized Algorithms for Directed Modular Width.

Raphael Steiner, Sebastian Wiederrecht

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

A Note on Directed Treewidth.

Sebastian Wiederrecht

CoRR, 2019

Parametrised Algorithms for Directed Modular Width.

Raphael Steiner, Sebastian Wiederrecht

CoRR, 2019

Braces of Perfect Matching Width 2.

Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht

CoRR, 2019

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

Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht

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

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

Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht

Proceedings of the 2019 IFIP Networking Conference, 2019

2018

On chordal graph and line graph squares.

Robert Scheidweiler, Sebastian Wiederrecht

Discret. Appl. Math., 2018

Short Schedules for Fast Flow Rerouting.

Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht

CoRR, 2018

On Perfect Linegraph Squares.

Meike Hatzel, Sebastian Wiederrecht

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

Congestion-Free Rerouting of Flows on DAGs.

Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht

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

2017

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

Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht

Electron. Notes Discret. Math., 2017