This material is made available to ensure the timely dissemination of scientific work. The copyright and all rights of the authors and other copyright holders remain unaffected. All persons who copy the information provided here are expected to comply with the conditions stipulated by copyright law. In particular, in most cases the dissemination of the work provided is prohibited without the express permission of the copyright holder.
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.
J. Baumann, I. Rutter and D. Sudholt, "Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation" in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 , Bogdan Filipic, Eds. ACM, 2025. pp. 872-880.
S. D. Fink and I. Rutter, "Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm" , J. Graph Algorithms Appl. , vol. 29, no. 1, pp. 91-123, 2025.
I. R. Miriam Goetze and T. Ueckerdt, "Crossing Number of 3-Plane Drawings" in European Workshop on Computational Geometry (EuroCG'25) , 2025, pp. 442-449.
File: https://kam.mff.cuni.cz/conferences/eurocg2025/booklet2025.pdf
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.
File: https://kam.mff.cuni.cz/conferences/eurocg2025/booklet2025.pdf
G. Brückner and I. Rutter, "Partial and constrained level planarity" , Theor. Comput. Sci. , vol. 1045, pp. 115291, 2025.
I. Rutter, D. Strash, P. Stumpf and M. Vollmer, "Simultaneous Representation of Proper and Unit Interval Graphs" , Algorithmica , vol. 87, no. 5, pp. 783-811, 2025.
S. G. Kobourov, M. Löffler, F. Montecchiani, M. Pilipczuk, I. Rutter, R. Seidel, M. Sorge and J. Wulms, "The influence of dimensions on the complexity of computing decision trees" , Artif. Intell. , vol. 343, pp. 104322, 2025.
P. Angelini, T. Biedl, M. Chimani, S. Cornelsen, G. D. Lozzo, S. Hong, G. Liotta, M. Patrignani, S. Pupyrev and I. Rutter, "The Price of Upwardness" , Discret. Math. Theor. Comput. Sci. , vol. 27, no. 3, 2025.
DOI: 10.46298/DMTCS.15222
T. Biedl, S. Cornelsen, J. Kratochv$\backslash$'\il and I. Rutter, "Constrained Outer-String Representations" 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. 10:1-10:18.
J. Baumann, I. Rutter and D. Sudholt, "Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (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. 51:1-51:3.
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
G. Brückner, I. Rutter and P. Stumpf, "Extending Partial Representations of Circle Graphs in Near-Linear Time" , Algorithmica , vol. 86, no. 7, pp. 2152-2173, 2024.
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.
P. Bachmann, I. Rutter and P. Stumpf, "On 3-Coloring Circle Graphs" , J. Graph Algorithms Appl. , vol. 28, no. 1, pp. 389-402, 2024.
J. Katheder, P. Kindermann, F. Klute, I. Parada and I. Rutter, "On k-Plane Insertion into Plane Drawings" 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. 35:1-35:11.
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.
J. Baumann, M. Pfretzschner and I. Rutter, "Parameterized complexity of vertex splitting to pathwidth at most 1" , Theor. Comput. Sci. , vol. 1021, pp. 114928, 2024. ACM.
Xiaodong Li and Julia Handl, Eds., Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 .
Rezaul Chowdhury and Solon P. Pissis, Eds., Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024 .
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.
P. Angelini, T. Biedl, M. Chimani, S. Cornelsen, G. D. Lozzo, S. Hong, G. Liotta, M. Patrignani, S. Pupyrev, I. Rutter and A. Wolff, "The Price of Upwardness" 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. 13:1-13:20.
M. A. Bekos, G. D. Lozzo, F. Frati, S. Gupta, P. Kindermann, G. Liotta, I. Rutter and I. G. Tollis, "Weakly Leveled Planarity with Bounded Span" 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. 19:1-19:19.
L. Barth, B. Niedermann, I. Rutter and M. Wolf, "A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing" , Discret. Comput. Geom. , vol. 70, no. 4, pp. 1292-1355, 2023.
L. Grilli, S. Hong, J. Kratochv$\backslash$'\il and I. Rutter, "Drawing Simultaneously Embedded Graphs with Few Bends" , Int. J. Found. Comput. Sci. , vol. 34, no. 7, pp. 807-824, 2023.
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
P. Bachmann, I. Rutter and P. Stumpf, "On 3-Coloring Circle Graphs" in Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part I , Michael A. Bekos and Markus Chimani, Eds. Springer, 2023. pp. 152-160.
DOI: 10.1007/978-3-031-49272-3$\backslash$\textunderscore 11
G. Liotta, I. Rutter and A. Tappini, "Parameterized complexity of graph planarity with restricted cyclic orders" , J. Comput. Syst. Sci. , vol. 135, pp. 125-144, 2023.
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.
J. Baumann, M. Pfretzschner and I. Rutter, "Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1" in Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers , Daniël Paulusma and Bernard Ries, Eds. Springer, 2023. pp. 30-43.
I. Rutter and P. Stumpf, "Simultaneous Representation of Interval Graphs in the Sunflower Case" in 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands , Inge Li G\ortz and Martin Farach-Colton and Simon J. Puglisi and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. pp. 90:1-90:15.
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. G. Kobourov, M. Löffler, F. Montecchiani, M. Pilipczuk, I. Rutter, R. Seidel, M. Sorge and J. Wulms, "The Influence of Dimensions on the Complexity of Computing Decision Trees" in Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 , Brian Williams and Yiling Chen and Jennifer Neville, Eds. AAAI Press, 2023. pp. 8343-8350.
S. Bhore, G. Li, M. Nöllenburg, I. Rutter and H. Wu, "Untangling circular drawings: Algorithms and complexity" , Comput. Geom. , vol. 111, pp. 101975, 2023.
G. Gutowski, F. Mittelstädt, I. Rutter, J. Spoerhase, A. Wolff and J. Zink, "Coloring Mixed and Directional Interval Graphs" in Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers , Patrizio Angelini and Reinhard von Hanxleden, Eds. Springer, 2022. pp. 418-431.
DOI: 10.1007/978-3-031-22203-0$\backslash$\textunderscore 30
G. Brückner, I. Rutter and P. Stumpf, "Extending Partial Representations of Circle Graphs in Near-Linear Time" in 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria , Stefan Szeider and Robert Ganian and Alexandra Silva, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 25:1-25:14.
J. Fiala, I. Rutter, P. Stumpf and P. Zeman, "Extending Partial Representations of Circular-Arc Graphs" in Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers , Michael A. Bekos and Michael Kaufmann, Eds. Springer, 2022. pp. 230-243.
DOI: 10.1007/978-3-031-15914-5$\backslash$\textunderscore 17
M. Radermacher and I. Rutter, "Inserting an edge into a geometric embedding" , Comput. Geom. , vol. 102, pp. 101843, 2022.
G. Brückner, I. Rutter and P. Stumpf, "Level-Planarity: Transitivity vs. Even Crossings" , Electron. J. Comb. , vol. 29, no. 4, 2022.
DOI: 10.37236/10814
S. Chaplick, P. Kindermann, J. Klawitter, I. Rutter and A. Wolff, "Morphing Rectangular Duals" in Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers , Patrizio Angelini and Reinhard von Hanxleden, Eds. Springer, 2022. pp. 389-403.
DOI: 10.1007/978-3-031-22203-0$\backslash$\textunderscore 28
M. A. Bekos, C. Binucci, G. D. Battista, W. Didimo, M. Gronemann, K. Klein, M. Patrignani and I. Rutter, "On Turn-Regular Orthogonal Representations" , J. Graph Algorithms Appl. , vol. 26, no. 3, pp. 285-306, 2022.
DOI: 10.7155/jgaa.00595
G. Liotta, I. Rutter and A. Tappini, "Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders" in Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers , Michael A. Bekos and Michael Kaufmann, Eds. Springer, 2022. pp. 383-397.
DOI: 10.1007/978-3-031-15914-5$\backslash$\textunderscore 28
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. A. Bekos, S. Felsner, P. Kindermann, S. G. Kobourov, J. Kratochv$\backslash$'\il and I. Rutter, "The Rique-Number of Graphs" in Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers , Patrizio Angelini and Reinhard von Hanxleden, Eds. Springer, 2022. pp. 371-386.
DOI: 10.1007/978-3-031-22203-0$\backslash$\textunderscore 27
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.
P. Angelini, I. Rutter and T. P. Sandhya, "Extending Partial Orthogonal Drawings" , J. Graph Algorithms Appl. , vol. 25, no. 1, pp. 581-602, 2021.
DOI: 10.7155/jgaa.00573
S. Chaplick, P. Kindermann, J. Klawitter, I. Rutter and A. Wolff, "Extending Partial Representations of Rectangular Duals with Given Contact Orientations" in Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings , Tiziana Calamoneri and Federico Corò, Eds. Springer, 2021. pp. 340-353.
Helen C. Purchase and Ignaz Rutter, Eds., Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers : Lecture Notes in Computer Science.
DOI: 10.1007/978-3-030-92931-2
ISBN: 978-3-030-92931-2
M. Münch, "Partial and Simultaneous Representations of Circular Permutation graphs", Masterarbeit, Universität Passau, 2021.
T. Ophelders, I. Rutter, B. Speckmann and K. Verbeek, "Polygon-Universal Graphs" in 37th International Symposium on Computational Geometry, SoCG 2021 , Kevin Buchin and Éric Colin de Verdière, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. pp. 55:1-55:15.
