S. D. Fink, I. Rutter and S. T. P., "A Simple Partially Embedded Planarity Test Based on Vertex-Addition" in 2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025 , Ioana Oriana Bercea and Rasmus Pagh, Eds. SIAM, 2025. pp. 496-508.
S. D. Fink, M. Pfretzschner, I. Rutter and P. Stumpf, "Level Planarity Is More Difficult Than We Thought (Poster Abstract)" 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. 50:1-50:3.
S. D. Fink, M. Pfretzschner and I. Rutter, "Experimental Comparison of PC-Trees and PQ-Trees" , ACM J. Exp. Algorithmics , vol. 28, pp. 1.10:1-1.10:24, 2023. Springer.
DOI: 10.1145/3611653
S. D. Fink, M. Pfretzschner and I. Rutter, "Parameterized Complexity of Simultaneous Planarity" in Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II , Michael A. Bekos and Markus Chimani, Eds. Springer, 2023. pp. 82-96.
T. Bläsius, S. D. Fink and I. Rutter, "Synchronized Planarity with Applications to Constrained Planarity Problems" , ACM Trans. Algorithms , vol. 19, no. 4, pp. 34:1-34:23, 2023.
DOI: 10.1145/3607474
S. D. Fink, M. Pfretzschner and I. Rutter, "Experimental Comparison of PC-Trees and PQ-Trees" in 29th Annual European Symposium on Algorithms, ESA 2021 , Petra Mutzel and Rasmus Pagh and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. pp. 43:1-43:13.
T. Bläsius, S. D. Fink and I. Rutter, "Synchronized Planarity with Applications to Constrained Planarity Problems" in 29th Annual European Symposium on Algorithms, ESA 2021 , Petra Mutzel and Rasmus Pagh and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. pp. 19:1-19:14.
