Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings.

Ignaz Rutter University of Passau, Germany TU Eindhoven, The Netherlands Karlsruhe Institute of Technology, Germany http://i11www.iti.uni-karlsruhe.de/members/ignaz_rutter/index https://scholar.google.com/citations?user=BXLsurkAAAAJ https://zbmath.org/authors/?q=ai:rutter.ignaz https://orcid.org/0000-0002-3794-4406 https://www.wikidata.org/entity/Q62053780 https://d-nb.info/gnd/1146939809 https://mathgenealogy.org/id.php?id=156884

Jakob Baumann Ignaz Rutter Dirk Sudholt Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings. 2026 June 49 88 Algorithmica 3 https://doi.org/10.1007/s00453-025-01361-5 db/journals/algorithmica/algorithmica88.html#BaumannRS26 streams/journals/algorithmica

Therese Biedl Sabine Cornelsen Jan Kratochvíl Ignaz Rutter Constrained outer-string representations. 2026 114-134 390 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2026.04.018 db/journals/dam/dam390.html#BiedlCKR26 streams/journals/dam

Torsten Ueckerdt Miriam Goetze Michael Hoffmann 0001 Ignaz Rutter Crossing Number of Simple 3-Plane Drawings. 2026 1-21 30 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.v30i2.3117 db/journals/jgaa/jgaa30.html#UeckerdtGHR26 streams/journals/jgaa

Miriam Münch Simon D. Fink Matthias Pfretzschner Ignaz Rutter Heuristics for Exact 1-Planarity Testing. 2026 121-147 30 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.v30i2.3136 db/journals/jgaa/jgaa30.html#MunchFPR26 streams/journals/jgaa

Michael A. Bekos Giordano Da Lozzo Fabrizio Frati Siddharth Gupta 0002 Philipp Kindermann Giuseppe Liotta Ignaz Rutter Ioannis G. Tollis Weakly leveled planarity with bounded span. 2026 115811 1069 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2026.115811 db/journals/tcs/tcs1069.html#BekosLFGKLRT26 streams/journals/tcs

Giordano Da Lozzo Fabrizio Frati Ignaz Rutter Upward Book Embeddings of Partitioned Digraphs. 36:1-36:18 2026 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2026.36 conf/compgeom/2026 db/conf/compgeom/compgeom2026.html#LozzoFR26 Christophe Paul Ignaz Rutter Circle Graphs Can Be Recognized in Linear Time. 72:1-72:20 2026 STACS https://doi.org/10.4230/LIPIcs.STACS.2026.72 conf/stacs/2026 db/conf/stacs/stacs2026.html#PaulR26

Giordano Da Lozzo Fabrizio Frati Ignaz Rutter Upward Book Embeddings of Partitioned Digraphs. 2026 March abs/2603.17128 CoRR https://doi.org/10.48550/arXiv.2603.17128 db/journals/corr/corr2603.html#abs-2603-17128 streams/journals/corr

Patrizio Angelini Sabine Cornelsen Giordano Da Lozzo Fabrizio Frati Philipp Kindermann Ignaz Rutter Johannes Zink 0001 Upward-Planar Drawings with Bounded Span. 2026 May abs/2605.00603 CoRR https://doi.org/10.48550/arXiv.2605.00603 db/journals/corr/corr2605.html#abs-2605-00603 streams/journals/corr

Stephen G. Kobourov Maarten Löffler Fabrizio Montecchiani Marcin Pilipczuk Ignaz Rutter Raimund Seidel Manuel Sorge Jules Wulms The influence of dimensions on the complexity of computing decision trees. 104322 2025 343 Artif. Intell. https://doi.org/10.1016/j.artint.2025.104322 db/journals/ai/ai343.html#KobourovLMPRSSW25 streams/journals/ai

Ignaz Rutter Darren Strash Peter Stumpf Michael Vollmer 0001 Simultaneous Representation of Proper and Unit Interval Graphs. 783-811 2025 May 87 Algorithmica 5 https://doi.org/10.1007/s00453-025-01296-x db/journals/algorithmica/algorithmica87.html#RutterSSV25 streams/journals/algorithmica

Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter The Price of Upwardness. 2025 27 Discret. Math. Theor. Comput. Sci. 3 https://doi.org/10.46298/dmtcs.15222 db/journals/dmtcs/dmtcs27.html#AngeliniBCCLHLPPR25 streams/journals/dmtcs

Simon Dominik Fink Ignaz Rutter Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. 91-123 2025 29 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.v29i1.2923 db/journals/jgaa/jgaa29.html#FinkR25 streams/journals/jgaa

Tim Ophelders Ignaz Rutter Bettina Speckmann Kevin Verbeek Polygon-universal graphs. 488-516 2025 16 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v16i1a14 db/journals/jocg/jocg16.html#OpheldersRSV25

Guido Brückner Ignaz Rutter Partial and constrained level planarity. 115291 2025 1045 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2025.115291 db/journals/tcs/tcs1045.html#BrucknerR25 streams/journals/tcs

Martin Gruber Zlata Kikteva Ignaz Rutter Annette Hautli-Janisz DebArgVis: An Interactive Visualisation Tool for Exploring Argumentative Dynamics in Debate. 140-146 2025 ArgMining https://doi.org/10.18653/v1/2025.argmining-1.13 conf/argmining/2025 db/conf/argmining/argmining2025.html#GruberKRH25 Simon D. Fink Miriam Münch Matthias Pfretzschner Ignaz Rutter Heuristics for Exact 1-Planarity Testing. 4:1-4:19 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.4 conf/gd/2025 db/conf/gd/gd2025.html#FinkMPR25 Miriam Goetze Michael Hoffmann 0001 Ignaz Rutter Torsten Ueckerdt Crossing Number of Simple 3-Plane Drawings. 15:1-15:19 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.15 conf/gd/2025 db/conf/gd/gd2025.html#Goetze0RU25 Maarten Löffler Miriam Münch Ignaz Rutter Reeb Lobsters Are 1-Planar (Poster Abstract). 50:1-50:5 2025 GD https://doi.org/10.4230/LIPIcs.GD.2025.50 conf/gd/2025 db/conf/gd/gd2025.html#LofflerMR25 Jakob Baumann Ignaz Rutter Dirk Sudholt Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation. 872-880 2025 GECCO https://doi.org/10.1145/3712256.3726407 conf/gecco/2025 db/conf/gecco/gecco2025.html#BaumannRS25 Thomas Depian Simon D. Fink Alexander Firbas Robert Ganian Matthias Pfretzschner Ignaz Rutter Structural Parameterizations of Simultaneous Planarity. 25:1-25:17 2025 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2025.25 conf/isaac/2025 db/conf/isaac/isaac2025.html#DepianFFGPR25 Simon D. Fink Ignaz Rutter Sandhya T. P. 0001 A Simple Partially Embedded Planarity Test Based on Vertex-Addition. 496-508 2025 SOSA https://doi.org/10.1137/1.9781611978315.37 conf/sosa/2025 db/conf/sosa/sosa2025.html#FinkR025

Miriam Goetze Michael Hoffmann 0001 Ignaz Rutter Torsten Ueckerdt Crossing Number of 3-Plane Drawings. 2025 March abs/2503.08365 CoRR https://doi.org/10.48550/arXiv.2503.08365 db/journals/corr/corr2503.html#abs-2503-08365 streams/journals/corr

Christophe Paul Ignaz Rutter Circle graphs can be recognized in linear time. 2025 December abs/2512.23492 CoRR https://doi.org/10.48550/arXiv.2512.23492 db/journals/corr/corr2512.html#abs-2512-23492 streams/journals/corr

Miriam Münch Ignaz Rutter Peter Stumpf Partial and Simultaneous Transitive Orientations via Modular Decompositions. 1263-1292 2024 April 86 Algorithmica 4 https://doi.org/10.1007/s00453-023-01188-y db/journals/algorithmica/algorithmica86.html#MunchRS24

Guido Brückner Ignaz Rutter Peter Stumpf Extending Partial Representations of Circle Graphs in Near-Linear Time. 2152-2173 2024 July 86 Algorithmica 7 https://doi.org/10.1007/s00453-024-01216-5 db/journals/algorithmica/algorithmica86.html#BrucknerRS24 streams/journals/algorithmica

Simon Dominik Fink Ignaz Rutter Maintaining Triconnected Components under Node Expansion. 7:1-7:20 2024 3 Comput. Geom. Topol. 2 https://doi.org/10.57717/cgt.v3i2.44 db/journals/cgt/cgt3.html#FinkR24 streams/journals/cgt

Patricia Bachmann Ignaz Rutter Peter Stumpf On 3-Coloring Circle Graphs. 389-402 2024 28 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.v28i1.2991 db/journals/jgaa/jgaa28.html#BachmannRS24 streams/journals/jgaa

Jakob Baumann Matthias Pfretzschner Ignaz Rutter Parameterized complexity of vertex splitting to pathwidth at most 1. 114928 2024 1021 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2024.114928 db/journals/tcs/tcs1021.html#BaumannPR24

Simon D. Fink Ignaz Rutter Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. 1-14 2024 ALENEX https://doi.org/10.1137/1.9781611977929.1 conf/alenex/2024 db/conf/alenex/alenex2024.html#FinkR24 Therese Biedl Sabine Cornelsen Jan Kratochvíl Ignaz Rutter Constrained Outer-String Representations. 10:1-10:18 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.10 conf/gd/2024 db/conf/gd/gd2024.html#BiedlCKR24 Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter Alexander Wolff 0001 The Price of Upwardness. 13:1-13:20 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.13 conf/gd/2024 db/conf/gd/gd2024.html#AngeliniBCCL0LP24 Michael A. Bekos Giordano Da Lozzo Fabrizio Frati Siddharth Gupta 0002 Philipp Kindermann Giuseppe Liotta Ignaz Rutter Ioannis G. Tollis Weakly Leveled Planarity with Bounded Span. 19:1-19:19 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.19 conf/gd/2024 db/conf/gd/gd2024.html#BekosLF0KLRT24 Miriam Münch Ignaz Rutter Parameterized Algorithms for Beyond-Planar Crossing Numbers. 25:1-25:16 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.25 conf/gd/2024 db/conf/gd/gd2024.html#MunchR24 Julia Katheder Philipp Kindermann Fabian Klute Irene Parada Ignaz Rutter On k-Plane Insertion into Plane Drawings. 35:1-35:11 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.35 conf/gd/2024 db/conf/gd/gd2024.html#KathederKKPR24 Simon D. Fink Matthias Pfretzschner Ignaz Rutter Peter Stumpf Level Planarity Is More Difficult Than We Thought (Poster Abstract). 50:1-50:3 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.50 conf/gd/2024 db/conf/gd/gd2024.html#FinkPRS24 Jakob Baumann Ignaz Rutter Dirk Sudholt Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract). 51:1-51:3 2024 GD https://doi.org/10.4230/LIPIcs.GD.2024.51 conf/gd/2024 db/conf/gd/gd2024.html#BaumannRS24 Jakob Baumann Ignaz Rutter Dirk Sudholt Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. 2024 GECCO https://doi.org/10.1145/3638529.3654105 conf/gecco/2024 db/conf/gecco/gecco2024.html#BaumannRS24 Giordano Da Lozzo Walter Didimo Fabrizio Montecchiani Miriam Münch Maurizio Patrignani Ignaz Rutter Simple Realizability of Abstract Topological Graphs. 23:1-23:15 2024 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2024.23 conf/isaac/2024 db/conf/isaac/isaac2024.html#LozzoDMMPR24 Miriam Münch Maximilian Pfister 0002 Ignaz Rutter Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth. 430-443 2024 WG https://doi.org/10.1007/978-3-031-75409-8_30 conf/wg/2024 db/conf/wg/wg2024.html#MunchPR24 streams/conf/wg

