Publications

  • S.W.:
    Matching Minors in Bipartite Graphs. Vol. 16. Universitätsverlag der TU Berlin, 2022.

  • Karl Heuer, Raphael Steiner, S.W.:
    Even Cirvuits in Oriented Matroids. Combinatorial Theory, 2 (1), #3, 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

  • S.W.:
    Digraphs of Directed Treewidth One. Discrete Mathematics 343.12 (2020): 112124. [arXiv.org]

  • 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 UpdatesNetworking 2019: 1-9

  • Meike Hatzel, Roman Rabinovich, S. W.:
    Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG 2019: 53-65 [arXiv.org]

  • Robert Scheidweiler, S. W.:
    On chordal graph and line graph squares. Discrete Applied Mathematics 243: 239-247 (2018) [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

  • Archontia C. Giannopoulou, Stephan Kreutzer, S. W.:
    Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electronic Notes in Discrete Mathematics 61: 505-511 (2017)

Preprints and Extended Versions

Other