default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgnaz Rutter
Person information
- affiliation: University of Passau, Germany
- affiliation (former): TU Eindhoven, The Netherlands
- affiliation (former): Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j65]Miriam Münch, Ignaz Rutter, Peter Stumpf:
Partial and Simultaneous Transitive Orientations via Modular Decompositions. Algorithmica 86(4): 1263-1292 (2024)- [j64]Guido Brückner
, Ignaz Rutter, Peter Stumpf:
Extending Partial Representations of Circle Graphs in Near-Linear Time. Algorithmica 86(7): 2152-2173 (2024) - [c118]Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX 2024: 1-14 - [c117]Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter:
Constrained Outer-String Representations. GD 2024: 10:1-10:18 - [c116]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c115]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. GD 2024: 19:1-19:19 - [c114]Miriam Münch, Ignaz Rutter:
Parameterized Algorithms for Beyond-Planar Crossing Numbers. GD 2024: 25:1-25:16 - [c113]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. GD 2024: 35:1-35:11 - [c112]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf:
Level Planarity Is More Difficult Than We Thought (Poster Abstract). GD 2024: 50:1-50:3 - [c111]Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract). GD 2024: 51:1-51:3 - [c110]Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. GECCO 2024 - [i82]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper:
Clustered Planarity Variants for Level Graphs. CoRR abs/2402.13153 (2024) - [i81]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024) - [i80]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i79]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf:
Level Planarity Is More Difficult Than We Thought. CoRR abs/2409.01727 (2024) - [i78]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. CoRR abs/2409.01889 (2024) - [i77]Jakob Baumann, Ignaz Rutter, Dirk Sudholt:
Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation. CoRR abs/2409.15312 (2024) - [i76]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. CoRR abs/2409.20108 (2024) - 2023
- [j63]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111: 101975 (2023) - [j62]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. Discret. Comput. Geom. 70(4): 1292-1355 (2023) - [j61]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023) - [j60]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135: 125-144 (2023) - [j59]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28: 1.10:1-1.10:24 (2023) - [j58]Ignaz Rutter, Helen C. Purchase:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(2): 45-47 (2023) - [j57]Guido Brückner, Ignaz Rutter:
An SPQR-tree-like embedding representation for level planarity. J. Comput. Geom. 14(1): 48-77 (2023) - [j56]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19(4): 34:1-34:23 (2023) - [c109]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: 8343-8350 - [c108]Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components Under Node Expansion. CIAC 2023: 202-216 - [c107]Ignaz Rutter, Peter Stumpf:
Simultaneous Representation of Interval Graphs in the Sunflower Case. ESA 2023: 90:1-90:15 - [c106]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Simultaneous Planarity. GD (2) 2023: 82-96 - [c105]Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
On 3-Coloring Circle Graphs. GD (1) 2023: 152-160 - [c104]Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. WG 2023: 30-43 - [i75]Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components under Node Expansion. CoRR abs/2301.03972 (2023) - [i74]Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. CoRR abs/2302.14725 (2023) - [i73]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Simultaneous Planarity. CoRR abs/2308.11401 (2023) - [i72]Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
On 3-Coloring Circle Graphs. CoRR abs/2309.02258 (2023) - [i71]Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. CoRR abs/2310.20632 (2023) - 2022
- [j55]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level-Planarity: Transitivity vs. Even Crossings. Electron. J. Comb. 29(4) (2022) - [j54]Marcel Radermacher, Ignaz Rutter:
Inserting an edge into a geometric embedding. Comput. Geom. 102: 101843 (2022) - [j53]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): 285-306 (2022) - [j52]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: 66-74 (2022) - [c103]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. GD 2022: 371-386 - [c102]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. GD 2022: 389-403 - [c101]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. GD 2022: 418-431 - [c100]Miriam Münch, Ignaz Rutter, Peter Stumpf:
Partial and Simultaneous Transitive Orientations via Modular Decompositions. ISAAC 2022: 51:1-51:16 - [c99]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Extending Partial Representations of Circle Graphs in Near-Linear Time. MFCS 2022: 25:1-25:14 - [c98]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. WG 2022: 230-243 - [c97]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG 2022: 383-397 - [i70]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 abs/2205.07756 (2022) - [i69]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. CoRR abs/2208.14250 (2022) - [i68]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. CoRR abs/2209.00424 (2022) - [i67]Miriam Münch, Ignaz Rutter, Peter Stumpf:
Partial and Simultaneous Transitive Orientations via Modular Decomposition. CoRR abs/2209.13175 (2022) - 2021
- [j51]Guido Brückner, Ignaz Rutter:
Radial Level Planarity with Fixed Embedding. J. Graph Algorithms Appl. 25(1): 353-366 (2021) - [j50]Patrizio Angelini, Ignaz Rutter, T. P. Sandhya:
Extending Partial Orthogonal Drawings. J. Graph Algorithms Appl. 25(1): 581-602 (2021) - [j49]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874: 59-79 (2021) - [c96]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c95]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. SoCG 2021: 55:1-55:15 - [c94]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA 2021: 19:1-19:14 - [c93]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ESA 2021: 43:1-43:13 - [c92]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. ISAAC 2021: 19:1-19:17 - [e1]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. Lecture Notes in Computer Science 12868, Springer 2021, ISBN 978-3-030-92931-2 [contents] - [i66]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR abs/2102.02013 (2021) - [i65]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. CoRR abs/2103.06916 (2021) - [i64]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. CoRR abs/2106.05734 (2021) - [i63]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. CoRR abs/2106.14805 (2021) - [i62]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. CoRR abs/2108.13076 (2021) - [i61]Helen C. Purchase, Ignaz Rutter:
Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021). CoRR abs/2109.04863 (2021) - [i60]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. CoRR abs/2111.09766 (2021) - [i59]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. CoRR abs/2112.03040 (2021) - 2020
- [j48]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. J. Comb. Theory B 142: 1-35 (2020) - [j47]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. 24(2): 105-131 (2020) - [j46]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: 161-170 (2020) - [c91]Benjamin Niedermann, Ignaz Rutter:
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. GD 2020: 235-249 - [c90]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c89]Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. GD 2020: 265-278 - [c88]Marcel Radermacher, Ignaz Rutter, Peter Stumpf:
Towards a Characterization of Stretchable Aligned Graphs. GD 2020: 295-307 - [c87]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter:
Graph Drawing Contest Report. GD 2020: 507-519 - [c86]Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC 2020: 8:1-8:15 - [c85]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM 2020: 617-626 - [p2]Ignaz Rutter:
Simultaneous Embedding. Beyond Planar Graphs 2020: 237-265 - [i58]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR abs/2007.15362 (2020) - [i57]Marcel Radermacher, Ignaz Rutter, Peter Stumpf:
Towards a characterization of stretchable aligned graphs. CoRR abs/2008.06300 (2020) - [i56]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020) - [i55]Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. CoRR abs/2008.10280 (2020) - [i54]Benjamin Niedermann, Ignaz Rutter:
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. CoRR abs/2008.10373 (2020) - [i53]Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. CoRR abs/2009.12309 (2020) - [i52]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)
2010 – 2019
- 2019
- [j45]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j44]Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
Geometric Heuristics for Rectilinear Crossing Minimization. ACM J. Exp. Algorithmics 24(1): 1.12:1-1.12:21 (2019) - [j43]Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. J. Graph Algorithms Appl. 23(4): 653-682 (2019) - [j42]Giordano Da Lozzo, Ignaz Rutter:
Planarity of streamed graphs. Theor. Comput. Sci. 799: 1-21 (2019) - [c84]Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Efficient Algorithms for Ortho-Radial Graph Drawing. SoCG 2019: 53:1-53:14 - [c83]Marcel Radermacher, Ignaz Rutter:
Geometric Crossing-Minimization - A Scalable Randomized Approach. ESA 2019: 76:1-76:16 - [c82]Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. ESA 2019: 80:1-80:15 - [c81]Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. GD 2019: 517-531 - [c80]Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter:
Graph Drawing Contest Report. GD 2019: 575-583 - [c79]Giordano Da Lozzo, Ignaz Rutter:
Reaching 3-Connectivity via Edge-Edge Additions. IWOCA 2019: 175-187 - [c78]Vadim Arzamasov, Klemens Böhm, Ignaz Rutter:
Minimizing Bias in Estimation of Mutual Information from Data Streams. SSDBM 2019: 1-12 - [c77]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Graphs on Disk Arrangements. WALCOM 2019: 160-171 - [i51]Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Efficient Algorithms for Ortho-Radial Graph Drawing. CoRR abs/1903.05048 (2019) - [i50]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR abs/1904.12596 (2019) - [i49]Marcel Radermacher, Ignaz Rutter:
Geometric Crossing-Minimization - A Scalable Randomized Approach. CoRR abs/1907.01243 (2019) - [i48]Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. CoRR abs/1908.00352 (2019) - [i47]Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. CoRR abs/1908.08882 (2019) - [i46]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 abs/1909.00223 (2019) - [i45]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. CoRR abs/1910.10113 (2019) - 2018
- [j41]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 80(4): 1214-1277 (2018) - [j40]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28: 63-77 (2018) - [j39]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 22(3): 401-429 (2018) - [j38]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable exact visualization of isocontours in road networks via minimum-link paths. J. Comput. Geom. 9(1): 27-73 (2018) - [j37]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): 54:1-54:24 (2018) - [j36]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:
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c76]Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
A Geometric Heuristic for Rectilinear Crossing Minimization. ALENEX 2018: 129-138 - [c75]Mark Alfano, Scott W. Cunningham, Wouter Meulemans, Ignaz Rutter, Max Sondag, Bettina Speckmann, Emily Sullivan:
Social Network-Epistemology. eScience 2018: 320-321 - [c74]Michael Vollmer, Ignaz Rutter, Klemens Böhm:
On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data. EDBT 2018: 49-60 - [c73]Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
The Maximum Transmission Switching Flow Problem. e-Energy 2018: 340-360 - [c72]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. GD 2018: 39-52 - [c71]Marcel Radermacher, Ignaz Rutter:
Inserting an Edge into a Geometric Embedding. GD 2018: 402-415 - [c70]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2018: 609-617 - [c69]Giordano Da Lozzo, Ignaz Rutter:
Approximation Algorithms for Facial Cycles in Planar Embeddings. ISAAC 2018: 41:1-41:13 - [i44]Marcel Radermacher, Ignaz Rutter:
Inserting an Edge into a Geometric Embedding. CoRR abs/1807.11711 (2018) - [i43]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. CoRR abs/1808.09931 (2018) - [i42]Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz:
The Partition Spanning Forest Problem. CoRR abs/1809.02710 (2018) - [i41]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Graphs on Disk Arrangements. CoRR abs/1811.00785 (2018) - 2017
- [j35]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. Algorithmica 77(4): 1071-1104 (2017) - [j34]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. Int. J. Comput. Geom. Appl. 27(1-2): 121- (2017) - [j33]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. J. Graph Algorithms Appl. 21(4): 731-755 (2017) - [c68]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial contour labeling with straight leaders. PacificVis 2017: 295-304 - [c67]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. SoCG 2017: 14:1-14:16 - [c66]Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
A Simulated-Annealing-Based Approach for Wind Farm Cabling. e-Energy 2017: 203-215 - [c65]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. GD 2017: 3-16 - [c64]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:
Gap-Planar Graphs. GD 2017: 531-545 - [c63]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2017: 575-582 - [c62]Guido Brückner, Ignaz Rutter:
Partial and Constrained Level Planarity. SODA 2017: 2000-2011 - [c61]Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. SOFSEM 2017: 295-308 - [c60]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. WG 2017: 59-74 - [i40]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial Contour Labeling with Straight Leaders. CoRR abs/1702.01799 (2017) - [i39]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. CoRR abs/1703.06040 (2017) - [i38]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:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - [i37]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. CoRR abs/1708.08778 (2017) - 2016
- [j32]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Extending Convex Partial Drawings of Graphs. Algorithmica 76(1): 47-67 (2016) - [j31]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. Algorithmica 76(1): 225-258 (2016) - [j30]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal graph drawing with inflexible edges. Comput. Geom. 55: 26-40 (2016) - [j29]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. ACM J. Exp. Algorithmics 21(1): 1.4:1-1.4:21 (2016) - [j28]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1): 47-69 (2016) - [j27]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent labeling of rotating maps. J. Comput. Geom. 7(1): 308-331 (2016) - [j26]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. ACM Trans. Algorithms 12(2): 16:1-16:46 (2016) - [j25]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms 12(3): 33:1-33:32 (2016) - [j24]Thomas Bläsius, Ignaz Rutter:
A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609: 306-315 (2016) - [j23]Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner:
Search-space size in contraction hierarchies. Theor. Comput. Sci. 645: 112-127 (2016) - [c59]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. ESA 2016: 7:1-7:18 - [c58]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. GD 2016: 482-495 - [c57]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. GD 2016: 532-545 - [c56]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2016: 589-595 - [c55]Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher:
Software Visualization via Hierarchic Micro/Macro Layouts. VISIGRAPP (2: IVAPP) 2016: 155-162 - [c54]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. SODA 2016: 985-996 - [c53]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT 2016: 5:1-5:14 - [i36]Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner:
Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. CoRR abs/1602.01777 (2016) - [i35]Giordano Da Lozzo, Ignaz Rutter:
Strengthening Hardness Results to 3-Connected Planar Graphs. CoRR abs/1607.02346 (2016) - [i34]Giordano Da Lozzo, Ignaz Rutter:
On the Complexity of Realizing Facial Cycles. CoRR abs/1607.02347 (2016) - [i33]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. CoRR abs/1608.08427 (2016) - 2015
- [j22]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Regular Augmentation of Planar Graphs. Algorithmica 73(2): 306-370 (2015) - [j21]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6): 459-478 (2015) - [j20]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - [j19]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11(4): 32:1-32:42 (2015) - [j18]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. 595: 46-64 (2015) - [c52]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal Graph Drawing with Inflexible Edges. CIAC 2015: 61-73 - [c51]Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. CIAC 2015: 153-166 - [c50]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. e-Energy 2015: 289-294 - [c49]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI 2015: 192-199 - [c48]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. GD 2015: 217-230 - [c47]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. GD 2015: 472-486 - [c46]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2015: 531-537 - [c45]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. GD 2015: 548-550 - [c44]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. ISAAC 2015: 637-649 - [c43]Sebastian Buchwald, Manuel Mohr, Ignaz Rutter:
Optimal Shuffle Code with Permutation Instructions. WADS 2015: 528-541 - [i32]Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. CoRR abs/1501.07106 (2015) - [i31]Sebastian Buchwald, Manuel Mohr, Ignaz Rutter:
Optimal Shuffle Code with Permutation Instructions. CoRR abs/1504.07073 (2015) - [i30]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. CoRR abs/1505.05747 (2015) - [i29]Thomas Bläsius, Ignaz Rutter:
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. CoRR abs/1506.05673 (2015) - [i28]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. CoRR abs/1506.05715 (2015) - [i27]Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. CoRR abs/1507.01450 (2015) - [i26]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. CoRR abs/1508.07557 (2015) - [i25]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. CoRR abs/1509.05635 (2015) - [i24]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. CoRR abs/1510.02659 (2015) - [i23]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Testing Cyclic Level and Simultaneous Level Planarity. CoRR abs/1510.08274 (2015) - 2014
- [j17]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 68(4): 859-885 (2014) - [j16]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-regular schematization of embedded paths. Comput. Geom. 47(3): 381-406 (2014) - [j15]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. 24(4): 325-346 (2014) - [j14]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. J. Graph Algorithms Appl. 18(1): 35-76 (2014) - [j13]Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. J. Graph Algorithms Appl. 18(5): 677-708 (2014) - [c42]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA 2014: 161-172 - [c41]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. GD 2014: 40-51 - [c40]Thomas Bläsius, Ignaz Rutter:
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. GD 2014: 440-451 - [c39]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. GD 2014: 476-487 - [c38]Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2014: 501-506 - [c37]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. ISAAC 2014: 633-645 - [c36]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Dynamic Power Management with Hard Real-Time Guarantees. STACS 2014: 226-238 - [c35]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. SWAT 2014: 253-264 - [c34]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. SEA 2014: 235-246 - [i22]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. CoRR abs/1404.1849 (2014) - [i21]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal Graph Drawing with Inflexible Edges. CoRR abs/1404.2943 (2014) - [i20]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR abs/1405.2300 (2014) - [i19]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR abs/1409.0315 (2014) - [i18]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. CoRR abs/1409.4299 (2014) - 2013
- [j12]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4): 466-492 (2013) - [j11]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161(10-11): 1363-1366 (2013) - [j10]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013) - [j9]Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. J. Graph Algorithms Appl. 17(3): 265-299 (2013) - [j8]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4): 441-473 (2013) - [c33]Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. GD 2013: 220-231 - [c32]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [c31]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. GD 2013: 316-327 - [c30]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. GD 2013: 460-471 - [c29]Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner:
Search-Space Size in Contraction Hierarchies. ICALP (1) 2013: 93-104 - [c28]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) 2013: 184-195 - [c27]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. ISAAC 2013: 350-360 - [c26]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. SODA 2013: 1030-1043 - [c25]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Two-Sided Boundary Labeling with Adjacent Sides. WADS 2013: 463-474 - [r1]Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter:
Simultaneous Embedding of Planar Graphs. Handbook of Graph Drawing and Visualization 2013: 349-381 - [i17]Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. CoRR abs/1303.1640 (2013) - [i16]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013) - [i15]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-Sided Boundary Labeling. CoRR abs/1305.0750 (2013) - [i14]Alexander Koch, Marcus Krug, Ignaz Rutter:
Graphs with Plane Outside-Obstacle Representations. CoRR abs/1306.2978 (2013) - [i13]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. CoRR abs/1308.3370 (2013) - [i12]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. CoRR abs/1308.6778 (2013) - [i11]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - [i10]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. CoRR abs/1309.5697 (2013) - 2012
- [j7]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An algorithmic study of switch graphs. Acta Informatica 49(5): 295-312 (2012) - [j6]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. J. Discrete Algorithms 14: 150-172 (2012) - [j5]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) - [j4]Ignaz Rutter, Alexander Wolff:
Augmenting the Connectivity of Planar and Geometric Graphs. J. Graph Algorithms Appl. 16(2): 599-628 (2012) - [c24]Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. ATMOS 2012: 71-82 - [c23]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and Relative Positions in Simultaneous Embeddings. GD 2012: 31-42 - [c22]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-Weighted Contact Representations of Planar Graphs. GD 2012: 224-235 - [c21]Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. GD 2012: 236-247 - [c20]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC 2012: 75-84 - [c19]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. ISAAC 2012: 402-412 - [i9]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. CoRR abs/1201.2551 (2012) - [i8]Thomas Bläsius, Ignaz Rutter:
Disconnectivity and Relative Positions in Simultaneous Embeddings. CoRR abs/1204.2903 (2012) - [i7]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs. CoRR abs/1204.2915 (2012) - [i6]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. CoRR abs/1204.4997 (2012) - [i5]Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter:
Simultaneous Embedding of Planar Graphs. CoRR abs/1204.5853 (2012) - [i4]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. CoRR abs/1207.6960 (2012) - [i3]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. CoRR abs/1209.3865 (2012) - 2011
- [b1]Ignaz Rutter:
The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs. Karlsruhe Institute of Technology, 2011 - [j3]Robert Franke, Ignaz Rutter, Dorothea Wagner:
Computing large matchings in planar graphs with fixed minimum degree. Theor. Comput. Sci. 412(32): 4092-4099 (2011) - [c18]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Sliding labels for dynamic point labeling. CCCG 2011 - [c17]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c16]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c15]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A kuratowski-type theorem for planarity of partially embedded graphs. SCG 2011: 107-116 - [c14]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. GD 2011: 179-190 - [c13]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 - [c12]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-Regular Schematization of Embedded Paths. SOFSEM 2011: 260-271 - [c11]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent Labeling of Rotating Maps. WADS 2011: 451-462 - [c10]Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner:
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303 - [p1]Ignaz Rutter:
The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs. Ausgezeichnete Informatikdissertationen 2011: 161-170 - [i2]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent Labeling of Rotating Maps. CoRR abs/1104.5634 (2011) - [i1]Thomas Bläsius, Ignaz Rutter:
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. CoRR abs/1112.0245 (2011) - 2010
- [j2]Ignaz Rutter, Alexander Wolff:
Computing large matchings fast. ACM Trans. Algorithms 7(1): 1:1-1:21 (2010) - [c9]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. GD 2010: 92-104 - [c8]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
Automatic Generation of Route Sketches. GD 2010: 391-392 - [c7]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. IWOCA 2010: 212-225 - [c6]Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 - [c5]Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems. SEA 2010: 449-461
2000 – 2009
- 2009
- [c4]Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff:
Manhattan-Geodesic Embedding of Planar Graphs. GD 2009: 207-218 - [c3]Robert Franke, Ignaz Rutter, Dorothea Wagner:
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. ISAAC 2009: 872-881 - [c2]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An Algorithmic Study of Switch Graphs. WG 2009: 226-237 - 2008
- [j1]Ignaz Rutter, Alexander Wolff:
Augmenting the Connectivity of Planar and Geometric Graphs. Electron. Notes Discret. Math. 31: 53-56 (2008) - [c1]Ignaz Rutter, Alexander Wolff:
Computing large matchings fast. SODA 2008: 183-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 21:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