Simon D. Fink Matthias Pfretzschner Ignaz Rutter Marie Diana Sieper Clustered Planarity Variants for Level Graphs. 2024 abs/2402.13153 CoRR https://doi.org/10.48550/arXiv.2402.13153 db/journals/corr/corr2402.html#abs-2402-13153

Julia Katheder Philipp Kindermann Fabian Klute Irene Parada Ignaz Rutter On k-Plane Insertion into Plane Drawings. 2024 abs/2402.14552 CoRR https://doi.org/10.48550/arXiv.2402.14552 db/journals/corr/corr2402.html#abs-2402-14552

Patrizio Angelini Therese Biedl Markus Chimani Sabine Cornelsen Giordano Da Lozzo Seok-Hee Hong 0001 Giuseppe Liotta Maurizio Patrignani Sergey Pupyrev Ignaz Rutter Alexander Wolff 0001 The Price of Upwardness. 2024 abs/2409.01475 CoRR https://doi.org/10.48550/arXiv.2409.01475 db/journals/corr/corr2409.html#abs-2409-01475 streams/journals/corr

Simon D. Fink Matthias Pfretzschner Ignaz Rutter Peter Stumpf Level Planarity Is More Difficult Than We Thought. 2024 abs/2409.01727 CoRR https://doi.org/10.48550/arXiv.2409.01727 db/journals/corr/corr2409.html#abs-2409-01727 streams/journals/corr

Michael A. Bekos Giordano Da Lozzo Fabrizio Frati Siddharth Gupta 0002 Philipp Kindermann Giuseppe Liotta Ignaz Rutter Ioannis G. Tollis Weakly Leveled Planarity with Bounded Span. 2024 abs/2409.01889 CoRR https://doi.org/10.48550/arXiv.2409.01889 db/journals/corr/corr2409.html#abs-2409-01889 streams/journals/corr

Jakob Baumann Ignaz Rutter Dirk Sudholt Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation. 2024 abs/2409.15312 CoRR https://doi.org/10.48550/arXiv.2409.15312 db/journals/corr/corr2409.html#abs-2409-15312 streams/journals/corr

Giordano Da Lozzo Walter Didimo Fabrizio Montecchiani Miriam Münch Maurizio Patrignani Ignaz Rutter Simple Realizability of Abstract Topological Graphs. 2024 abs/2409.20108 CoRR https://doi.org/10.48550/arXiv.2409.20108 db/journals/corr/corr2409.html#abs-2409-20108 streams/journals/corr

Simon D. Fink Ignaz Rutter T. P. Sandhya 0001 A Simple Partially Embedded Planarity Test Based on Vertex-Addition. 2024 abs/2410.13536 CoRR https://doi.org/10.48550/arXiv.2410.13536 db/journals/corr/corr2410.html#abs-2410-13536 streams/journals/corr

Sujoy Bhore Guangping Li 0001 Martin Nöllenburg Ignaz Rutter Hsiang-Yun Wu Untangling circular drawings: Algorithms and complexity. 101975 2023 April 111 Comput. Geom. https://doi.org/10.1016/j.comgeo.2022.101975 db/journals/comgeo/comgeo111.html#BhoreLNRW23

Lukas Barth Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. 1292-1355 2023 December 70 Discret. Comput. Geom. 4 https://doi.org/10.1007/s00454-023-00593-y db/journals/dcg/dcg70.html#BarthNRW23

Luca Grilli 0001 Seok-Hee Hong 0001 Jan Kratochvíl Ignaz Rutter Drawing Simultaneously Embedded Graphs with Few Bends. 807-824 2023 November 34 Int. J. Found. Comput. Sci. 7 https://doi.org/10.1142/S0129054123420017 db/journals/ijfcs/ijfcs34.html#GrilliHKR23

Giuseppe Liotta Ignaz Rutter Alessandra Tappini Parameterized complexity of graph planarity with restricted cyclic orders. 125-144 2023 August 135 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2023.02.007 db/journals/jcss/jcss135.html#LiottaRT23

Simon D. Fink Matthias Pfretzschner Ignaz Rutter Experimental Comparison of PC-Trees and PQ-Trees. 1.10:1-1.10:24 2023 December 28 ACM J. Exp. Algorithmics https://doi.org/10.1145/3611653 db/journals/jea/jea28.html#FinkPR23

Ignaz Rutter Helen C. Purchase Guest Editors' Foreword. 45-47 2023 27 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00613 db/journals/jgaa/jgaa27.html#RutterP23

Guido Brückner Ignaz Rutter An SPQR-tree-like embedding representation for level planarity. 48-77 2023 14 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v14i1a3 db/journals/jocg/jocg14.html#BrucknerR23

Thomas Bläsius Simon D. Fink Ignaz Rutter Synchronized Planarity with Applications to Constrained Planarity Problems. 34:1-34:23 2023 October 19 ACM Trans. Algorithms 4 https://doi.org/10.1145/3607474 db/journals/talg/talg19.html#BlasiusFR23

Stephen G. Kobourov Maarten Löffler Fabrizio Montecchiani Marcin Pilipczuk Ignaz Rutter Raimund Seidel Manuel Sorge Jules Wulms The Influence of Dimensions on the Complexity of Computing Decision Trees. 8343-8350 2023 AAAI https://doi.org/10.1609/aaai.v37i7.26006 conf/aaai/2023 db/conf/aaai/aaai2023.html#KobourovLMPRSSW23 Simon D. Fink Ignaz Rutter Maintaining Triconnected Components Under Node Expansion. 202-216 2023 CIAC https://doi.org/10.1007/978-3-031-30448-4_15 conf/ciac/2023 db/conf/ciac/ciac2023.html#FinkR23 Ignaz Rutter Peter Stumpf Simultaneous Representation of Interval Graphs in the Sunflower Case. 90:1-90:15 2023 ESA https://doi.org/10.4230/LIPIcs.ESA.2023.90 conf/esa/2023 db/conf/esa/esa2023.html#RutterS23 Simon D. Fink Matthias Pfretzschner Ignaz Rutter Parameterized Complexity of Simultaneous Planarity. 82-96 2023 GD (2) https://doi.org/10.1007/978-3-031-49275-4_6 conf/gd/2023-2 db/conf/gd/gd2023-2.html#FinkPR23 Patricia Bachmann Ignaz Rutter Peter Stumpf On 3-Coloring Circle Graphs. 152-160 2023 GD (1) https://doi.org/10.1007/978-3-031-49272-3_11 conf/gd/2023-1 db/conf/gd/gd2023-1.html#BachmannRS23 Jakob Baumann Matthias Pfretzschner Ignaz Rutter Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. 30-43 2023 WG https://doi.org/10.1007/978-3-031-43380-1_3 conf/wg/2023 db/conf/wg/wg2023.html#BaumannPR23

Simon D. Fink Ignaz Rutter Maintaining Triconnected Components under Node Expansion. 2023 abs/2301.03972 CoRR https://doi.org/10.48550/arXiv.2301.03972 db/journals/corr/corr2301.html#abs-2301-03972

Jakob Baumann Matthias Pfretzschner Ignaz Rutter Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. 2023 abs/2302.14725 CoRR https://doi.org/10.48550/arXiv.2302.14725 db/journals/corr/corr2302.html#abs-2302-14725

Simon D. Fink Matthias Pfretzschner Ignaz Rutter Parameterized Complexity of Simultaneous Planarity. 2023 abs/2308.11401 CoRR https://doi.org/10.48550/arXiv.2308.11401 db/journals/corr/corr2308.html#abs-2308-11401

Patricia Bachmann Ignaz Rutter Peter Stumpf On 3-Coloring Circle Graphs. 2023 abs/2309.02258 CoRR https://doi.org/10.48550/arXiv.2309.02258 db/journals/corr/corr2309.html#abs-2309-02258

Simon D. Fink Ignaz Rutter Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. 2023 abs/2310.20632 CoRR https://doi.org/10.48550/arXiv.2310.20632 db/journals/corr/corr2310.html#abs-2310-20632

Guido Brückner Ignaz Rutter Peter Stumpf Level-Planarity: Transitivity vs. Even Crossings. 2022 29 Electron. J. Comb. 4 https://doi.org/10.37236/10814 db/journals/combinatorics/combinatorics29.html#BrucknerRS22

Marcel Radermacher Ignaz Rutter Inserting an edge into a geometric embedding. 101843 2022 102 Comput. Geom. https://doi.org/10.1016/j.comgeo.2021.101843 db/journals/comgeo/comgeo102.html#RadermacherR22

Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 285-306 2022 26 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00595 db/journals/jgaa/jgaa26.html#BekosBBDGKPR22

Steven Chaplick Stefan Felsner Philipp Kindermann Jonathan Klawitter Ignaz Rutter Alexander Wolff 0001 Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. 66-74 2022 919 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.03.031 https://www.wikidata.org/entity/Q135924732 db/journals/tcs/tcs919.html#ChaplickFKKRW22

Michael A. Bekos Stefan Felsner Philipp Kindermann Stephen G. Kobourov Jan Kratochvíl Ignaz Rutter The Rique-Number of Graphs. 371-386 2022 GD https://doi.org/10.1007/978-3-031-22203-0_27 conf/gd/2022 db/conf/gd/gd2022.html#BekosFKKKR22 Steven Chaplick Philipp Kindermann Jonathan Klawitter Ignaz Rutter Alexander Wolff 0001 Morphing Rectangular Duals. 389-403 2022 GD https://doi.org/10.1007/978-3-031-22203-0_28 https://www.wikidata.org/entity/Q135924735 conf/gd/2022 db/conf/gd/gd2022.html#ChaplickKKRW22 Grzegorz Gutowski Florian Mittelstädt Ignaz Rutter Joachim Spoerhase Alexander Wolff 0001 Johannes Zink 0001 Coloring Mixed and Directional Interval Graphs. 418-431 2022 GD https://doi.org/10.1007/978-3-031-22203-0_30 conf/gd/2022 db/conf/gd/gd2022.html#GutowskiMRSWZ22 Miriam Münch Ignaz Rutter Peter Stumpf Partial and Simultaneous Transitive Orientations via Modular Decompositions. 51:1-51:16 2022 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2022.51 conf/isaac/2022 db/conf/isaac/isaac2022.html#MunchRS22 Guido Brückner Ignaz Rutter Peter Stumpf Extending Partial Representations of Circle Graphs in Near-Linear Time. 25:1-25:14 2022 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2022.25 conf/mfcs/2022 db/conf/mfcs/mfcs2022.html#BrucknerRS22 Jirí Fiala 0001 Ignaz Rutter Peter Stumpf Peter Zeman 0001 Extending Partial Representations of Circular-Arc Graphs. 230-243 2022 WG https://doi.org/10.1007/978-3-031-15914-5_17 conf/wg/2022 db/conf/wg/wg2022.html#FialaRSZ22 Giuseppe Liotta Ignaz Rutter Alessandra Tappini Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. 383-397 2022 WG https://doi.org/10.1007/978-3-031-15914-5_28 conf/wg/2022 db/conf/wg/wg2022.html#LiottaRT22

