Ignaz Rutter - RankMe

294 papers A* 9A 62B 32C 8Misc 1Journal 161Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Circle Graphs Can Be Recognized in Linear Time. STACS Christophe Paul, Ignaz Rutter
2026	J	`jnl`	Upward Book Embeddings of Partitioned Digraphs. CoRR Giordano Da Lozzo, Fabrizio Frati, Ignaz Rutter
2026	J	`jnl`	Weakly leveled planarity with bounded span. Theor. Comput. Sci. Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2025	—	`conf`	A Simple Partially Embedded Planarity Test Based on Vertex-Addition. SOSA Simon D. Fink, Ignaz Rutter, Sandhya T. P.
2025	A	`conf`	Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation. GECCO Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2025	J	`jnl`	Circle graphs can be recognized in linear time. CoRR Christophe Paul, Ignaz Rutter
2025	J	`jnl`	Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. J. Graph Algorithms Appl. Simon Dominik Fink, Ignaz Rutter
2025	J	`jnl`	Crossing Number of 3-Plane Drawings. CoRR Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025	A	`conf`	Crossing Number of Simple 3-Plane Drawings. GD Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025	—	`conf`	DebArgVis: An Interactive Visualisation Tool for Exploring Argumentative Dynamics in Debate. ArgMining Martin Gruber, Zlata Kikteva, Ignaz Rutter, Annette Hautli-Janisz
2025	A	`conf`	Heuristics for Exact 1-Planarity Testing. GD Simon D. Fink, Miriam Münch, Matthias Pfretzschner, Ignaz Rutter
2025	J	`jnl`	Partial and constrained level planarity. Theor. Comput. Sci. Guido Brückner, Ignaz Rutter
2025	J	`jnl`	Polygon-universal graphs. J. Comput. Geom. Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
2025	A	`conf`	Reeb Lobsters Are 1-Planar (Poster Abstract). GD Maarten Löffler, Miriam Münch, Ignaz Rutter
2025	J	`jnl`	Simultaneous Representation of Proper and Unit Interval Graphs. Algorithmica Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
2025	B	`conf`	Structural Parameterizations of Simultaneous Planarity. ISAAC Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter
2025	J	`jnl`	The Price of Upwardness. Discret. Math. Theor. Comput. Sci. Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter
2025	J	`jnl`	The influence of dimensions on the complexity of computing decision trees. Artif. Intell. Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2024	J	`jnl`	A Simple Partially Embedded Planarity Test Based on Vertex-Addition. CoRR Simon D. Fink, Ignaz Rutter, T. P. Sandhya
2024	J	`jnl`	Clustered Planarity Variants for Level Graphs. CoRR Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper
2024	A	`conf`	Constrained Outer-String Representations. GD Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter
2024	A	`conf`	Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX Simon D. Fink, Ignaz Rutter
2024	A	`conf`	Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract). GD Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	J	`jnl`	Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation. CoRR Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	A	`conf`	Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. GECCO Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	B	`conf`	Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth. WG Miriam Münch, Maximilian Pfister, Ignaz Rutter
2024	J	`jnl`	Extending Partial Representations of Circle Graphs in Near-Linear Time. Algorithmica Guido Brückner, Ignaz Rutter, Peter Stumpf
2024	A	`conf`	Level Planarity Is More Difficult Than We Thought (Poster Abstract). GD Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf
2024	J	`jnl`	Level Planarity Is More Difficult Than We Thought. CoRR Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf
2024	J	`jnl`	Maintaining Triconnected Components under Node Expansion. Comput. Geom. Topol. Simon Dominik Fink, Ignaz Rutter
2024	J	`jnl`	On 3-Coloring Circle Graphs. J. Graph Algorithms Appl. Patricia Bachmann, Ignaz Rutter, Peter Stumpf
2024	A	`conf`	On k-Plane Insertion into Plane Drawings. GD Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
2024	J	`jnl`	On k-Plane Insertion into Plane Drawings. CoRR Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
2024	A	`conf`	Parameterized Algorithms for Beyond-Planar Crossing Numbers. GD Miriam Münch, Ignaz Rutter
2024	J	`jnl`	Parameterized complexity of vertex splitting to pathwidth at most 1. Theor. Comput. Sci. Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
2024	J	`jnl`	Partial and Simultaneous Transitive Orientations via Modular Decompositions. Algorithmica Miriam Münch, Ignaz Rutter, Peter Stumpf
2024	B	`conf`	Simple Realizability of Abstract Topological Graphs. ISAAC Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter
2024	J	`jnl`	Simple Realizability of Abstract Topological Graphs. CoRR Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter
2024	A	`conf`	The Price of Upwardness. GD Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff
2024	J	`jnl`	The Price of Upwardness. CoRR Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff
2024	A	`conf`	Weakly Leveled Planarity with Bounded Span. GD Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2024	J	`jnl`	Weakly Leveled Planarity with Bounded Span. CoRR Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2023	J	`jnl`	A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. Discret. Comput. Geom. Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2023	J	`jnl`	An SPQR-tree-like embedding representation for level planarity. J. Comput. Geom. Guido Brückner, Ignaz Rutter
2023	J	`jnl`	Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. CoRR Simon D. Fink, Ignaz Rutter
2023	J	`jnl`	Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
2023	J	`jnl`	Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2023	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Ignaz Rutter, Helen C. Purchase
2023	C	`conf`	Maintaining Triconnected Components Under Node Expansion. CIAC Simon D. Fink, Ignaz Rutter
2023	J	`jnl`	Maintaining Triconnected Components under Node Expansion. CoRR Simon D. Fink, Ignaz Rutter
2023	—	`conf`	On 3-Coloring Circle Graphs. GD (1) Patricia Bachmann, Ignaz Rutter, Peter Stumpf
2023	J	`jnl`	On 3-Coloring Circle Graphs. CoRR Patricia Bachmann, Ignaz Rutter, Peter Stumpf
2023	—	`conf`	Parameterized Complexity of Simultaneous Planarity. GD (2) Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2023	J	`jnl`	Parameterized Complexity of Simultaneous Planarity. CoRR Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2023	B	`conf`	Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. WG Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
2023	J	`jnl`	Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. CoRR Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
2023	J	`jnl`	Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2023	A	`conf`	Simultaneous Representation of Interval Graphs in the Sunflower Case. ESA Ignaz Rutter, Peter Stumpf
2023	J	`jnl`	Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2023	A*	`conf`	The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2023	J	`jnl`	Untangling circular drawings: Algorithms and complexity. Comput. Geom. Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
2022	A	`conf`	Coloring Mixed and Directional Interval Graphs. GD Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
2022	J	`jnl`	Coloring Mixed and Directional Interval Graphs. CoRR Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
2022	B	`conf`	Extending Partial Representations of Circle Graphs in Near-Linear Time. MFCS Guido Brückner, Ignaz Rutter, Peter Stumpf
2022	B	`conf`	Extending Partial Representations of Circular-Arc Graphs. WG Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
2022	J	`jnl`	Inserting an edge into a geometric embedding. Comput. Geom. Marcel Radermacher, Ignaz Rutter
2022	J	`jnl`	Level-Planarity: Transitivity vs. Even Crossings. Electron. J. Comb. Guido Brückner, Ignaz Rutter, Peter Stumpf
2022	A	`conf`	Morphing Rectangular Duals. GD Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2022	J	`jnl`	On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2022	B	`conf`	Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2022	J	`jnl`	Partial and Simultaneous Transitive Orientations via Modular Decomposition. CoRR Miriam Münch, Ignaz Rutter, Peter Stumpf
2022	B	`conf`	Partial and Simultaneous Transitive Orientations via Modular Decompositions. ISAAC Miriam Münch, Ignaz Rutter, Peter Stumpf
2022	J	`jnl`	Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2022	J	`jnl`	The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2022	A	`conf`	The Rique-Number of Graphs. GD Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
2022	J	`jnl`	The Rique-Number of Graphs. CoRR Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
2021	J	`jnl`	A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. CoRR Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2021	A	`conf`	Experimental Comparison of PC-Trees and PQ-Trees. ESA Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2021	J	`jnl`	Experimental Comparison of PC-Trees and PQ-Trees. CoRR Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2021	J	`jnl`	Extending Partial Orthogonal Drawings. J. Graph Algorithms Appl. Patrizio Angelini, Ignaz Rutter, T. P. Sandhya
2021	J	`jnl`	Extending Partial Representations of Circular-Arc Graphs. CoRR Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
2021	C	`conf`	Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2021	J	`jnl`	Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2021	A	`ed.`	Graph Drawing and Network Visualization - 29th International Symposium, GD 2021, Tübingen, Germany, September 14-17, 2021, Revised Selected Papers GD Helen C. Purchase, Ignaz Rutter
2021	J	`jnl`	Morphing Rectangular Duals. CoRR Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2021	A*	`conf`	Polygon-Universal Graphs. SoCG Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
2021	J	`jnl`	Polygon-Universal Graphs. CoRR Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek
2021	J	`jnl`	Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021). CoRR Helen C. Purchase, Ignaz Rutter
2021	J	`jnl`	Radial Level Planarity with Fixed Embedding. J. Graph Algorithms Appl. Guido Brückner, Ignaz Rutter
2021	J	`jnl`	Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2021	A	`conf`	Synchronized Planarity with Applications to Constrained Planarity Problems. ESA Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2021	B	`conf`	Untangling Circular Drawings: Algorithms and Complexity. ISAAC Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
2021	J	`jnl`	Untangling Circular Drawings: Algorithms and Complexity. CoRR Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
2020	A	`conf`	An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. GD Benjamin Niedermann, Ignaz Rutter
2020	J	`jnl`	An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. CoRR Benjamin Niedermann, Ignaz Rutter
2020	B	`conf`	An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC Guido Brückner, Ignaz Rutter
2020	J	`jnl`	An SPQR-Tree-Like Embedding Representation for Level Planarity. CoRR Guido Brückner, Ignaz Rutter
2020	J	`jnl`	Beyond level planarity: Cyclic, torus, and simultaneous level planarity. Theor. Comput. Sci. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2020	J	`jnl`	Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
2020	A	`conf`	Extending Partial Orthogonal Drawings. GD Patrizio Angelini, Ignaz Rutter, Sandhya T. P.
2020	J	`jnl`	Extending Partial Orthogonal Drawings. CoRR Patrizio Angelini, Ignaz Rutter, Sandhya T. P.
2020	A	`conf`	Graph Drawing Contest Report. GD Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter
2020	A	`conf`	On Turn-Regular Orthogonal Representations. GD Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2020	J	`jnl`	On Turn-Regular Orthogonal Representations. CoRR Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2020	J	`jnl`	Simple J. Comb. Theory B 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
2020	—	`ch.`	Simultaneous Embedding. Beyond Planar Graphs Ignaz Rutter
2020	B	`conf`	Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2020	J	`jnl`	Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR Thomas Bläsius, Simon D. Fink, Ignaz Rutter
2020	A	`conf`	Towards a Characterization of Stretchable Aligned Graphs. GD Marcel Radermacher, Ignaz Rutter, Peter Stumpf
2020	J	`jnl`	Towards a characterization of stretchable aligned graphs. CoRR Marcel Radermacher, Ignaz Rutter, Peter Stumpf
2020	J	`jnl`	Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). NII Shonan Meet. Rep. Steven Chaplick, Takayuki Itoh, Giuseppe Liotta, Kwan-Liu Ma, Ignaz Rutter
2019	A	`conf`	An SPQR-Tree-Like Embedding Representation for Upward Planarity. GD Guido Brückner, Markus Himmel, Ignaz Rutter
2019	J	`jnl`	An SPQR-Tree-Like Embedding Representation for Upward Planarity. CoRR Guido Brückner, Markus Himmel, Ignaz Rutter
2019	B	`conf`	Drawing Clustered Graphs on Disk Arrangements. WALCOM Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
2019	A*	`conf`	Efficient Algorithms for Ortho-Radial Graph Drawing. SoCG Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2019	J	`jnl`	Efficient Algorithms for Ortho-Radial Graph Drawing. CoRR Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2019	A	`conf`	Geometric Crossing-Minimization - A Scalable Randomized Approach. ESA Marcel Radermacher, Ignaz Rutter
2019	J	`jnl`	Geometric Crossing-Minimization - A Scalable Randomized Approach. CoRR Marcel Radermacher, Ignaz Rutter
2019	J	`jnl`	Geometric Heuristics for Rectilinear Crossing Minimization. ACM J. Exp. Algorithmics Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2019	A	`conf`	Graph Drawing Contest Report. GD Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter
2019	J	`jnl`	Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2019	J	`jnl`	How to Draw a Planarization. J. Graph Algorithms Appl. Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
2019	B	`conf`	Minimizing Bias in Estimation of Mutual Information from Data Streams. SSDBM Vadim Arzamasov, Klemens Böhm, Ignaz Rutter
2019	J	`jnl`	NodeTrix Planarity Testing with Small Clusters. Algorithmica Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini
2019	J	`jnl`	Planarity of streamed graphs. Theor. Comput. Sci. Giordano Da Lozzo, Ignaz Rutter
2019	C	`conf`	Reaching 3-Connectivity via Edge-Edge Additions. IWOCA Giordano Da Lozzo, Ignaz Rutter
2019	J	`jnl`	Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR 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
2019	J	`jnl`	Simultaneous FPQ-Ordering and Hybrid Planarity Testing. CoRR Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2019	A	`conf`	Simultaneous Representation of Proper and Unit Interval Graphs. ESA Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
2019	J	`jnl`	Simultaneous Representation of Proper and Unit Interval Graphs. CoRR Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
2018	A	`conf`	A Geometric Heuristic for Rectilinear Crossing Minimization. ALENEX Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2018	J	`jnl`	Aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
2018	B	`conf`	Approximation Algorithms for Facial Cycles in Planar Embeddings. ISAAC Giordano Da Lozzo, Ignaz Rutter
2018	J	`jnl`	Drawing Clustered Graphs on Disk Arrangements. CoRR Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
2018	J	`jnl`	Gap-planar graphs. Theor. Comput. Sci. Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2018	A	`conf`	Graph Drawing Contest Report. GD William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
2018	A	`conf`	Inserting an Edge into a Geometric Embedding. GD Marcel Radermacher, Ignaz Rutter
2018	J	`jnl`	Inserting an Edge into a Geometric Embedding. CoRR Marcel Radermacher, Ignaz Rutter
2018	A	`conf`	Level Planarity: Transitivity vs. Even Crossings. GD Guido Brückner, Ignaz Rutter, Peter Stumpf
2018	J	`jnl`	Level Planarity: Transitivity vs. Even Crossings. CoRR Guido Brückner, Ignaz Rutter, Peter Stumpf
2018	J	`jnl`	Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2018	B	`conf`	On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data. EDBT Michael Vollmer, Ignaz Rutter, Klemens Böhm
2018	J	`jnl`	Scalable exact visualization of isocontours in road networks via minimum-link paths. J. Comput. Geom. Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2018	J	`jnl`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica Thomas Bläsius, Annette Karrer, Ignaz Rutter
2018	—	`conf`	Social Network-Epistemology. eScience Mark Alfano, Scott W. Cunningham, Wouter Meulemans, Ignaz Rutter, Max Sondag, Bettina Speckmann, Emily Sullivan
2018	—	`conf`	The Maximum Transmission Switching Flow Problem. e-Energy Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2018	J	`jnl`	The Partition Spanning Forest Problem. CoRR Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz
2018	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2017	—	`conf`	A Simulated-Annealing-Based Approach for Wind Farm Cabling. e-Energy Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner, Franziska Wegner
2017	A	`conf`	Aligned Drawings of Planar Graphs. GD Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
2017	J	`jnl`	Aligned Drawings of Planar Graphs. CoRR Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
2017	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2017	A	`conf`	Gap-Planar Graphs. GD Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017	J	`jnl`	Gap-planar Graphs. CoRR Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017	A	`conf`	Graph Drawing Contest Report. GD William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
2017	B	`conf`	How to Draw a Planarization. SOFSEM Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
2017	J	`jnl`	Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2017	B	`conf`	On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter
2017	A*	`conf`	Partial and Constrained Level Planarity. SODA Guido Brückner, Ignaz Rutter
2017	J	`jnl`	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. Int. J. Comput. Geom. Appl. Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2017	J	`jnl`	Radial Contour Labeling with Straight Leaders. CoRR Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter
2017	B	`conf`	Radial contour labeling with straight leaders. PacificVis Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter
2017	A*	`conf`	Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. SoCG Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2017	J	`jnl`	Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. CoRR Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
2016	J	`jnl`	A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. Thomas Bläsius, Ignaz Rutter
2016	A	`conf`	Beyond Level Planarity. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2016	J	`jnl`	Consistent labeling of rotating maps. J. Comput. Geom. Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2016	J	`jnl`	Evaluation of Labeling Strategies for Rotating Maps. ACM J. Exp. Algorithmics Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2016	J	`jnl`	Extending Convex Partial Drawings of Graphs. Algorithmica Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
2016	A	`conf`	Graph Drawing Contest Report. GD Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter
2016	—	`conf`	Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2016	J	`jnl`	Multi-sided Boundary Labeling. Algorithmica Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
2016	J	`jnl`	On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2016	J	`jnl`	On the Complexity of Realizing Facial Cycles. CoRR Giordano Da Lozzo, Ignaz Rutter
2016	J	`jnl`	Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2016	J	`jnl`	Orthogonal graph drawing with inflexible edges. Comput. Geom. Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2016	A	`conf`	Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. ESA Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016	J	`jnl`	Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. CoRR Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016	J	`jnl`	Search-space size in contraction hierarchies. Theor. Comput. Sci. Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
2016	A	`conf`	Simultaneous Orthogonal Planarity. GD Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	J	`jnl`	Simultaneous Orthogonal Planarity. CoRR Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	J	`jnl`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. ACM Trans. Algorithms Thomas Bläsius, Ignaz Rutter
2016	—	`conf`	Software Visualization via Hierarchic Micro/Macro Layouts. VISIGRAPP (2: IVAPP) Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher
2016	J	`jnl`	Strengthening Hardness Results to 3-Connected Planar Graphs. CoRR Giordano Da Lozzo, Ignaz Rutter
2016	A*	`conf`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2015	J	`jnl`	A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. CoRR Thomas Bläsius, Ignaz Rutter
2015	J	`jnl`	Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. Thomas Bläsius, Ignaz Rutter
2015	A	`conf`	Graph Drawing Contest Report. GD Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter
2015	A	`conf`	Intersection-Link Representations of Graphs. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Intersection-Link Representations of Graphs. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2015	A	`conf`	On the Relationship Between Map Graphs and Clique Planar Graphs. GD Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2015	—	`conf`	Operating Power Grids with Few Flow Control Buses. e-Energy Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015	J	`jnl`	Operating Power Grids with Few Flow Control Buses. CoRR Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015	B	`conf`	Optimal Shuffle Code with Permutation Instructions. WADS Sebastian Buchwald, Manuel Mohr, Ignaz Rutter
2015	J	`jnl`	Optimal Shuffle Code with Permutation Instructions. CoRR Sebastian Buchwald, Manuel Mohr, Ignaz Rutter
2015	C	`conf`	Orthogonal Graph Drawing with Inflexible Edges. CIAC Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2015	B	`conf`	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. ISAAC Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2015	J	`jnl`	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. CoRR Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2015	A	`conf`	Pixel and Voxel Representations of Graphs. GD Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	J	`jnl`	Pixel and Voxel Representations of Graphs. CoRR Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	C	`conf`	Planarity of Streamed Graphs. CIAC Giordano Da Lozzo, Ignaz Rutter
2015	J	`jnl`	Planarity of Streamed Graphs. CoRR Giordano Da Lozzo, Ignaz Rutter
2015	J	`jnl`	Regular Augmentation of Planar Graphs. Algorithmica Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2015	J	`jnl`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. CoRR Thomas Bläsius, Annette Karrer, Ignaz Rutter
2015	J	`jnl`	Testing Cyclic Level and Simultaneous Level Planarity. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015	J	`jnl`	Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2015	—	`conf`	Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner
2015	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2014	A	`conf`	A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. GD Thomas Bläsius, Ignaz Rutter
2014	J	`jnl`	Column-Based Graph Layouts. J. Graph Algorithms Appl. Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner
2014	A	`conf`	Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA Thomas Bläsius, Guido Brückner, Ignaz Rutter
2014	J	`jnl`	Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR Thomas Bläsius, Guido Brückner, Ignaz Rutter
2014	A	`conf`	Drawing Simultaneously Embedded Graphs with Few Bends. GD Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
2014	B	`conf`	Evaluation of Labeling Strategies for Rotating Maps. SEA Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2014	J	`jnl`	Evaluation of Labeling Strategies for Rotating Maps. CoRR Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2014	—	`conf`	Extending Partial Representations of Proper and Unit Interval Graphs. SWAT Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2014	J	`jnl`	Generalizing Geometric Graphs. J. Graph Algorithms Appl. Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2014	A	`conf`	Graph Drawing Contest Report. GD Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter
2014	A	`conf`	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. GD Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2014	J	`jnl`	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2014	J	`jnl`	On d-regular schematization of embedded paths. Comput. Geom. Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
2014	A	`conf`	Online Dynamic Power Management with Hard Real-Time Guarantees. STACS Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2014	J	`jnl`	Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2014	J	`jnl`	Orthogonal Graph Drawing with Inflexible Edges. CoRR Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
2014	B	`conf`	Planar Embeddings with Small and Uniform Faces. ISAAC Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2014	J	`jnl`	Planar Embeddings with Small and Uniform Faces. CoRR Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2014	J	`jnl`	Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	J	`jnl`	A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2013	J	`jnl`	Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. CoRR Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2013	A	`conf`	Drawing Planar Graphs with a Prescribed Inner Face. GD Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
2013	J	`jnl`	Drawing Planar Graphs with a Prescribed Inner Face. CoRR Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
2013	J	`jnl`	Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2013	J	`jnl`	Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
2013	J	`jnl`	Graphs with Plane Outside-Obstacle Representations. CoRR Alexander Koch, Marcus Krug, Ignaz Rutter
2013	A	`conf`	Many-to-One Boundary Labeling with Backbones. GD Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2013	J	`jnl`	Many-to-One Boundary Labeling with Backbones. CoRR Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2013	J	`jnl`	Multi-Sided Boundary Labeling CoRR Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
2013	J	`jnl`	On the Complexity of Partitioning Graphs for Arc-Flags. J. Graph Algorithms Appl. Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner
2013	J	`jnl`	Online Power-Managing Strategy with Hard Real-Time Guarantees CoRR Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013	—	`conf`	Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2013	—	`conf`	Search-Space Size in Contraction Hierarchies. ICALP (1) Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
2013	—	`ch.`	Simultaneous Embedding of Planar Graphs. Handbook of Graph Drawing and Visualization Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter
2013	A	`conf`	Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. GD Thomas Bläsius, Annette Karrer, Ignaz Rutter
2013	A*	`conf`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. SODA Thomas Bläsius, Ignaz Rutter
2013	J	`jnl`	Testing Mutual Duality of Planar Graphs CoRR Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	B	`conf`	Testing Mutual Duality of Planar Graphs. ISAAC Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
2013	J	`jnl`	The density maximization problem in graphs. J. Comb. Optim. Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013	B	`conf`	Two-Sided Boundary Labeling with Adjacent Sides. WADS Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
2013	A	`conf`	Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2013	J	`jnl`	Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2012	J	`jnl`	A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs CoRR Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2012	J	`jnl`	An algorithmic study of switch graphs. Acta Informatica Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger
2012	J	`jnl`	Augmenting the Connectivity of Planar and Geometric Graphs. J. Graph Algorithms Appl. Ignaz Rutter, Alexander Wolff
2012	A	`conf`	Column-Based Graph Layouts. GD Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner
2012	B	`conf`	Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2012	J	`jnl`	Cubic Augmentation of Planar Graphs CoRR Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012	B	`conf`	Cubic Augmentation of Planar Graphs. ISAAC Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012	J	`jnl`	Disconnectivity and Relative Positions in Simultaneous Embeddings CoRR Thomas Bläsius, Ignaz Rutter
2012	A	`conf`	Disconnectivity and Relative Positions in Simultaneous Embeddings. GD Thomas Bläsius, Ignaz Rutter
2012	A	`conf`	Edge-Weighted Contact Representations of Planar Graphs. GD Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2012	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2012	J	`jnl`	Fork-forests in bi-colored complete bipartite graphs CoRR Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
2012	J	`jnl`	Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
2012	C	`conf`	On the Complexity of Partitioning Graphs for Arc-Flags. ATMOS Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner
2012	J	`jnl`	Optimal Orthogonal Graph Drawing with Convex Bend Costs CoRR Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2012	J	`jnl`	Simultaneous Embedding of Planar Graphs CoRR Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter
2012	J	`jnl`	Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Algorithms Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2011	—	`conf`	A kuratowski-type theorem for planarity of partially embedded graphs. SCG Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2011	J	`jnl`	Computing large matchings in planar graphs with fixed minimum degree. Theor. Comput. Sci. Robert Franke, Ignaz Rutter, Dorothea Wagner
2011	—	`conf`	Connecting Two Trees with Optimal Routing Cost. CCCG Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
2011	J	`jnl`	Consistent Labeling of Rotating Maps CoRR Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2011	B	`conf`	Consistent Labeling of Rotating Maps. WADS Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2011	A	`conf`	Generalizing Geometric Graphs. GD Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2011	C	`conf`	Hamiltonian Orthogeodesic Alternating Paths. IWOCA Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
2011	B	`conf`	On SOFSEM Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
2011	J	`jnl`	Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems CoRR Thomas Bläsius, Ignaz Rutter
2011	—	`conf`	Sliding labels for dynamic point labeling. CCCG Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2011	B	`conf`	Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner
2011	Misc	`conf`	The Density Maximization Problem in Graphs. COCOON Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2011	—	`ch.`	The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs. Ausgezeichnete Informatikdissertationen Ignaz Rutter
2011	—	`—`	The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs. Ignaz Rutter
2010	A	`conf`	Automatic Generation of Route Sketches. GD Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
2010	J	`jnl`	Computing large matchings fast. ACM Trans. Algorithms Ignaz Rutter, Alexander Wolff
2010	B	`conf`	Gateway Decompositions for Constrained Reachability Problems. SEA Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner
2010	A	`conf`	Orthogonal Graph Drawing with Flexibility Constraints. GD Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2010	A*	`conf`	Testing Planarity of Partially Embedded Graphs. SODA Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2010	C	`conf`	Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. IWOCA Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2009	B	`conf`	An Algorithmic Study of Switch Graphs. WG Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger
2009	B	`conf`	Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. ISAAC Robert Franke, Ignaz Rutter, Dorothea Wagner
2009	A	`conf`	Manhattan-Geodesic Embedding of Planar Graphs. GD Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff
2008	J	`jnl`	Augmenting the Connectivity of Planar and Geometric Graphs. Electron. Notes Discret. Math. Ignaz Rutter, Alexander Wolff
2008	A*	`conf`	Computing large matchings fast. SODA Ignaz Rutter, Alexander Wolff