M. Münch and I. Rutter, "Parameterized Algorithms for Crossing Number with Forbidden Topological Crossing Patterns" in European Workshop on Computational Geometry (EuroCG'25) , 2025, pp. 547-552.
Datei: https://kam.mff.cuni.cz/conferences/eurocg2025/booklet2025.pdf
M. Münch, M. Pfister and I. Rutter, "Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth" in Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers , Daniel Král and Martin Milanic, Eds. Springer, 2024. pp. 430-443.
DOI: 10.1007/978-3-031-75409-8$\backslash$\textunderscore 30
M. Münch and I. Rutter, "Parameterized Algorithms for Beyond-Planar Crossing Numbers" in 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria , Stefan Felsner and Karsten Klein, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. pp. 25:1-25:16.
G. D. Lozzo, W. Didimo, F. Montecchiani, M. Münch, M. Patrignani and I. Rutter, "Simple Realizability of Abstract Topological Graphs" in 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia , Julián Mestre and Anthony Wirth, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. pp. 23:1-23:15.
M. Münch, I. Rutter and P. Stumpf, "Partial and Simultaneous Transitive Orientations via Modular Decompositions" in 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea , Sang Won Bae and Heejin Park, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 51:1-51:16.
M. Münch, "Partial and Simultaneous Representations of Circular Permutation graphs", Masterarbeit, Universität Passau, 2021.