Stephen G. Kobourov Maarten Löffler Fabrizio Montecchiani Marcin Pilipczuk Ignaz Rutter Raimund Seidel Manuel Sorge Jules Wulms The Influence of Dimensions on the Complexity of Computing Decision Trees. 2022 abs/2205.07756 CoRR https://doi.org/10.48550/arXiv.2205.07756 db/journals/corr/corr2205.html#abs-2205-07756

Grzegorz Gutowski Florian Mittelstädt Ignaz Rutter Joachim Spoerhase Alexander Wolff 0001 Johannes Zink 0001 Coloring Mixed and Directional Interval Graphs. 2022 abs/2208.14250 CoRR https://doi.org/10.48550/arXiv.2208.14250 db/journals/corr/corr2208.html#abs-2208-14250

Michael A. Bekos Stefan Felsner Philipp Kindermann Stephen G. Kobourov Jan Kratochvíl Ignaz Rutter The Rique-Number of Graphs. 2022 abs/2209.00424 CoRR https://doi.org/10.48550/arXiv.2209.00424 db/journals/corr/corr2209.html#abs-2209-00424

Miriam Münch Ignaz Rutter Peter Stumpf Partial and Simultaneous Transitive Orientations via Modular Decomposition. 2022 abs/2209.13175 CoRR https://doi.org/10.48550/arXiv.2209.13175 db/journals/corr/corr2209.html#abs-2209-13175

Guido Brückner Ignaz Rutter Radial Level Planarity with Fixed Embedding. 353-366 2021 25 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00561 db/journals/jgaa/jgaa25.html#BrucknerR21

Patrizio Angelini Ignaz Rutter T. P. Sandhya 0001 Extending Partial Orthogonal Drawings. 581-602 2021 25 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00573 db/journals/jgaa/jgaa25.html#AngeliniRS21

Giuseppe Liotta Ignaz Rutter Alessandra Tappini Simultaneous FPQ-ordering and hybrid planarity testing. 59-79 2021 874 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.05.012 db/journals/tcs/tcs874.html#LiottaRT21

Steven Chaplick Philipp Kindermann Jonathan Klawitter Ignaz Rutter Alexander Wolff 0001 Extending Partial Representations of Rectangular Duals with Given Contact Orientations. 340-353 2021 CIAC https://doi.org/10.1007/978-3-030-75242-2_24 https://www.wikidata.org/entity/Q135924744 conf/ciac/2021 db/conf/ciac/ciac2021.html#ChaplickKKR021 Tim Ophelders Ignaz Rutter Bettina Speckmann Kevin Verbeek Polygon-Universal Graphs. 55:1-55:15 2021 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2021.55 conf/compgeom/2021 db/conf/compgeom/compgeom2021.html#OpheldersRSV21 Thomas Bläsius Simon D. Fink Ignaz Rutter Synchronized Planarity with Applications to Constrained Planarity Problems. 19:1-19:14 2021 ESA https://doi.org/10.4230/LIPIcs.ESA.2021.19 conf/esa/2021 db/conf/esa/esa2021.html#BlasiusFR21 Simon D. Fink Matthias Pfretzschner Ignaz Rutter Experimental Comparison of PC-Trees and PQ-Trees. 43:1-43:13 2021 ESA https://doi.org/10.4230/LIPIcs.ESA.2021.43 conf/esa/2021 db/conf/esa/esa2021.html#FinkPR21 Sujoy Bhore Guangping Li 0001 Martin Nöllenburg Ignaz Rutter Hsiang-Yun Wu Untangling Circular Drawings: Algorithms and Complexity. 19:1-19:17 2021 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2021.19 conf/isaac/2021 db/conf/isaac/isaac2021.html#Bhore0NRW21 Helen C. Purchase Ignaz Rutter Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers GD Springer 2021 Lecture Notes in Computer Science 12868 978-3-030-92931-2 https://doi.org/10.1007/978-3-030-92931-2 db/conf/gd/gd2021.html

Tim Ophelders Ignaz Rutter Bettina Speckmann Kevin Verbeek Polygon-Universal Graphs. 2021 abs/2103.06916 CoRR https://arxiv.org/abs/2103.06916 db/journals/corr/corr2103.html#abs-2103-06916

Lukas Barth Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. 2021 abs/2106.05734 CoRR https://arxiv.org/abs/2106.05734 db/journals/corr/corr2106.html#abs-2106-05734

Simon D. Fink Matthias Pfretzschner Ignaz Rutter Experimental Comparison of PC-Trees and PQ-Trees. 2021 abs/2106.14805 CoRR https://arxiv.org/abs/2106.14805 db/journals/corr/corr2106.html#abs-2106-14805

Jirí Fiala 0001 Ignaz Rutter Peter Stumpf Peter Zeman 0001 Extending Partial Representations of Circular-Arc Graphs. 2021 abs/2108.13076 CoRR https://arxiv.org/abs/2108.13076 db/journals/corr/corr2108.html#abs-2108-13076

Helen C. Purchase Ignaz Rutter Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021). 2021 abs/2109.04863 CoRR https://arxiv.org/abs/2109.04863 db/journals/corr/corr2109.html#abs-2109-04863

Sujoy Bhore Guangping Li 0001 Martin Nöllenburg Ignaz Rutter Hsiang-Yun Wu Untangling Circular Drawings: Algorithms and Complexity. 2021 abs/2111.09766 CoRR https://arxiv.org/abs/2111.09766 db/journals/corr/corr2111.html#abs-2111-09766

Steven Chaplick Philipp Kindermann Jonathan Klawitter Ignaz Rutter Alexander Wolff 0001 Morphing Rectangular Duals. 2021 abs/2112.03040 CoRR https://arxiv.org/abs/2112.03040 db/journals/corr/corr2112.html#abs-2112-03040

Patrizio Angelini Michael A. Bekos Franz J. Brandenburg Giordano Da Lozzo Giuseppe Di Battista Walter Didimo Michael Hoffmann 0001 Giuseppe Liotta Fabrizio Montecchiani Ignaz Rutter Csaba D. Tóth Simple k-planar graphs are simple (k + 1)-quasiplanar. 1-35 2020 142 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2019.08.006 db/journals/jctb/jctb142.html#AngeliniBBLBDHL20

Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Nina Zimbel Drawing Clustered Planar Graphs on Disk Arrangements. 105-131 2020 24 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00521 db/journals/jgaa/jgaa24.html#MchedlidzeRRZ20

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Beyond level planarity: Cyclic, torus, and simultaneous level planarity. 161-170 2020 804 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.11.024 db/journals/tcs/tcs804.html#AngeliniLBFPR20

Benjamin Niedermann Ignaz Rutter An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. 235-249 2020 GD https://doi.org/10.1007/978-3-030-68766-3_19 conf/gd/2020 db/conf/gd/gd2020.html#NiedermannR20 Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 250-264 2020 GD https://doi.org/10.1007/978-3-030-68766-3_20 conf/gd/2020 db/conf/gd/gd2020.html#BekosBBDG0PR20 Patrizio Angelini Ignaz Rutter Sandhya T. P. 0001 Extending Partial Orthogonal Drawings. 265-278 2020 GD https://doi.org/10.1007/978-3-030-68766-3_21 conf/gd/2020 db/conf/gd/gd2020.html#AngeliniRP20 Marcel Radermacher Ignaz Rutter Peter Stumpf Towards a Characterization of Stretchable Aligned Graphs. 295-307 2020 GD https://doi.org/10.1007/978-3-030-68766-3_23 conf/gd/2020 db/conf/gd/gd2020.html#RadermacherRS20 Philipp Kindermann Tamara Mchedlidze Wouter Meulemans Ignaz Rutter Graph Drawing Contest Report. 507-519 2020 GD https://doi.org/10.1007/978-3-030-68766-3_39 conf/gd/2020 db/conf/gd/gd2020.html#KindermannMMR20 Guido Brückner Ignaz Rutter An SPQR-Tree-Like Embedding Representation for Level Planarity. 8:1-8:15 2020 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2020.8 conf/isaac/2020 db/conf/isaac/isaac2020.html#BrucknerR20 Giuseppe Liotta Ignaz Rutter Alessandra Tappini Simultaneous FPQ-Ordering and Hybrid Planarity Testing. 617-626 2020 SOFSEM https://doi.org/10.1007/978-3-030-38919-2_51 conf/sofsem/2020 db/conf/sofsem/sofsem2020.html#LiottaRT20 Ignaz Rutter Simultaneous Embedding. 237-265 2020 Beyond Planar Graphs https://doi.org/10.1007/978-981-15-6533-5_13 books/sp/20/HT2020 db/books/collections/HT2020.html#Rutter20

Thomas Bläsius Simon D. Fink Ignaz Rutter Synchronized Planarity with Applications to Constrained Planarity Problems. 2020 abs/2007.15362 CoRR https://arxiv.org/abs/2007.15362 db/journals/corr/corr2007.html#abs-2007-15362

Marcel Radermacher Ignaz Rutter Peter Stumpf Towards a characterization of stretchable aligned graphs. 2020 abs/2008.06300 CoRR https://arxiv.org/abs/2008.06300 db/journals/corr/corr2008.html#abs-2008-06300

Michael A. Bekos Carla Binucci Giuseppe Di Battista Walter Didimo Martin Gronemann Karsten Klein 0001 Maurizio Patrignani Ignaz Rutter On Turn-Regular Orthogonal Representations. 2020 abs/2008.09002 CoRR https://arxiv.org/abs/2008.09002 db/journals/corr/corr2008.html#abs-2008-09002

Patrizio Angelini Ignaz Rutter Sandhya T. P. 0001 Extending Partial Orthogonal Drawings. 2020 abs/2008.10280 CoRR https://arxiv.org/abs/2008.10280 db/journals/corr/corr2008.html#abs-2008-10280

Benjamin Niedermann Ignaz Rutter An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. 2020 abs/2008.10373 CoRR https://arxiv.org/abs/2008.10373 db/journals/corr/corr2008.html#abs-2008-10373

Guido Brückner Ignaz Rutter An SPQR-Tree-Like Embedding Representation for Level Planarity. 2020 abs/2009.12309 CoRR https://arxiv.org/abs/2009.12309 db/journals/corr/corr2009.html#abs-2009-12309

Steven Chaplick Takayuki Itoh Giuseppe Liotta Kwan-Liu Ma Ignaz Rutter Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). 2020 2020 NII Shonan Meet. Rep. https://shonan.nii.ac.jp/seminars/171/ db/journals/shonan-reports/shonan-reports2020.html#ChaplickILMR20

