Ignaz Rutter

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 146

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

Algorithmica

Karlsruhe Institute of Technology (PHD)

Education History

Karlsruhe Institute of Technology

PHD

Publications

Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings. CoRR (2024)
Simon D. Fink, Ignaz Rutter
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX (2024)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper
Clustered Planarity Variants for Level Graphs. CoRR (2024)
Jakob Baumann, Ignaz Rutter, Dirk Sudholt
Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. GECCO (2024)
Miriam Münch, Ignaz Rutter, Peter Stumpf
Partial and Simultaneous Transitive Orientations via Modular Decompositions. Algorithmica 86 (4) (2024)
Guido Brückner, Ignaz Rutter, Peter Stumpf
Extending Partial Representations of Circle Graphs in Near-Linear Time. Algorithmica 86 (7) (2024)
Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. CoRR (2023)
Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. WG (2023)
Simon D. Fink, Ignaz Rutter
Maintaining Triconnected Components under Node Expansion. CoRR (2023)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Parameterized Complexity of Simultaneous Planarity. CoRR (2023)
Simon D. Fink, Ignaz Rutter
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. CoRR (2023)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135 (2023)
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. AAAI (2023)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111 (2023)
Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. Discret. Comput. Geom. 70 (4) (2023)
Patricia Bachmann, Ignaz Rutter, Peter Stumpf
On 3-Coloring Circle Graphs. CoRR (2023)
Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34 (7) (2023)
Simon D. Fink, Ignaz Rutter
Maintaining Triconnected Components Under Node Expansion. CIAC (2023)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Parameterized Complexity of Simultaneous Planarity. GD (2) (2023)
Ignaz Rutter, Helen C. Purchase
Guest Editors' Foreword. J. Graph Algorithms Appl. 27 (2) (2023)
Patricia Bachmann, Ignaz Rutter, Peter Stumpf
On 3-Coloring Circle Graphs. GD (1) (2023)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28 (2023)
Ignaz Rutter, Peter Stumpf
Simultaneous Representation of Interval Graphs in the Sunflower Case. ESA (2023)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19 (4) (2023)
Marcel Radermacher, Ignaz Rutter
Inserting an edge into a geometric embedding. Comput. Geom. 102 (2022)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG (2022)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26 (3) (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. GD (2022)
Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
Extending Partial Representations of Circular-Arc Graphs. WG (2022)
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Coloring Mixed and Directional Interval Graphs. GD (2022)
Guido Brückner, Ignaz Rutter, Peter Stumpf
Level-Planarity: Transitivity vs. Even Crossings. Electron. J. Comb. 29 (4) (2022)
Miriam Münch, Ignaz Rutter, Peter Stumpf
Partial and Simultaneous Transitive Orientations via Modular Decomposition. CoRR (2022)
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Coloring Mixed and Directional Interval Graphs. CoRR (2022)
Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
The Rique-Number of Graphs. GD (2022)
Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
The Rique-Number of Graphs. CoRR (2022)
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. CoRR (2022)
Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919 (2022)
Miriam Münch, Ignaz Rutter, Peter Stumpf
Partial and Simultaneous Transitive Orientations via Modular Decompositions. ISAAC (2022)
Guido Brückner, Ignaz Rutter, Peter Stumpf
Extending Partial Representations of Circle Graphs in Near-Linear Time. MFCS (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR (2021)
Helen C. Purchase, Ignaz Rutter
Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021). CoRR (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC (2021)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Experimental Comparison of PC-Trees and PQ-Trees. CoRR (2021)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874 (2021)
Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. CoRR (2021)
Guido Brückner, Ignaz Rutter
Radial Level Planarity with Fixed Embedding. J. Graph Algorithms Appl. 25 (1) (2021)
Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
Extending Partial Representations of Circular-Arc Graphs. CoRR (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. ISAAC (2021)
Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
Polygon-Universal Graphs. CoRR (2021)
Patrizio Angelini, Ignaz Rutter, T. P. Sandhya
Extending Partial Orthogonal Drawings. J. Graph Algorithms Appl. 25 (1) (2021)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Experimental Comparison of PC-Trees and PQ-Trees. ESA (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. CoRR (2021)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA (2021)
Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
Polygon-Universal Graphs. SoCG (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. CoRR (2021)
Benjamin Niedermann, Ignaz Rutter
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. Graph Drawing (2020)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. Graph Drawing (2020)
Marcel Radermacher, Ignaz Rutter, Peter Stumpf
Towards a characterization of stretchable aligned graphs. CoRR (2020)
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
 + 1)-quasiplanar. J. Comb. Theory, Ser. B 142 (2020)
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. 804 (2020)
Steven Chaplick, Takayuki Itoh, Giuseppe Liotta, Kwan-Liu Ma, Ignaz Rutter
Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). NII Shonan Meet. Rep. 2020 (2020)
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. 24 (2) (2020)
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
On Turn-Regular Orthogonal Representations. CoRR (2020)
Guido Brückner, Ignaz Rutter
An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC (2020)
Patrizio Angelini, Ignaz Rutter, Sandhya T. P.
Extending Partial Orthogonal Drawings. Graph Drawing (2020)
Marcel Radermacher, Ignaz Rutter, Peter Stumpf
Towards a Characterization of Stretchable Aligned Graphs. Graph Drawing (2020)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR (2020)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM (2020)
Patrizio Angelini, Ignaz Rutter, Sandhya T. P.
Extending Partial Orthogonal Drawings. CoRR (2020)
Guido Brückner, Ignaz Rutter
An SPQR-Tree-Like Embedding Representation for Level Planarity. CoRR (2020)
Benjamin Niedermann, Ignaz Rutter
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. CoRR (2020)
Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2020)
Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
Geometric Heuristics for Rectilinear Crossing Minimization. ACM J. Exp. Algorithmics 24 (1) (2019)
Guido Brückner, Markus Himmel, Ignaz Rutter
An SPQR-Tree-Like Embedding Representation for Upward Planarity. Graph Drawing (2019)
Vadim Arzamasov, Klemens Böhm, Ignaz Rutter
Minimizing Bias in Estimation of Mutual Information from Data Streams. SSDBM (2019)
Giordano Da Lozzo, Ignaz Rutter
Reaching 3-Connectivity via Edge-Edge Additions. IWOCA (2019)
Marcel Radermacher, Ignaz Rutter
Geometric Crossing-Minimization - A Scalable Randomized Approach. CoRR (2019)
Giordano Da Lozzo, Ignaz Rutter
Planarity of streamed graphs. Theor. Comput. Sci. 799 (2019)
Marcel Radermacher, Ignaz Rutter
Geometric Crossing-Minimization - A Scalable Randomized Approach. ESA (2019)
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81 (9) (2019)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR (2019)
Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2019)
Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
Simultaneous Representation of Proper and Unit Interval Graphs. CoRR (2019)
Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
Simultaneous Representation of Proper and Unit Interval Graphs. ESA (2019)
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
Drawing Clustered Graphs on Disk Arrangements. WALCOM (2019)
Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
Efficient Algorithms for Ortho-Radial Graph Drawing. CoRR (2019)
Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
How to Draw a Planarization. J. Graph Algorithms Appl. 23 (4) (2019)
Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
Efficient Algorithms for Ortho-Radial Graph Drawing. SoCG (2019)
Guido Brückner, Markus Himmel, Ignaz Rutter
An SPQR-Tree-Like Embedding Representation for Upward Planarity. CoRR (2019)
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR (2019)
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. CoRR (2019)
William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2018)
Thomas Bläsius, Annette Karrer, Ignaz Rutter
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 80 (4) (2018)
Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf
The Maximum Transmission Switching Flow Problem. e-Energy (2018)
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
Aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 22 (3) (2018)
Guido Brückner, Ignaz Rutter, Peter Stumpf
Level Planarity: Transitivity vs. Even Crossings. Graph Drawing (2018)
Giordano Da Lozzo, Ignaz Rutter
Approximation Algorithms for Facial Cycles in Planar Embeddings. ISAAC (2018)
Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28 (2018)
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
Drawing Clustered Graphs on Disk Arrangements. CoRR (2018)
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. ACM Trans. Algorithms 14 (4) (2018)

Ignaz Rutter.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ignaz Rutter