Rutter, Ignaz

Recent Publications

Untangling Circular Drawings: Algorithms and Complexity
Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), volume 212 of LIPIcs, pages 19:1-19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121-158, 2017.
Radial Contour Labeling with Straight Leaders
IEEE Pacific Visualization Symposium (PacificVis'17), pages 295-304, 2017.
Consistent Labeling of Rotating Maps
J. Computational Geometry, volume 7, number 1, pages 308-331, 2016.
Evaluation of Labeling Strategies for Rotating Maps
ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1-1.4:21, 2016.
Software Visualization via Hierarchic Micro/Macro Layouts
Information Visualization Theory and Applications (IVAPP'16) (Linsen, Lars and Telea, Alexandru C.), pages 153-160, 2016, SciTePress.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Algorithms and Computation (ISAAC'15) (Elbassioni, Khaled and Makino, Kazuhisa), volume 9472 of LNCS, pages 637-649, 2015, Springer Berlin Heidelberg.
Towards Realistic Flow Control in Power Grid Operation
Energy Informatics (EI'15) (Gottwalt, Sebastian and König, Lukas and Schmeck, Hartmut), volume 9424 of LNCS, pages 192-199, 2015, Springer International Publishing.
Evaluation of Labeling Strategies for Rotating Maps
Experimental Algorithms (SEA'14) (Gudmundsson, Joachim and Katajainen, J.), volume 8504 of LNCS, pages 235-246, 2014, Springer International Publishing.
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 476-487, 2014, Springer Berlin Heidelberg.
Drawing Planar Graphs with a Prescribed Inner Face
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 316-327, 2013, Springer Berlin Heidelberg.
Edge-weighted contact representations of planar graphs
J. Graph Algorithms Appl., volume 17, number 4, pages 441-473, 2013.
Edge-weighted contact representations of planar graphs
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 224-235, 2013, Springer Berlin Heidelberg.
Many-to-One Boundary Labeling with Backbones
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 244-255, 2013, Springer Berlin Heidelberg.
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 460-471, 2013, Springer Berlin Heidelberg.
Automatic Generation of Route Sketches
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 391-392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
Connecting Two Trees with Optimal Routing Cost
Canadian Conference on Computational Geometry (CCCG ‘11), pages 43-47, 2011, University of Toronto.
Consistent Labeling of Rotating Maps
Algorithms and Data Structures (WADS'11) (Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger), volume 6844 of LNCS, pages 451-462, 2011, Springer Berlin Heidelberg.
On d-regular Schematization of Embedded Paths
Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260-271, 2011, Springer Berlin Heidelberg.
Sliding Labels for Dynamic Point Labeling
Canadian Conference on Computational Geometry (CCCG ‘11), pages 205-210, 2011, University of Toronto.