Emilio Di Giacomo Giuseppe Liotta Maurizio Patrignani Ignaz Rutter Alessandra Tappini NodeTrix Planarity Testing with Small Clusters. 3464-3493 2019 81 Algorithmica 9 https://doi.org/10.1007/s00453-019-00585-6 db/journals/algorithmica/algorithmica81.html#GiacomoLPRT19

Marcel Radermacher Klara Reichard Ignaz Rutter Dorothea Wagner Geometric Heuristics for Rectilinear Crossing Minimization. 1.12:1-1.12:21 2019 24 ACM J. Exp. Algorithmics 1 https://doi.org/10.1145/3325861 db/journals/jea/jea24.html#RadermacherRRW19

Thomas Bläsius Marcel Radermacher Ignaz Rutter How to Draw a Planarization. 653-682 2019 23 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00506 db/journals/jgaa/jgaa23.html#BlasiusRR19

Giordano Da Lozzo Ignaz Rutter Planarity of streamed graphs. 1-21 2019 799 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.09.029 db/journals/tcs/tcs799.html#LozzoR19

Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 Efficient Algorithms for Ortho-Radial Graph Drawing. 53:1-53:14 2019 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2019.53 conf/compgeom/2019 db/conf/compgeom/compgeom2019.html#NiedermannR019 Marcel Radermacher Ignaz Rutter Geometric Crossing-Minimization - A Scalable Randomized Approach. 76:1-76:16 2019 ESA https://doi.org/10.4230/LIPIcs.ESA.2019.76 conf/esa/2019 db/conf/esa/esa2019.html#RadermacherR19 Ignaz Rutter Darren Strash Peter Stumpf Michael Vollmer 0001 Simultaneous Representation of Proper and Unit Interval Graphs. 80:1-80:15 2019 ESA https://doi.org/10.4230/LIPIcs.ESA.2019.80 conf/esa/2019 db/conf/esa/esa2019.html#RutterSSV19 Guido Brückner Markus Himmel Ignaz Rutter An SPQR-Tree-Like Embedding Representation for Upward Planarity. 517-531 2019 GD https://doi.org/10.1007/978-3-030-35802-0_39 conf/gd/2019 db/conf/gd/gd2019.html#BrucknerHR19 Philipp Kindermann Tamara Mchedlidze Ignaz Rutter Graph Drawing Contest Report. 575-583 2019 GD https://doi.org/10.1007/978-3-030-35802-0_43 conf/gd/2019 db/conf/gd/gd2019.html#KindermannMR19 Giordano Da Lozzo Ignaz Rutter Reaching 3-Connectivity via Edge-Edge Additions. 175-187 2019 IWOCA https://doi.org/10.1007/978-3-030-25005-8_15 conf/iwoca/2019 db/conf/iwoca/iwoca2019.html#LozzoR19 Vadim Arzamasov Klemens Böhm Ignaz Rutter Minimizing Bias in Estimation of Mutual Information from Data Streams. 1-12 2019 SSDBM https://doi.org/10.1145/3335783.3335796 conf/ssdbm/2019 db/conf/ssdbm/ssdbm2019.html#ArzamasovBR19 Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Nina Zimbel Drawing Clustered Graphs on Disk Arrangements. 160-171 2019 WALCOM https://doi.org/10.1007/978-3-030-10564-8_13 conf/walcom/2019 db/conf/walcom/walcom2019.html#MchedlidzeRRZ19

Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 Efficient Algorithms for Ortho-Radial Graph Drawing. 2019 abs/1903.05048 CoRR http://arxiv.org/abs/1903.05048 db/journals/corr/corr1903.html#abs-1903-05048

Giuseppe Liotta Ignaz Rutter Alessandra Tappini Graph Planarity Testing with Hierarchical Embedding Constraints. 2019 abs/1904.12596 CoRR http://arxiv.org/abs/1904.12596 db/journals/corr/corr1904.html#abs-1904-12596

Marcel Radermacher Ignaz Rutter Geometric Crossing-Minimization - A Scalable Randomized Approach. 2019 abs/1907.01243 CoRR http://arxiv.org/abs/1907.01243 db/journals/corr/corr1907.html#abs-1907-01243

Guido Brückner Markus Himmel Ignaz Rutter An SPQR-Tree-Like Embedding Representation for Upward Planarity. 2019 abs/1908.00352 CoRR http://arxiv.org/abs/1908.00352 db/journals/corr/corr1908.html#abs-1908-00352

Ignaz Rutter Darren Strash Peter Stumpf Michael Vollmer 0001 Simultaneous Representation of Proper and Unit Interval Graphs. 2019 abs/1908.08882 CoRR http://arxiv.org/abs/1908.08882 db/journals/corr/corr1908.html#abs-1908-08882

Patrizio Angelini Michael A. Bekos Franz J. Brandenburg Giordano Da Lozzo Giuseppe Di Battista Walter Didimo Michael Hoffmann 0001 Giuseppe Liotta Fabrizio Montecchiani Ignaz Rutter Csaba D. Tóth Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. 2019 abs/1909.00223 CoRR http://arxiv.org/abs/1909.00223 db/journals/corr/corr1909.html#abs-1909-00223

Giuseppe Liotta Ignaz Rutter Alessandra Tappini Simultaneous FPQ-Ordering and Hybrid Planarity Testing. 2019 abs/1910.10113 CoRR http://arxiv.org/abs/1910.10113 db/journals/corr/corr1910.html#abs-1910-10113

Thomas Bläsius Annette Karrer Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. 1214-1277 2018 80 Algorithmica 4 https://doi.org/10.1007/s00453-017-0301-9 db/journals/algorithmica/algorithmica80.html#BlasiusKR18

Matthias Mnich Ignaz Rutter Jens M. Schmidt Linear-time recognition of map graphs with outerplanar witness. 63-77 2018 28 Discret. Optim. https://doi.org/10.1016/j.disopt.2017.12.002 db/journals/disopt/disopt28.html#MnichRS18

Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Aligned Drawings of Planar Graphs. 401-429 2018 22 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00475 https://www.wikidata.org/entity/Q129341432 db/journals/jgaa/jgaa22.html#MchedlidzeRR18

Moritz Baum Thomas Bläsius Andreas Gemsa Ignaz Rutter Franziska Wegner Scalable exact visualization of isocontours in road networks via minimum-link paths. 27-73 2018 9 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v9i1a2 db/journals/jocg/jocg9.html#BaumBGRW18

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Valentino Di Donato Philipp Kindermann Günter Rote Ignaz Rutter Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. 54:1-54:24 2018 14 ACM Trans. Algorithms 4 https://doi.org/10.1145/3239561 https://www.wikidata.org/entity/Q129227642 db/journals/talg/talg14.html#AngeliniLBDKRR18

Sang Won Bae 0001 Jean-François Baffier Jinhee Chun Peter Eades Kord Eickmeyer Luca Grilli 0001 Seok-Hee Hong 0001 Matias Korman Fabrizio Montecchiani Ignaz Rutter Csaba D. Tóth Gap-planar graphs. 36-52 2018 745 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.05.029 db/journals/tcs/tcs745.html#BaeBCEE0HKMRT18

Marcel Radermacher Klara Reichard Ignaz Rutter Dorothea Wagner A Geometric Heuristic for Rectilinear Crossing Minimization. 129-138 2018 ALENEX https://doi.org/10.1137/1.9781611975055.12 conf/alenex/2018 db/conf/alenex/alenex2018.html#RadermacherRRW18 Mark Alfano Scott W. Cunningham Wouter Meulemans Ignaz Rutter Max Sondag Bettina Speckmann Emily Sullivan Social Network-Epistemology. 320-321 2018 eScience https://doi.org/10.1109/eScience.2018.00073 https://doi.ieeecomputersociety.org/10.1109/eScience.2018.00073 conf/eScience/2018 db/conf/eScience/eScience2018.html#AlfanoCMRSSS18 Michael Vollmer 0001 Ignaz Rutter Klemens Böhm On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data. 49-60 2018 EDBT https://doi.org/10.5441/002/edbt.2018.06 conf/edbt/2018 db/conf/edbt/edbt2018.html#VollmerRB18 Alban Grastien Ignaz Rutter Dorothea Wagner Franziska Wegner Matthias Wolf 0004 The Maximum Transmission Switching Flow Problem. 340-360 2018 e-Energy https://doi.org/10.1145/3208903.3208910 conf/eenergy/2018 db/conf/eenergy/eenergy2018.html#GrastienRWW018 Guido Brückner Ignaz Rutter Peter Stumpf Level Planarity: Transitivity vs. Even Crossings. 39-52 2018 GD https://doi.org/10.1007/978-3-030-04414-5_3 conf/gd/2018 db/conf/gd/gd2018.html#BrucknerRS18 Marcel Radermacher Ignaz Rutter Inserting an Edge into a Geometric Embedding. 402-415 2018 GD https://doi.org/10.1007/978-3-030-04414-5_29 conf/gd/2018 db/conf/gd/gd2018.html#RadermacherR18 William E. Devanny Philipp Kindermann Maarten Löffler Ignaz Rutter Graph Drawing Contest Report. 609-617 2018 GD https://doi.org/10.1007/978-3-030-04414-5_43 conf/gd/2018 db/conf/gd/gd2018.html#DevannyKLR18 Giordano Da Lozzo Ignaz Rutter Approximation Algorithms for Facial Cycles in Planar Embeddings. 41:1-41:13 2018 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2018.41 conf/isaac/2018 db/conf/isaac/isaac2018.html#LozzoR18

Marcel Radermacher Ignaz Rutter Inserting an Edge into a Geometric Embedding. 2018 abs/1807.11711 CoRR http://arxiv.org/abs/1807.11711 db/journals/corr/corr1807.html#abs-1807-11711

Guido Brückner Ignaz Rutter Peter Stumpf Level Planarity: Transitivity vs. Even Crossings. 2018 abs/1808.09931 CoRR http://arxiv.org/abs/1808.09931 db/journals/corr/corr1808.html#abs-1808-09931

Philipp Kindermann Boris Klemz Ignaz Rutter Patrick Schnider André Schulz 0001 The Partition Spanning Forest Problem. 2018 abs/1809.02710 CoRR http://arxiv.org/abs/1809.02710 db/journals/corr/corr1809.html#abs-1809-02710

Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Nina Zimbel Drawing Clustered Graphs on Disk Arrangements. 2018 abs/1811.00785 CoRR http://arxiv.org/abs/1811.00785 db/journals/corr/corr1811.html#abs-1811-00785

Pavel Klavík Jan Kratochvíl Yota Otachi Ignaz Rutter Toshiki Saitoh Maria Saumell Tomás Vyskocil Extending Partial Representations of Proper and Unit Interval Graphs. 1071-1104 2017 77 Algorithmica 4 https://doi.org/10.1007/s00453-016-0133-z https://www.wikidata.org/entity/Q62048072 db/journals/algorithmica/algorithmica77.html#KlavikKORSSV17

Martin Nöllenburg Roman Prutkin Ignaz Rutter Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. 121- 2017 27 Int. J. Comput. Geom. Appl. 1-2 https://doi.org/10.1142/S0218195917600068 db/journals/ijcga/ijcga27.html#NollenburgPR17

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 731-755 2017 21 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00437 db/journals/jgaa/jgaa21.html#AngeliniLBFPR17

