M. Radermacher and I. Rutter, "Inserting an edge into a geometric embedding" , Comput. Geom. , vol. 102 , pp. 101843 , 2022.
DOI: 10.1016/j.comgeo.2021.101843

S. Chaplick, S. Felsner, P. Kindermann, J. Klawitter, I. Rutter and A. Wolff, "Simple algorithms for partial and simultaneous rectangular duals with given contact orientations" , Theor. Comput. Sci. , vol. 919 , pp. 66-74 , 2022.
DOI: 10.1016/j.tcs.2022.03.031

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.
DOI: 10.4230/LIPIcs.ESA.2021.43

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.
DOI: 10.1007/978-3-030-75242-2

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

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.
DOI: 10.4230/LIPIcs.SoCG.2021.55

G. Brückner and I. Rutter, "Radial Level Planarity with Fixed Embedding" , Journal of Graph Algorithms and Applications , vol. 25 , no. 1 , pp. 353-366 , 2021.
DOI: 10.7155/jgaa.00561

G. Liotta, I. Rutter and A. Tappini, "Simultaneous FPQ-ordering and hybrid planarity testing" , Theor. Comput. Sci. , vol. 874 , pp. 59-79 , 2021.
DOI: 10.1016/j.tcs.2021.05.012

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.
DOI: 10.4230/LIPIcs.ESA.2021.19

S. Bhore, G. Li, M. Nöllenburg, I. Rutter and H. Wu, "Untangling Circular Drawings: Algorithms and Complexity" in 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan , Hee-Kap Ahn and Kunihiko Sadakane, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2021. pp. 19:1-19:17.
DOI: 10.4230/LIPIcs.ISAAC.2021.19

B. Niedermann and I. Rutter, "An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings" in Graph Drawing and Network Visualization - 28th International Symposium, GD 2020 , David Auber and Pavel Valtr, Eds. Springer , 2020. pp. 235-249.
DOI: 10.1007/978-3-030-68766-3

G. Brückner and I. Rutter, "An SPQR-Tree-Like Embedding Representation for Level Planarity" in 31st International Symposium on Algorithms and Computation, ISAAC 2020 , Yixin Cao and Siu-Wing Cheng and Minming Li, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2020. pp. 8:1-8:15.
DOI: 10.4230/LIPIcs.ISAAC.2020.8

P. Angelini, G. D. Lozzo, G. D. Battista, F. Frati, M. Patrignani and I. Rutter, "Beyond level planarity: Cyclic, torus, and simultaneous level planarity" , Theor. Comput. Sci. , vol. 804 , pp. 161-170 , 2020.
DOI: 10.1016/j.tcs.2019.11.024

T. Mchedlidze, M. Radermacher, I. Rutter and N. Zimbel, "Drawing Clustered Planar Graphs on Disk Arrangements" , J. Graph Algorithms Appl. , vol. 24 , no. 2 , pp. 105-131 , 2020.
DOI: 10.7155/jgaa.00521

P. Angelini, I. Rutter and T. P. Sandhya, "Extending Partial Orthogonal Drawings" in Graph Drawing and Network Visualization - 28th International Symposium, GD 2020 , David Auber and Pavel Valtr, Eds. Springer , 2020. pp. 265-278.
DOI: 10.1007/978-3-030-68766-3

M. A. Shalu, S. Vijayakumar and T. P. Sandhya, "On the complexity of cd-coloring of graphs" , Discret. Appl. Math. , vol. 280 , pp. 171-185 , 2020.
DOI: 10.1016/j.dam.2018.03.004

M. A. Bekos, C. Binucci, G. D. Battista, W. Didimo, M. Gronemann, K. Klein, M. Patrignani and I. Rutter, "On Turn-Regular Orthogonal Representations" in Graph Drawing and Network Visualization - 28th International Symposium, GD 2020 , David Auber and Pavel Valtr, Eds. Springer , 2020. pp. 250-264.
DOI: 10.1007/978-3-030-68766-3

I. Rutter, "Simultaneous Embedding" in Beyond Planar Graphs, Communications of NII Shonan Meetings , Seok-Hee Hong and Takeshi Tokuyama, Eds. Springer , 2020 , pp. 237-265.
DOI: 10.1007/978-981-15-6533-5

G. Liotta, I. Rutter and A. Tappini, "Simultaneous FPQ-Ordering and Hybrid Planarity Testing" in SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings , Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora, Eds. Springer , 2020. pp. 617-626.
DOI: 10.1007/978-3-030-38919-2_51

