Parameterized Complexity of Simultaneous Planarity. - Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter (GD (2), 2023)

Experimental Comparison of PC-Trees and PQ-Trees. - Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter (ACM J. Exp. Algorithmics, 2023)

Level Planarity Is More Difficult Than We Thought (Poster Abstract). - Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter; Peter Stumpf (GD, 2024)

Clustered Planarity Variants for Level Graphs. - Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter; Marie Diana Sieper (CoRR, 2024)

Level Planarity Is More Difficult Than We Thought. - Simon D. Fink; Matthias Pfretzschner; Ignaz Rutter; Peter Stumpf (CoRR, 2024)

Parameterized complexity of vertex splitting to pathwidth at most 1. - Jakob Baumann; Matthias Pfretzschner; Ignaz Rutter (Theor. Comput. Sci., 2024)

Segment Intersection Representations, Level Planarity and Constrained Ordering Problems. - Simon D. Fink; Matthias Pfretzschner; Peter Stumpf (CoRR, 2025)

Unbent Collections of Orthogonal Drawings. - Todor Antic; Giuseppe Liotta; Tomás Masarík; Giacomo Ortali; Matthias Pfretzschner; Peter Stumpf; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2025)

Saturated Drawings of Geometric Thickness k. - Patricia Bachmann; Anna Brötzner; Miriam Goetze; Philipp Kindermann; Matthias Pfretzschner; Soeren Terziadis (CoRR, 2025)