Benjamin Niedermann Martin Nöllenburg Ignaz Rutter Radial contour labeling with straight leaders. 295-304 2017 PacificVis https://doi.org/10.1109/PACIFICVIS.2017.8031608 https://doi.ieeecomputersociety.org/10.1109/PACIFICVIS.2017.8031608 conf/apvis/2017 db/conf/apvis/pacificvis2017.html#NiedermannNR17 Lukas Barth Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. 14:1-14:16 2017 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2017.14 conf/compgeom/2017 db/conf/compgeom/compgeom2017.html#BarthNRW17 Sebastian Lehmann Ignaz Rutter Dorothea Wagner Franziska Wegner A Simulated-Annealing-Based Approach for Wind Farm Cabling. 203-215 2017 e-Energy https://doi.org/10.1145/3077839.3077843 conf/eenergy/2017 db/conf/eenergy/eenergy2017.html#LehmannRWW17 Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Aligned Drawings of Planar Graphs. 3-16 2017 GD https://doi.org/10.1007/978-3-319-73915-1_1 conf/gd/2017 db/conf/gd/gd2017.html#MchedlidzeRR17 Sang Won Bae 0001 Jean-François Baffier Jinhee Chun Peter Eades Kord Eickmeyer Luca Grilli 0001 Seok-Hee Hong 0001 Matias Korman Fabrizio Montecchiani Ignaz Rutter Csaba D. Tóth Gap-Planar Graphs. 531-545 2017 GD https://doi.org/10.1007/978-3-319-73915-1_41 conf/gd/2017 db/conf/gd/gd2017.html#BaeBCEEGHKMRT17 William E. Devanny Philipp Kindermann Maarten Löffler Ignaz Rutter Graph Drawing Contest Report. 575-582 2017 GD https://doi.org/10.1007/978-3-319-73915-1_44 conf/gd/2017 db/conf/gd/gd2017.html#DevannyKLR17 Guido Brückner Ignaz Rutter Partial and Constrained Level Planarity. 2000-2011 2017 SODA https://doi.org/10.1137/1.9781611974782.130 http://dl.acm.org/citation.cfm?id=3039816 conf/soda/2017 db/conf/soda/soda2017.html#BrucknerR17 Thomas Bläsius Marcel Radermacher Ignaz Rutter How to Draw a Planarization. 295-308 2017 SOFSEM https://doi.org/10.1007/978-3-319-51963-0_23 conf/sofsem/2017 db/conf/sofsem/sofsem2017.html#BlasiusRR17 Patrizio Angelini Michael A. Bekos Franz J. Brandenburg Giordano Da Lozzo Giuseppe Di Battista Walter Didimo Giuseppe Liotta Fabrizio Montecchiani Ignaz Rutter On the Relationship Between k-Planar and k-Quasi-Planar Graphs. 59-74 2017 WG https://doi.org/10.1007/978-3-319-68705-6_5 conf/wg/2017 db/conf/wg/wg2017.html#AngeliniBBLBDLM17

Benjamin Niedermann Martin Nöllenburg Ignaz Rutter Radial Contour Labeling with Straight Leaders. 2017 abs/1702.01799 CoRR http://arxiv.org/abs/1702.01799 db/journals/corr/corr1702.html#NiedermannNR17

Lukas Barth Benjamin Niedermann Ignaz Rutter Matthias Wolf 0004 Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. 2017 abs/1703.06040 CoRR http://arxiv.org/abs/1703.06040 db/journals/corr/corr1703.html#BarthNRW17

Sang Won Bae 0001 Jean-François Baffier Jinhee Chun Peter Eades Kord Eickmeyer Luca Grilli 0001 Seok-Hee Hong 0001 Matias Korman Fabrizio Montecchiani Ignaz Rutter Csaba D. Tóth Gap-planar Graphs. 2017 abs/1708.07653 CoRR http://arxiv.org/abs/1708.07653 db/journals/corr/corr1708.html#abs-1708-07653

Tamara Mchedlidze Marcel Radermacher Ignaz Rutter Aligned Drawings of Planar Graphs. 2017 abs/1708.08778 CoRR http://arxiv.org/abs/1708.08778 db/journals/corr/corr1708.html#abs-1708-08778

Tamara Mchedlidze Martin Nöllenburg Ignaz Rutter Extending Convex Partial Drawings of Graphs. 47-67 2016 76 Algorithmica 1 https://doi.org/10.1007/s00453-015-0018-6 db/journals/algorithmica/algorithmica76.html#MchedlidzeNR16

Philipp Kindermann Benjamin Niedermann Ignaz Rutter Marcus Schaefer 0001 André Schulz 0001 Alexander Wolff 0001 Multi-sided Boundary Labeling. 225-258 2016 76 Algorithmica 1 https://doi.org/10.1007/s00453-015-0028-4 db/journals/algorithmica/algorithmica76.html#KindermannNRS0W16

Thomas Bläsius Sebastian Lehmann Ignaz Rutter Orthogonal graph drawing with inflexible edges. 26-40 2016 55 Comput. Geom. https://doi.org/10.1016/j.comgeo.2016.03.001 db/journals/comgeo/comgeo55.html#BlasiusLR16

Andreas Gemsa Martin Nöllenburg Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps. 1.4:1-1.4:21 2016 21 ACM J. Exp. Algorithmics 1 https://doi.org/10.1145/2851493 https://www.wikidata.org/entity/Q130860350 db/journals/jea/jea21.html#GemsaNR16

Martin Nöllenburg Roman Prutkin Ignaz Rutter On self-approaching and increasing-chord drawings of 3-connected planar graphs. 47-69 2016 7 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v7i1a3 db/journals/jocg/jocg7.html#NollenburgPR16

Andreas Gemsa Martin Nöllenburg Ignaz Rutter Consistent labeling of rotating maps. 308-331 2016 7 J. Comput. Geom. 1 https://doi.org/10.20382/jocg.v7i1a15 db/journals/jocg/jocg7.html#GemsaNR16

Thomas Bläsius Ignaz Rutter Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. 16:1-16:46 2016 12 ACM Trans. Algorithms 2 https://doi.org/10.1145/2738054 https://www.wikidata.org/entity/Q130963680 db/journals/talg/talg12.html#BlasiusR16

Thomas Bläsius Ignaz Rutter Dorothea Wagner Optimal Orthogonal Graph Drawing with Convex Bend Costs. 33:1-33:32 2016 12 ACM Trans. Algorithms 3 https://doi.org/10.1145/2838736 db/journals/talg/talg12.html#BlasiusRW16

Thomas Bläsius Ignaz Rutter A new perspective on clustered planarity as a combinatorial embedding problem. 306-315 2016 609 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.10.011 db/journals/tcs/tcs609.html#BlasiusR16

Reinhard Bauer Tobias Columbus Ignaz Rutter Dorothea Wagner Search-space size in contraction hierarchies. 112-127 2016 645 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2016.07.003 db/journals/tcs/tcs645.html#BauerCRW16

Moritz Baum Thomas Bläsius Andreas Gemsa Ignaz Rutter Franziska Wegner Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. 7:1-7:18 2016 ESA https://doi.org/10.4230/LIPIcs.ESA.2016.7 conf/esa/2016 db/conf/esa/esa2016.html#BaumBGRW16 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Beyond Level Planarity. 482-495 2016 GD https://doi.org/10.1007/978-3-319-50106-2_37 conf/gd/2016 db/conf/gd/gd2016.html#AngeliniLBFPR16 Patrizio Angelini Steven Chaplick Sabine Cornelsen Giordano Da Lozzo Giuseppe Di Battista Peter Eades Philipp Kindermann Jan Kratochvíl Fabian Lipp Ignaz Rutter Simultaneous Orthogonal Planarity. 532-545 2016 GD https://doi.org/10.1007/978-3-319-50106-2_41 conf/gd/2016 db/conf/gd/gd2016.html#AngeliniCCLBEKK16 Philipp Kindermann Maarten Löffler Lev Nachmanson Ignaz Rutter Graph Drawing Contest Report. 589-595 2016 GD https://doi.org/10.1007/978-3-319-50106-2_45 conf/gd/2016 db/conf/gd/gd2016.html#KindermannLNR16 Martin Nöllenburg Ignaz Rutter Alfred Schuhmacher Software Visualization via Hierarchic Micro/Macro Layouts. 155-162 2016 VISIGRAPP (2: IVAPP) https://doi.org/10.5220/0005785901530160 conf/grapp/2016ivapp db/conf/grapp/ivapp2016.html#NollenburgRS16 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Valentino Di Donato Philipp Kindermann Günter Rote Ignaz Rutter Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. 985-996 2016 SODA https://doi.org/10.1137/1.9781611974331.ch70 http://dl.acm.org/citation.cfm?id=2884505 conf/soda/2016 db/conf/soda/soda2016.html#AngeliniLBDKRR16 Matthias Mnich Ignaz Rutter Jens M. Schmidt Linear-Time Recognition of Map Graphs with Outerplanar Witness. 5:1-5:14 2016 SWAT https://doi.org/10.4230/LIPIcs.SWAT.2016.5 conf/swat/2016 db/conf/swat/swat2016.html#MnichRS16

Moritz Baum Thomas Bläsius Andreas Gemsa Ignaz Rutter Franziska Wegner Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. 2016 abs/1602.01777 CoRR http://arxiv.org/abs/1602.01777 db/journals/corr/corr1602.html#BaumBGRW16

Giordano Da Lozzo Ignaz Rutter Strengthening Hardness Results to 3-Connected Planar Graphs. 2016 abs/1607.02346 CoRR http://arxiv.org/abs/1607.02346 db/journals/corr/corr1607.html#LozzoR16

Giordano Da Lozzo Ignaz Rutter On the Complexity of Realizing Facial Cycles. 2016 abs/1607.02347 CoRR http://arxiv.org/abs/1607.02347 db/journals/corr/corr1607.html#LozzoR16a

Patrizio Angelini Steven Chaplick Sabine Cornelsen Giordano Da Lozzo Giuseppe Di Battista Peter Eades Philipp Kindermann Jan Kratochvíl Fabian Lipp Ignaz Rutter Simultaneous Orthogonal Planarity. 2016 abs/1608.08427 CoRR http://arxiv.org/abs/1608.08427 db/journals/corr/corr1608.html#AngeliniCCLBEKK16

Tanja Hartmann Jonathan Rollin Ignaz Rutter Regular Augmentation of Planar Graphs. 306-370 2015 73 Algorithmica 2 https://doi.org/10.1007/s00453-014-9922-4 db/journals/algorithmica/algorithmica73.html#HartmannRR15

Thomas Bläsius Ignaz Rutter Disconnectivity and relative positions in simultaneous embeddings. 459-478 2015 48 Comput. Geom. 6 https://doi.org/10.1016/j.comgeo.2015.02.002 db/journals/comgeo/comgeo48.html#BlasiusR15

