Publications

Journals

Dimitrios M. Thilikos, S.W.:
Killing a vortex. Journal of the ACM (2024). [arxiv.org]
Archontia C. Giannopoulou, Stephan Kreutzer, S.W.:
Excluding a Planar Matching Minor in Bipartite Graphs. Journal of Combinatorial Theory, Series B 164 (2024): 161-221 [arXiv.org]
Marcelo Garlet Millani, Raphael Steiner, S. W.:
Colouring Non-Even Digraphs. The Electronic Journal of Combinatorics, 29(4), P4-9 (2022) [arXiv.org]
Maximilian Gorsky, Raphael Steiner, S.W.:
Matching Theory and Barnette's Conjecture. Discrete Mathematics 346.2 (2023): 113249 [arXiv.org]
Karl Heuer, Raphael Steiner, S.W.:
Even Circuits in Oriented Matroids. Combinatorial Theory, 2 (1), #3, 2022. [arXiv.org]
S.W.:
Digraphs of Directed Treewidth One. Discrete Mathematics 343.12 (2020): 112124. [arXiv.org]
Robert Scheidweiler, S. W.:
On chordal graph and line graph squares. Discrete Applied Mathematics 243: 239-247 (2018) [arXiv.org]

Peer Reviewed Conferences

Archontia C. Giannopoulou, Dimitrios M. Thilikos, S.W.:
Excluding a single-crossing matching minor. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) [arXiv.org]
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, S.W.:
Kernelization for Graph Packing Problems via Rainbow Matching. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) [arXiv.org]
Dimitrios M. Thilikos, S.W.:
Killing a Vortex. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022) [arXiv.org]
Frank Gurski, Dominique Komander, Carolin Rehs, S.W.:
Directed Width Parameters on Semicomplete Digraphs. International Conference on Combinatorial Optimization and Applications. Springer, Cham, 2021. 615-628
Maximilian Gorsky, Raphael Steiner, S.W.:
Strongly Pfaffian Graphs. Extended Abstracts EuroComb 2021. Birkhäuser, Cham, 2021. 267-272
Archontia C. Giannopoulou, S.W.:
The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings. Extended Abstracts EuroComb 2021. Birkhäuser, Cham, 2021. 429-435
Steiner, Raphael, S. W.:
Parameterized Algorithms for Directed Modular Width. Conference on Algorithms and Discrete Applied Mathematics. Springer, Cham, 2020. [arXiv.org]
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, S. W.:
On Polynomial-Time Congestion-Free Software-Defined Network Updates. 2019 IFIP Networking Conference (IFIP Networking). IEEE, 2019
Meike Hatzel, Roman Rabinovich, S. W.:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG 2019: 53-65 [arXiv.org]
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, S. W.:
Congestion-Free Rerouting of Flows on DAGs. ICALP 2018: 143:1-143:13
Meike Hatzel, S. W.:
On Perfect Linegraph Squares. WG 2018: 252-265

Preprints and Extended Versions

Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, S.W.:
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR abs/2405.01879 (2024)
Clément Dallard, Matjaž Krnc, O-joung Kwon, Martin Milanič, Andrea Munaro, Kenny Štorgel, S.W.:
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024)
Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, S.W.:
Packing even directed circuits quarter integrally. CoRR abs/2311.16816 (2023)
Dimitrios M. Thilikos, S.W.:
Excluding Surfaces as Minors in Graphs. CoRR abs/2306.01724 (2023)
J. Pascal Gollin, S.W.:
Odd-Minors I: Excluding small parity breaks. CoRR abs/2304.04504 (2023)
Dimitrios M. Thilikos, S.W.:
Approximating branchwidth on parametric extensions of planarity. CoRR abs/2304.04517 (2023)
Archontia C. Giannopoulou, S.W.:
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR abs/2110.07553 (2021)
Archontia C. Giannopoulou, S.W.:
Two Disjoint Alternating Paths in Bipartite Graphs. CoRR abs/2110.02013 (2021)
Archontia C. Giannopoulou, Meike Hatzel, S. W.:
Braces of Perfect Matching Width 2. CoRR abs/1902.06307 (2019)
Raphael Steiner, S. W.:
Parametrised Algorithms for Directed Modular Width. CoRR abs/1905.13203 (2019)
Isabel Beckenbach, Meike Hatzel, S. W.:
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs. CoRR abs/1812.05461 (2018)

Other

S.W.:
Matching Minors in Bipartite Graphs. Vol. 16. Universitätsverlag der TU Berlin, 2022.
S. W.:
The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares. Master Thesis (2016)