M. Radermacher, I. Rutter and P. Stumpf, "Towards a Characterization of Stretchable Aligned Graphs" in Graph Drawing and Network Visualization - 28th International Symposium, GD 2020 , David Auber and Pavel Valtr, Eds. Springer , 2020. pp. 295-307.
DOI: 10.1007/978-3-030-68766-3

S. Chaplick, T. Itoh, G. Liotta, K. Ma and I. Rutter, "Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171)" , NII Shonan Meet. Rep. , vol. 2020 , 2020.
https://shonan.nii.ac.jp/seminars/171/

G. Brückner, M. Himmel and I. Rutter, "An SPQR-Tree-Like Embedding Representation for Upward Planarity" in Graph Drawing and Network Visualization - 27th International Symposium, GD 2019 , Daniel Archambault and Csaba D. Tóth, Eds. Springer , 2019. pp. 517-531.
DOI: 10.1007/978-3-030-35802-0_39

T. Mchedlidze, M. Radermacher, I. Rutter and N. Zimbel, "Drawing Clustered Graphs on Disk Arrangements" in WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings , Gautam K. Das and Partha Sarathi Mandal and Krishnendu Mukhopadhyaya and Shin-Ichi Nakano, Eds. Springer , 2019. pp. 160-171.
DOI: 10.1007/978-3-030-10564-8_13

B. Niedermann, I. Rutter and M. Wolf, "Efficient Algorithms for Ortho-Radial Graph Drawing" in 35th International Symposium on Computational Geometry, SoCG 2019 , Gill Barequet and Yusu Wang, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2019. pp. 53:1-53:14.
DOI: 10.4230/LIPIcs.SoCG.2019.53

M. Radermacher and I. Rutter, "Geometric Crossing-Minimization - A Scalable Randomized Approach" in 27th Annual European Symposium on Algorithms, ESA 2019 , Michael A. Bender and Ola Svensson and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2019. pp. 76:1-76:16.
DOI: 10.4230/LIPIcs.ESA.2019.76

M. Radermacher, K. Reichard, I. Rutter and D. Wagner, "Geometric Heuristics for Rectilinear Crossing Minimization" , ACM J. Exp. Algorithmics , vol. 24 , no. 1 , pp. 1.12:1-1.12:21 , 2019.
DOI: 10.1145/3325861

P. Kindermann, T. Mchedlidze and I. Rutter, "Graph Drawing Contest Report" in Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings , Daniel Archambault and Csaba D. Tóth, Eds. Springer , 2019. pp. 575-583.
DOI: 10.1007/978-3-030-35802-0_43

Y. Asahiro, J. Jansson, E. Miyano, H. Ono and T. P. Sandhya, "Graph Orientation with Edge Modifications" in Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Proceedings , Yijia Chen and Xiaotie Deng and Mei Lu, Eds. Springer , 2019. pp. 38-50.
DOI: 10.1007/978-3-030-18126-0

T. Bläsius, M. Radermacher and I. Rutter, "How to Draw a Planarization" , J. Graph Algorithms Appl. , vol. 23 , no. 4 , pp. 653-682 , 2019.
DOI: 10.7155/jgaa.00506

V. Arzamasov, K. Böhm and I. Rutter, "Minimizing Bias in Estimation of Mutual Information from Data Streams" in Proceedings of the 31st International Conference on Scientific and Statistical Database Management, SSDBM 2019 , Carlos Maltzahn and Tanu Malik, Eds. ACM , 2019. pp. 1-12.
DOI: 10.1145/3335783.3335796

E. D. Giacomo, G. Liotta, M. Patrignani, I. Rutter and A. Tappini, "NodeTrix Planarity Testing with Small Clusters" , Algorithmica , vol. 81 , no. 9 , pp. 3464-3493 , 2019.
DOI: 10.1007/s00453-019-00585-6

G. D. Lozzo and I. Rutter, "Planarity of streamed graphs" , Theor. Comput. Sci. , vol. 799 , pp. 1-21 , 2019.
DOI: 10.1016/j.tcs.2019.09.029

G. D. Lozzo and I. Rutter, "Reaching 3-Connectivity via Edge-Edge Additions" in Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings , Charles J. Colbourn and Roberto Grossi and Nadia Pisanti, Eds. Springer , 2019. pp. 175-187.
DOI: 10.1007/978-3-030-25005-8_15