Michael A. Bekos Sabine Cornelsen Martin Fink 0001 Seok-Hee Hong 0001 Michael Kaufmann 0001 Martin Nöllenburg Ignaz Rutter Antonios Symvonis Many-to-One Boundary Labeling with Backbones. 779-816 2015 19 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00379 db/journals/jgaa/jgaa19.html#BekosCFH0NRS15

Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Vít Jelínek Jan Kratochvíl Maurizio Patrignani Ignaz Rutter Testing Planarity of Partially Embedded Graphs. 32:1-32:42 2015 11 ACM Trans. Algorithms 4 https://doi.org/10.1145/2629341 https://www.wikidata.org/entity/Q130880629 db/journals/talg/talg11.html#AngeliniBFJKPR15

Jian-Jia Chen Mong-Jen Kao D. T. Lee Ignaz Rutter Dorothea Wagner Online dynamic power management with hard real-time guarantees. 46-64 2015 595 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.06.014 db/journals/tcs/tcs595.html#ChenKLRW15

Thomas Bläsius Sebastian Lehmann Ignaz Rutter Orthogonal Graph Drawing with Inflexible Edges. 61-73 2015 CIAC https://doi.org/10.1007/978-3-319-18173-8_4 conf/ciac/2015 db/conf/ciac/ciac2015.html#BlasiusLR15 Giordano Da Lozzo Ignaz Rutter Planarity of Streamed Graphs. 153-166 2015 CIAC https://doi.org/10.1007/978-3-319-18173-8_11 https://www.wikidata.org/entity/Q62046553 conf/ciac/2015 db/conf/ciac/ciac2015.html#LozzoR15 Thomas Leibfried Tamara Mchedlidze Nico Meyer-Hübner Martin Nöllenburg Ignaz Rutter Peter Sanders 0001 Dorothea Wagner Franziska Wegner Operating Power Grids with Few Flow Control Buses. 289-294 2015 e-Energy https://doi.org/10.1145/2768510.2768521 conf/eenergy/2015 db/conf/eenergy/eenergy2015.html#LeibfriedMMNRSW15 Tamara Mchedlidze Martin Nöllenburg Ignaz Rutter Dorothea Wagner Franziska Wegner Towards Realistic Flow Control in Power Grid Operation. 192-199 2015 D-A-CH EI https://doi.org/10.1007/978-3-319-25876-8_16 conf/energieinformatik/2015 db/conf/energieinformatik/energieinformatik2015.html#MchedlidzeNRWW15 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 217-230 2015 GD https://doi.org/10.1007/978-3-319-27261-0_19 https://www.wikidata.org/entity/Q62046549 conf/gd/2015 db/conf/gd/gd2015.html#AngeliniLBFPR15 Md. Jawaherul Alam Thomas Bläsius Ignaz Rutter Torsten Ueckerdt Alexander Wolff 0001 Pixel and Voxel Representations of Graphs. 472-486 2015 GD https://doi.org/10.1007/978-3-319-27261-0_39 conf/gd/2015 db/conf/gd/gd2015.html#AlamBRUW15 Philipp Kindermann Maarten Löffler Lev Nachmanson Ignaz Rutter Graph Drawing Contest Report. 531-537 2015 GD https://doi.org/10.1007/978-3-319-27261-0_43 conf/gd/2015 db/conf/gd/gd2015.html#KindermannLNR15 Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter On the Relationship Between Map Graphs and Clique Planar Graphs. 548-550 2015 GD https://doi.org/10.1007/978-3-319-27261-0_46 https://www.wikidata.org/entity/Q62046551 conf/gd/2015 db/conf/gd/gd2015.html#AngeliniLBFPR15a Martin Nöllenburg Roman Prutkin Ignaz Rutter Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. 637-649 2015 ISAAC https://doi.org/10.1007/978-3-662-48971-0_54 conf/isaac/2015 db/conf/isaac/isaac2015.html#NollenburgPR15 Sebastian Buchwald Manuel Mohr Ignaz Rutter Optimal Shuffle Code with Permutation Instructions. 528-541 2015 WADS https://doi.org/10.1007/978-3-319-21840-3_44 conf/wads/2015 db/conf/wads/wads2015.html#BuchwaldMR15

Giordano Da Lozzo Ignaz Rutter Planarity of Streamed Graphs. 2015 abs/1501.07106 CoRR http://arxiv.org/abs/1501.07106 db/journals/corr/corr1501.html#LozzoR15

Sebastian Buchwald Manuel Mohr Ignaz Rutter Optimal Shuffle Code with Permutation Instructions. 2015 abs/1504.07073 CoRR http://arxiv.org/abs/1504.07073 db/journals/corr/corr1504.html#BuchwaldMR15

Thomas Leibfried Tamara Mchedlidze Nico Meyer-Hübner Martin Nöllenburg Ignaz Rutter Peter Sanders 0001 Dorothea Wagner Franziska Wegner Operating Power Grids with Few Flow Control Buses. 2015 abs/1505.05747 CoRR http://arxiv.org/abs/1505.05747 db/journals/corr/corr1505.html#LeibfriedMMNRSW15

Thomas Bläsius Ignaz Rutter A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. 2015 abs/1506.05673 CoRR http://arxiv.org/abs/1506.05673 db/journals/corr/corr1506.html#BlasiusR15

Thomas Bläsius Annette Karrer Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. 2015 abs/1506.05715 CoRR http://arxiv.org/abs/1506.05715 db/journals/corr/corr1506.html#BlasiusKR15

Muhammad Jawaherul Alam Thomas Bläsius Ignaz Rutter Torsten Ueckerdt Alexander Wolff 0001 Pixel and Voxel Representations of Graphs. 2015 abs/1507.01450 CoRR http://arxiv.org/abs/1507.01450 db/journals/corr/corr1507.html#AlamBRUW15

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Intersection-Link Representations of Graphs. 2015 abs/1508.07557 CoRR http://arxiv.org/abs/1508.07557 db/journals/corr/corr1508.html#AngeliniLBFPR15

Martin Nöllenburg Roman Prutkin Ignaz Rutter Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. 2015 abs/1509.05635 CoRR http://arxiv.org/abs/1509.05635 db/journals/corr/corr1509.html#NollenburgPR15

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Valentino Di Donato Philipp Kindermann Günter Rote Ignaz Rutter Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. 2015 abs/1510.02659 CoRR http://arxiv.org/abs/1510.02659 db/journals/corr/corr1510.html#AngeliniLBDKRR15

Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Testing Cyclic Level and Simultaneous Level Planarity. 2015 abs/1510.08274 CoRR http://arxiv.org/abs/1510.08274 db/journals/corr/corr1510.html#AngeliniLBFPR15a

Thomas Bläsius Marcus Krug Ignaz Rutter Dorothea Wagner Orthogonal Graph Drawing with Flexibility Constraints. 859-885 2014 68 Algorithmica 4 https://doi.org/10.1007/s00453-012-9705-8 db/journals/algorithmica/algorithmica68.html#BlasiusKRW14

Daniel Delling Andreas Gemsa Martin Nöllenburg Thomas Pajor Ignaz Rutter On d-regular schematization of embedded paths. 381-406 2014 47 Comput. Geom. 3 https://doi.org/10.1016/j.comgeo.2013.10.002 db/journals/comgeo/comgeo47.html#DellingGNPR14

Patrizio Angelini Thomas Bläsius Ignaz Rutter Testing Mutual duality of Planar graphs. 325-346 2014 24 Int. J. Comput. Geom. Appl. 4 https://doi.org/10.1142/S0218195914600103 db/journals/ijcga/ijcga24.html#AngeliniBR14

Edith Brunel Andreas Gemsa Marcus Krug Ignaz Rutter Dorothea Wagner Generalizing Geometric Graphs. 35-76 2014 18 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00314 db/journals/jgaa/jgaa18.html#BrunelGKRW14

Gregor Betz Andreas Gemsa Christof Mathies Ignaz Rutter Dorothea Wagner Column-Based Graph Layouts. 677-708 2014 18 J. Graph Algorithms Appl. 5 https://doi.org/10.7155/jgaa.00341 db/journals/jgaa/jgaa18.html#BetzGMRW14

Thomas Bläsius Guido Brückner Ignaz Rutter Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. 161-172 2014 ESA https://doi.org/10.1007/978-3-662-44777-2_14 conf/esa/2014 db/conf/esa/esa2014.html#BlasiusBR14 Luca Grilli 0001 Seok-Hee Hong 0001 Jan Kratochvíl Ignaz Rutter Drawing Simultaneously Embedded Graphs with Few Bends. 40-51 2014 GD https://doi.org/10.1007/978-3-662-45803-7_4 conf/gd/2014 db/conf/gd/gd2014.html#GrilliHKR14 Thomas Bläsius Ignaz Rutter A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. 440-451 2014 GD https://doi.org/10.1007/978-3-662-45803-7_37 conf/gd/2014 db/conf/gd/gd2014.html#BlasiusR14 Martin Nöllenburg Roman Prutkin Ignaz Rutter On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. 476-487 2014 GD https://doi.org/10.1007/978-3-662-45803-7_40 conf/gd/2014 db/conf/gd/gd2014.html#NollenburgPR14 Carsten Gutwenger Maarten Löffler Lev Nachmanson Ignaz Rutter Graph Drawing Contest Report. 501-506 2014 GD https://doi.org/10.1007/978-3-662-45803-7_42 conf/gd/2014 db/conf/gd/gd2014.html#GutwengerLNR14 Giordano Da Lozzo Vít Jelínek Jan Kratochvíl Ignaz Rutter Planar Embeddings with Small and Uniform Faces. 633-645 2014 ISAAC https://doi.org/10.1007/978-3-319-13075-0_50 https://www.wikidata.org/entity/Q62046563 conf/isaac/2014 db/conf/isaac/isaac2014.html#LozzoJKR14 Jian-Jia Chen Mong-Jen Kao D. T. Lee Ignaz Rutter Dorothea Wagner Online Dynamic Power Management with Hard Real-Time Guarantees. 226-238 2014 STACS https://doi.org/10.4230/LIPIcs.STACS.2014.226 conf/stacs/2014 db/conf/stacs/stacs2014.html#ChenKLRW14 Pavel Klavík Jan Kratochvíl Yota Otachi Ignaz Rutter Toshiki Saitoh Maria Saumell Tomás Vyskocil Extending Partial Representations of Proper and Unit Interval Graphs. 253-264 2014 SWAT https://doi.org/10.1007/978-3-319-08404-6_22 https://www.wikidata.org/entity/Q62048083 conf/swat/2014 db/conf/swat/swat2014.html#KlavikKORSSV14 Andreas Gemsa Martin Nöllenburg Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps. 235-246 2014 SEA https://doi.org/10.1007/978-3-319-07959-2_20 conf/wea/2014 db/conf/wea/sea2014.html#GemsaNR14

Andreas Gemsa Martin Nöllenburg Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps. 2014 abs/1404.1849 CoRR http://arxiv.org/abs/1404.1849 db/journals/corr/corr1404.html#GemsaNR14

Thomas Bläsius Sebastian Lehmann Ignaz Rutter Orthogonal Graph Drawing with Inflexible Edges. 2014 abs/1404.2943 CoRR http://arxiv.org/abs/1404.2943 db/journals/corr/corr1404.html#BlasiusLR14

Thomas Bläsius Guido Brückner Ignaz Rutter Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. 2014 abs/1405.2300 CoRR http://arxiv.org/abs/1405.2300 db/journals/corr/corr1405.html#BlasiusBR14

Martin Nöllenburg Roman Prutkin Ignaz Rutter On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. 2014 abs/1409.0315 CoRR http://arxiv.org/abs/1409.0315 db/journals/corr/corr1409.html#NollenburgPR14

Giordano Da Lozzo Vít Jelínek Jan Kratochvíl Ignaz Rutter Planar Embeddings with Small and Uniform Faces. 2014 abs/1409.4299 CoRR http://arxiv.org/abs/1409.4299 db/journals/corr/corr1409.html#LozzoJKR14

Vít Jelínek Jan Kratochvíl Ignaz Rutter A Kuratowski-type theorem for planarity of partially embedded graphs. 466-492 2013 46 Comput. Geom. 4 https://doi.org/10.1016/j.comgeo.2012.07.005 db/journals/comgeo/comgeo46.html#JelinekKR13

Maria Axenovich Marcus Krug Georg Osang Ignaz Rutter Fork-forests in bi-colored complete bipartite graphs. 1363-1366 2013 161 Discret. Appl. Math. 10-11 https://doi.org/10.1016/j.dam.2013.01.023 db/journals/dam/dam161.html#AxenovichKOR13

Mong-Jen Kao Bastian Katz Marcus Krug D. T. Lee Ignaz Rutter Dorothea Wagner The density maximization problem in graphs. 723-754 2013 26 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-012-9465-z db/journals/jco/jco26.html#KaoKKLRW13

Reinhard Bauer Moritz Baum Ignaz Rutter Dorothea Wagner On the Complexity of Partitioning Graphs for Arc-Flags. 265-299 2013 17 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00294 db/journals/jgaa/jgaa17.html#BauerBRW13

Martin Nöllenburg Roman Prutkin Ignaz Rutter Edge-weighted contact representations of planar graphs. 441-473 2013 17 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00299 db/journals/jgaa/jgaa17.html#NollenburgPR13

Thomas Bläsius Annette Karrer Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. 220-231 2013 GD https://doi.org/10.1007/978-3-319-03841-4_20 conf/gd/2013 db/conf/gd/gd2013.html#BlasiusKR13 Michael A. Bekos Sabine Cornelsen Martin Fink 0001 Seok-Hee Hong 0001 Michael Kaufmann 0001 Martin Nöllenburg Ignaz Rutter Antonios Symvonis Many-to-One Boundary Labeling with Backbones. 244-255 2013 GD https://doi.org/10.1007/978-3-319-03841-4_22 conf/gd/2013 db/conf/gd/gd2013.html#BekosCFHKNRS13 Tamara Mchedlidze Martin Nöllenburg Ignaz Rutter Drawing Planar Graphs with a Prescribed Inner Face. 316-327 2013 GD https://doi.org/10.1007/978-3-319-03841-4_28 conf/gd/2013 db/conf/gd/gd2013.html#MchedlidzeNR13 Therese Biedl Thomas Bläsius Benjamin Niedermann Martin Nöllenburg Roman Prutkin Ignaz Rutter Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. 460-471 2013 GD https://doi.org/10.1007/978-3-319-03841-4_40 conf/gd/2013 db/conf/gd/gd2013.html#BiedlBNNPR13 Reinhard Bauer Tobias Columbus Ignaz Rutter Dorothea Wagner Search-Space Size in Contraction Hierarchies. 93-104 2013 ICALP (1) https://doi.org/10.1007/978-3-642-39206-1_9 conf/icalp/2013-1 db/conf/icalp/icalp2013-1.html#BauerCRW13 Thomas Bläsius Ignaz Rutter Dorothea Wagner Optimal Orthogonal Graph Drawing with Convex Bend Costs. 184-195 2013 ICALP (1) https://doi.org/10.1007/978-3-642-39206-1_16 conf/icalp/2013-1 db/conf/icalp/icalp2013-1.html#BlasiusRW13 Patrizio Angelini Thomas Bläsius Ignaz Rutter Testing Mutual Duality of Planar Graphs. 350-360 2013 ISAAC https://doi.org/10.1007/978-3-642-45030-3_33 conf/isaac/2013 db/conf/isaac/isaac2013.html#AngeliniBR13 Thomas Bläsius Ignaz Rutter Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. 1030-1043 2013 SODA https://doi.org/10.1137/1.9781611973105.74 conf/soda/2013 db/conf/soda/soda2013.html#BlasiusR13 Philipp Kindermann Benjamin Niedermann Ignaz Rutter Marcus Schaefer 0001 André Schulz 0001 Alexander Wolff 0001 Two-Sided Boundary Labeling with Adjacent Sides. 463-474 2013 WADS https://doi.org/10.1007/978-3-642-40104-6_40 conf/wads/2013 db/conf/wads/wads2013.html#KindermannNRSSW13 Thomas Bläsius Stephen G. Kobourov Ignaz Rutter Simultaneous Embedding of Planar Graphs. 349-381 2013 Handbook of Graph Drawing and Visualization reference/crc/2013gd db/reference/crc/gd2013.html#BlasiusKR13

Patrizio Angelini Thomas Bläsius Ignaz Rutter Testing Mutual Duality of Planar Graphs http://arxiv.org/abs/1303.1640 2013 CoRR abs/1303.1640 db/journals/corr/corr1303.html#abs-1303-1640

Jian-Jia Chen Mong-Jen Kao D. T. Lee Ignaz Rutter Dorothea Wagner Online Power-Managing Strategy with Hard Real-Time Guarantees http://arxiv.org/abs/1304.1590 2013 CoRR abs/1304.1590 db/journals/corr/corr1304.html#abs-1304-1590

Philipp Kindermann Benjamin Niedermann Ignaz Rutter Marcus Schaefer 0001 André Schulz 0001 Alexander Wolff 0001 Multi-Sided Boundary Labeling http://arxiv.org/abs/1305.0750 2013 CoRR abs/1305.0750 db/journals/corr/corr1305.html#abs-1305-0750

Alexander Koch 0001 Marcus Krug Ignaz Rutter Graphs with Plane Outside-Obstacle Representations. 2013 CoRR http://arxiv.org/abs/1306.2978 abs/1306.2978 db/journals/corr/corr1306.html#KochKR13

Tamara Mchedlidze Martin Nöllenburg Ignaz Rutter Drawing Planar Graphs with a Prescribed Inner Face. 2013 CoRR http://arxiv.org/abs/1308.3370 abs/1308.3370 db/journals/corr/corr1308.html#MchedlidzeNR13

Therese Biedl Thomas Bläsius Benjamin Niedermann Martin Nöllenburg Roman Prutkin Ignaz Rutter Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. 2013 CoRR http://arxiv.org/abs/1308.6778 abs/1308.6778 db/journals/corr/corr1308.html#BiedlBNNPR13

Michael A. Bekos Sabine Cornelsen Martin Fink 0001 Seok-Hee Hong 0001 Michael Kaufmann 0001 Martin Nöllenburg Ignaz Rutter Antonios Symvonis Many-to-One Boundary Labeling with Backbones. 2013 CoRR http://arxiv.org/abs/1308.6801 abs/1308.6801 db/journals/corr/corr1308.html#BekosCFHKNRS13

Mong-Jen Kao Jian-Jia Chen Ignaz Rutter Dorothea Wagner Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. 2013 CoRR http://arxiv.org/abs/1309.5697 abs/1309.5697 db/journals/corr/corr1309.html#KaoCRW13

Bastian Katz Ignaz Rutter Gerhard J. Woeginger An algorithmic study of switch graphs. 295-312 2012 49 Acta Informatica 5 https://doi.org/10.1007/s00236-012-0160-4 db/journals/acta/acta49.html#KatzRW12

Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. 150-172 2012 14 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2011.12.015 https://www.wikidata.org/entity/Q56689204 db/journals/jda/jda14.html#AngeliniBFPR12

Emilio Di Giacomo Luca Grilli 0001 Marcus Krug Giuseppe Liotta Ignaz Rutter Hamiltonian orthogeodesic alternating paths. 34-52 2012 16 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2012.04.012 https://www.wikidata.org/entity/Q62042457 db/journals/jda/jda16.html#GiacomoGKLR12

Ignaz Rutter Alexander Wolff 0001 Augmenting the Connectivity of Planar and Geometric Graphs. 599-628 2012 16 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00275 db/journals/jgaa/jgaa16.html#RutterW12

Reinhard Bauer Moritz Baum Ignaz Rutter Dorothea Wagner On the Complexity of Partitioning Graphs for Arc-Flags. 71-82 2012 ATMOS https://doi.org/10.4230/OASIcs.ATMOS.2012.71 conf/atmos/2012 db/conf/atmos/atmos2012.html#BauerBRW12 Thomas Bläsius Ignaz Rutter Disconnectivity and Relative Positions in Simultaneous Embeddings. 31-42 2012 GD https://doi.org/10.1007/978-3-642-36763-2_4 conf/gd/2012 db/conf/gd/gd2012.html#BlasiusR12 Martin Nöllenburg Roman Prutkin Ignaz Rutter Edge-Weighted Contact Representations of Planar Graphs. 224-235 2012 GD https://doi.org/10.1007/978-3-642-36763-2_20 conf/gd/2012 db/conf/gd/gd2012.html#NollenburgPR12 Gregor Betz Christoph Doll Andreas Gemsa Ignaz Rutter Dorothea Wagner Column-Based Graph Layouts. 236-247 2012 GD https://doi.org/10.1007/978-3-642-36763-2_21 conf/gd/2012 db/conf/gd/gd2012.html#BetzDGRW12 Mong-Jen Kao Jian-Jia Chen Ignaz Rutter Dorothea Wagner Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. 75-84 2012 ISAAC https://doi.org/10.1007/978-3-642-35261-4_11 conf/isaac/2012 db/conf/isaac/isaac2012.html#KaoCRW12 Tanja Hartmann Jonathan Rollin Ignaz Rutter Cubic Augmentation of Planar Graphs. 402-412 2012 ISAAC https://doi.org/10.1007/978-3-642-35261-4_43 conf/isaac/2012 db/conf/isaac/isaac2012.html#HartmannRR12

Maria Axenovich Marcus Krug Georg Osang Ignaz Rutter Fork-forests in bi-colored complete bipartite graphs http://arxiv.org/abs/1201.2551 2012 CoRR abs/1201.2551 db/journals/corr/corr1201.html#abs-1201-2551

Thomas Bläsius Ignaz Rutter Disconnectivity and Relative Positions in Simultaneous Embeddings http://arxiv.org/abs/1204.2903 2012 CoRR abs/1204.2903 db/journals/corr/corr1204.html#abs-1204-2903

Vít Jelínek Jan Kratochvíl Ignaz Rutter A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs http://arxiv.org/abs/1204.2915 2012 CoRR abs/1204.2915 db/journals/corr/corr1204.html#abs-1204-2915

Thomas Bläsius Ignaz Rutter Dorothea Wagner Optimal Orthogonal Graph Drawing with Convex Bend Costs http://arxiv.org/abs/1204.4997 2012 CoRR abs/1204.4997 db/journals/corr/corr1204.html#abs-1204-4997

Thomas Bläsius Stephen G. Kobourov Ignaz Rutter Simultaneous Embedding of Planar Graphs http://arxiv.org/abs/1204.5853 2012 CoRR abs/1204.5853 db/journals/corr/corr1204.html#abs-1204-5853