I. Rutter, D. Strash, P. Stumpf and M. Vollmer, "Simultaneous Representation of Proper and Unit Interval Graphs" in 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany , Michael A. Bender and Ola Svensson and Grzegorz Herman, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2019. pp. 80:1-80:15.
DOI: 10.4230/LIPIcs.ESA.2019.80

M. A. Shalu, S. Vijayakumar and T. P. Sandhya, "The Induced Star Partition of Graphs" in Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Proceedings , Sudebkumar Prasant Pal and Ambat Vijayakumar, Eds. Springer , 2019. pp. 16-28.
DOI: 10.1007/978-3-030-11509-8

M. Radermacher, K. Reichard, I. Rutter and D. Wagner, "A Geometric Heuristic for Rectilinear Crossing Minimization" in Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018 , Rasmus Pagh and Suresh Venkatasubramanian, Eds. SIAM , 2018. pp. 129-138.
DOI: 10.1137/1.9781611975055.12

T. Mchedlidze, M. Radermacher and I. Rutter, "Aligned Drawings of Planar Graphs" , J. Graph Algorithms Appl. , vol. 22 , no. 3 , pp. 401-429 , 2018.
DOI: 10.7155/jgaa.00475

G. D. Lozzo and I. Rutter, "Approximation Algorithms for Facial Cycles in Planar Embeddings" in 29th International Symposium on Algorithms and Computation, ISAAC 2018 , Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 2018. pp. 41:1-41:13.
DOI: 10.4230/LIPIcs.ISAAC.2018.41

S. W. Bae, J. Baffier, J. Chun, P. Eades, K. Eickmeyer, L. Grilli, S. Hong, M. Korman, F. Montecchiani, I. Rutter and C. D. Tóth, "Gap-planar graphs" , Theor. Comput. Sci. , vol. 745 , pp. 36-52 , 2018.
DOI: 10.1016/j.tcs.2018.05.029

W. E. Devanny, P. Kindermann, M. Löffler and I. Rutter, "Graph Drawing Contest Report" in Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings , Therese C. Biedl and Andreas Kerren, Eds. Springer , 2018. pp. 609-617.
DOI: 10.1007/978-3-030-04414-5_43

M. Radermacher and I. Rutter, "Inserting an Edge into a Geometric Embedding" in Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings , Therese C. Biedl and Andreas Kerren, Eds. Springer , 2018. pp. 402-415.
DOI: 10.1007/978-3-030-04414-5_29

G. Brückner, I. Rutter and P. Stumpf, "Level Planarity: Transitivity vs. Even Crossings" in Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings , Therese C. Biedl and Andreas Kerren, Eds. Springer , 2018. pp. 39-52.
DOI: 10.1007/978-3-030-04414-5_3

M. Mnich, I. Rutter and J. M. Schmidt, "Linear-time recognition of map graphs with outerplanar witness" , Discret. Optim. , vol. 28 , pp. 63-77 , 2018.
DOI: 10.1016/j.disopt.2017.12.002

T. Bläsius, P. Stumpf and T. Ueckerdt, "Local and union boxicity" , Discrete Mathematics , vol. 341 , no. 5 , pp. 1307-1315 , 2018.
DOI: 10.1016/j.disc.2018.02.003

M. Vollmer, I. Rutter and K. Böhm, "On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data" in Proceedings of the 21st International Conference on Extending Database Technology, EDBT 2018 , Michael H. Böhlen and Reinhard Pichler and Norman May and Erhard Rahm and Shan-Hung Wu and Katja Hose, Eds. OpenProceedings.org , 2018. pp. 49-60.
DOI: 10.5441/002/edbt.2018.06

M. A. Shalu, S. Vijayakumar, S. D. Yamini and T. P. Sandhya, "On the algorithmic aspects of strong subcoloring" , Journal of Combinatorial Optimization , vol. 35 , no. 4 , pp. 1312-1329 , 2018.
DOI: 10.1007/s10878-018-0272-z
https://link.springer.com/article/10.1007/s10878-018-0272-z

M. Baum, T. Bläsius, A. Gemsa, I. Rutter and F. Wegner, "Scalable exact visualization of isocontours in road networks via minimum-link paths" , J. Comput. Geom. , vol. 9 , no. 1 , pp. 27-73 , 2018.
DOI: 10.20382/jocg.v9i1a2

T. Bläsius, A. Karrer and I. Rutter, "Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices" , Algorithmica , vol. 80 , no. 4 , pp. 1214-1277 , 2018.
DOI: 10.1007/s00453-017-0301-9