Pavel Klavík Jan Kratochvíl Yota Otachi Ignaz Rutter Toshiki Saitoh Maria Saumell Tomás Vyskocil Extending Partial Representations of Proper and Unit Interval Graphs http://arxiv.org/abs/1207.6960 2012 CoRR abs/1207.6960 db/journals/corr/corr1207.html#abs-1207-6960

Tanja Hartmann Jonathan Rollin Ignaz Rutter Cubic Augmentation of Planar Graphs http://arxiv.org/abs/1209.3865 2012 CoRR abs/1209.3865 db/journals/corr/corr1209.html#abs-1209-3865

Ignaz Rutter The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs. 2011 Karlsruhe Institute of Technology http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024304 https://nbn-resolving.org/urn:nbn:de:swb:90-243048 https://d-nb.info/1015557848

Robert Franke Ignaz Rutter Dorothea Wagner Computing large matchings in planar graphs with fixed minimum degree. 4092-4099 2011 412 Theor. Comput. Sci. 32 https://doi.org/10.1016/j.tcs.2010.06.012 db/journals/tcs/tcs412.html#FrankeRW11

Andreas Gemsa Martin Nöllenburg Ignaz Rutter Sliding labels for dynamic point labeling. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/paper62.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#GemsaNR11 Mong-Jen Kao Bastian Katz Marcus Krug D. T. Lee Martin Nöllenburg Ignaz Rutter Dorothea Wagner Connecting Two Trees with Optimal Routing Cost. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/paper35.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#KaoKKLNRW11 Mong-Jen Kao Bastian Katz Marcus Krug D. T. Lee Ignaz Rutter Dorothea Wagner The Density Maximization Problem in Graphs. 25-36 2011 COCOON https://doi.org/10.1007/978-3-642-22685-4_3 conf/cocoon/2011 db/conf/cocoon/cocoon2011.html#KaoKKLRW11 Vít Jelínek Jan Kratochvíl Ignaz Rutter A kuratowski-type theorem for planarity of partially embedded graphs. 107-116 2011 SCG https://doi.org/10.1145/1998196.1998214 conf/compgeom/2011 db/conf/compgeom/compgeom2011.html#JelinekKR11 Edith Brunel Andreas Gemsa Marcus Krug Ignaz Rutter Dorothea Wagner Generalizing Geometric Graphs. 179-190 2011 GD https://doi.org/10.1007/978-3-642-25878-7_18 conf/gd/2011 db/conf/gd/gd2011.html#BrunelGKRW11 Emilio Di Giacomo Luca Grilli 0001 Marcus Krug Giuseppe Liotta Ignaz Rutter Hamiltonian Orthogeodesic Alternating Paths. 170-181 2011 IWOCA https://doi.org/10.1007/978-3-642-25011-8_14 https://www.wikidata.org/entity/Q62042496 conf/iwoca/2011 db/conf/iwoca/iwoca2011.html#GiacomoGKLR11 Andreas Gemsa Martin Nöllenburg Thomas Pajor Ignaz Rutter On d-Regular Schematization of Embedded Paths. 260-271 2011 SOFSEM https://doi.org/10.1007/978-3-642-18381-2_22 conf/sofsem/2011 db/conf/sofsem/sofsem2011.html#GemsaNPR11 Andreas Gemsa Martin Nöllenburg Ignaz Rutter Consistent Labeling of Rotating Maps. 451-462 2011 WADS https://doi.org/10.1007/978-3-642-22300-6_38 conf/wads/2011 db/conf/wads/wads2011.html#GemsaNR11 Bastian Katz Ignaz Rutter Ben Strasser Dorothea Wagner Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. 292-303 2011 SEA https://doi.org/10.1007/978-3-642-20662-7_25 conf/wea/2011 db/conf/wea/sea2011.html#KatzRSW11 Ignaz Rutter The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs. 161-170 2011 Ausgezeichnete Informatikdissertationen conf/gi/2011diss db/conf/gi/diss2011.html#Rutter11 https://dl.gi.de/handle/20.500.12116/33698

Andreas Gemsa Martin Nöllenburg Ignaz Rutter Consistent Labeling of Rotating Maps http://arxiv.org/abs/1104.5634 2011 CoRR abs/1104.5634 db/journals/corr/corr1104.html#abs-1104-5634

Thomas Bläsius Ignaz Rutter Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems http://arxiv.org/abs/1112.0245 2011 CoRR abs/1112.0245 db/journals/corr/corr1112.html#abs-1112-0245

Ignaz Rutter Alexander Wolff 0001 Computing large matchings fast. 1:1-1:21 2010 7 ACM Trans. Algorithms 1 https://doi.org/10.1145/1868237.1868238 db/journals/talg/talg7.html#RutterW10

Thomas Bläsius Marcus Krug Ignaz Rutter Dorothea Wagner Orthogonal Graph Drawing with Flexibility Constraints. 92-104 2010 GD https://doi.org/10.1007/978-3-642-18469-7_9 conf/gd/2010 db/conf/gd/gd2010.html#BlasiusKRW10 Andreas Gemsa Martin Nöllenburg Thomas Pajor Ignaz Rutter Automatic Generation of Route Sketches. 391-392 2010 GD https://doi.org/10.1007/978-3-642-18469-7_37 conf/gd/2010 db/conf/gd/gd2010.html#GemsaNPR10 Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. 212-225 2010 IWOCA https://doi.org/10.1007/978-3-642-19222-7_22 conf/iwoca/2010 db/conf/iwoca/iwoca2010.html#AngeliniBFPR10 Patrizio Angelini Giuseppe Di Battista Fabrizio Frati Vít Jelínek Jan Kratochvíl Maurizio Patrignani Ignaz Rutter Testing Planarity of Partially Embedded Graphs. 202-221 2010 SODA https://doi.org/10.1137/1.9781611973075.19 conf/soda/2010 db/conf/soda/soda2010.html#AngeliniBFJKPR10 Bastian Katz Marcus Krug Andreas Lochbihler Ignaz Rutter Gregor Snelting Dorothea Wagner Gateway Decompositions for Constrained Reachability Problems. 449-461 2010 SEA https://doi.org/10.1007/978-3-642-13193-6_38 conf/wea/2010 db/conf/wea/sea2010.html#KatzKLRSW10 Bastian Katz Marcus Krug Ignaz Rutter Alexander Wolff 0001 Manhattan-Geodesic Embedding of Planar Graphs. 207-218 2009 GD https://doi.org/10.1007/978-3-642-11805-0_21 conf/gd/2009 db/conf/gd/gd2009.html#KatzKRW09 Robert Franke Ignaz Rutter Dorothea Wagner Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. 872-881 2009 ISAAC https://doi.org/10.1007/978-3-642-10631-6_88 conf/isaac/2009 db/conf/isaac/isaac2009.html#FrankeRW09 Bastian Katz Ignaz Rutter Gerhard J. Woeginger An Algorithmic Study of Switch Graphs. 226-237 2009 WG https://doi.org/10.1007/978-3-642-11409-0_20 conf/wg/2009 db/conf/wg/wg2009.html#KatzRW09

Ignaz Rutter Alexander Wolff 0001 Augmenting the Connectivity of Planar and Geometric Graphs. 53-56 2008 31 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2008.06.009 db/journals/endm/endm31.html#RutterW08

Ignaz Rutter Alexander Wolff 0001 Computing large matchings fast. 183-192 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347103 conf/soda/2008 db/conf/soda/soda2008.html#RutterW08 Muhammad Jawaherul AlamMd. Jawaherul Alam Mark Alfano Patrizio Angelini Vadim Arzamasov Maria Axenovich Patricia Bachmann Sang Won Bae 0001 Jean-François Baffier Lukas Barth Giuseppe Di Battista Reinhard Bauer Moritz Baum Jakob Baumann Michael A. Bekos Gregor Betz Sujoy Bhore Therese Biedl Carla Binucci Thomas Bläsius Klemens Böhm Franz-Josef BrandenburgFranz J. Brandenburg Guido Brückner Edith Brunel Sebastian Buchwald Steven Chaplick Jian-Jia Chen Markus Chimani Jinhee Chun Tobias Columbus Sabine Cornelsen Scott W. Cunningham Daniel Delling Thomas Depian William E. Devanny Walter Didimo Christoph Doll Valentino Di Donato Peter Eades Kord Eickmeyer Stefan Felsner Jirí Fiala 0001 Martin Fink 0001 Simon D. FinkSimon Dominik Fink Alexander Firbas Robert Franke Fabrizio Frati Robert Ganian Andreas Gemsa Emilio Di Giacomo Miriam Goetze Alban Grastien Luca Grilli 0001 Martin Gronemann Martin Gruber Siddharth Gupta 0002 Grzegorz Gutowski Carsten Gutwenger Tanja Hartmann Annette Hautli-Janisz Markus Himmel Michael Hoffmann 0001 Seok-Hee Hong 0001 Nico HübnerNico Meyer-Hübner Takayuki Itoh Vít Jelínek Mong-Jen Kao Annette Karrer Julia Katheder Bastian Katz Michael Kaufmann 0001 Zlata Kikteva Philipp Kindermann Pavel Klavík Jonathan Klawitter Karsten Klein 0001 Boris Klemz Fabian Klute Stephen G. Kobourov Alexander Koch 0001 Matias Korman Jan Kratochvíl Marcus Krug D. T. Lee Sebastian Lehmann Thomas Leibfried Guangping Li 0001 Giuseppe Liotta Fabian Lipp Andreas Lochbihler Maarten Löffler Giordano Da Lozzo Kwan-Liu Ma Christof Mathies Tamara Mchedlidze Wouter Meulemans Florian Mittelstädt Matthias Mnich Manuel Mohr Fabrizio Montecchiani Miriam Münch Lev Nachmanson Benjamin Niedermann Martin Nöllenburg Tim Ophelders Georg Osang Yota Otachi Thomas Pajor Irene Parada Maurizio Patrignani Christophe Paul Maximilian Pfister 0002 Matthias Pfretzschner Marcin Pilipczuk Roman Prutkin Sergey Pupyrev Helen C. Purchase Marcel Radermacher Klara Reichard Jonathan Rollin Günter Rote Toshiki Saitoh Peter Sanders 0001 T. P. Sandhya 0001Sandhya T. P. 0001 Maria Saumell Marcus Schaefer 0001 Jens M. Schmidt Patrick Schnider Alfred Schuhmacher André Schulz 0001 Raimund Seidel Marie Diana Sieper Gregor Snelting Max Sondag Manuel Sorge Bettina Speckmann Joachim Spoerhase Darren Strash Ben Strasser Peter Stumpf Dirk Sudholt Emily Sullivan Antonios Symvonis Alessandra Tappini Ioannis G. Tollis Csaba D. Tóth Torsten Ueckerdt Kevin Verbeek Michael Vollmer 0001 Tomás Vyskocil Dorothea Wagner Franziska Wegner Gerhard J. Woeginger Matthias Wolf 0004 Alexander Wolff 0001 Hsiang-Yun Wu Jules Wulms Peter Zeman 0001 Nina Zimbel Johannes Zink 0001