Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDIgnaz Rutter
Person information
- affiliation: 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
- 2021
[j49]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874: 59-79 (2021)- [c94]Steven Chaplick
, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c93]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. SoCG 2021: 55:1-55:15 - [i62]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) - [i61]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. CoRR abs/2103.06916 (2021) - [i60]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. CoRR abs/2106.05734 (2021) - [i59]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. CoRR abs/2106.14805 (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, Ser. 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) - [c92]Benjamin Niedermann, Ignaz Rutter:
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. Graph Drawing 2020: 235-249 - [c91]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: 250-264 - [c90]Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. Graph Drawing 2020: 265-278 - [c89]Marcel Radermacher, Ignaz Rutter, Peter Stumpf:
Towards a Characterization of Stretchable Aligned Graphs. Graph Drawing 2020: 295-307 - [c88]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2020: 507-519 - [c87]Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC 2020: 8:1-8:15 - [c86]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM 2020: 617-626 - [p1]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) - [c85]Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Efficient Algorithms for Ortho-Radial Graph Drawing. SoCG 2019: 53:1-53:14 - [c84]Marcel Radermacher, Ignaz Rutter:
Geometric Crossing-Minimization - A Scalable Randomized Approach. ESA 2019: 76:1-76:16 - [c83]Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. ESA 2019: 80:1-80:15 - [c82]Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. Graph Drawing 2019: 517-531 - [c81]Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2019: 575-583 - [c80]Giordano Da Lozzo, Ignaz Rutter:
Reaching 3-Connectivity via Edge-Edge Additions. IWOCA 2019: 175-187 - [c79]Vadim Arzamasov, Klemens Böhm, Ignaz Rutter:
Minimizing Bias in Estimation of Mutual Information from Data Streams. SSDBM 2019: 1-12 - [c78]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) - [c77]Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
A Geometric Heuristic for Rectilinear Crossing Minimization. ALENEX 2018: 129-138 - [c76]Mark Alfano, S. Cunningham, Wouter Meulemans, Ignaz Rutter, Max Sondag, Bettina Speckmann, E. Sullivan:
Social Network-Epistemology. eScience 2018: 320-321 - [c75]Michael Vollmer, Ignaz Rutter, Klemens Böhm:
On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data. EDBT 2018: 49-60 - [c74]Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
The Maximum Transmission Switching Flow Problem. e-Energy 2018: 340-360 - [c73]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. Graph Drawing 2018: 39-52 - [c72]Marcel Radermacher, Ignaz Rutter:
Inserting an Edge into a Geometric Embedding. Graph Drawing 2018: 402-415 - [c71]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2018: 609-617 - [c70]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) - [c69]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial contour labeling with straight leaders. PacificVis 2017: 295-304 - [c68]Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. SoCG 2017: 14:1-14:16 - [c67]Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
A Simulated-Annealing-Based Approach for Wind Farm Cabling. e-Energy 2017: 203-215 - [c66]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. Graph Drawing 2017: 3-16 - [c65]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. Graph Drawing 2017: 531-545 - [c64]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2017: 575-582 - [c63]Guido Brückner, Ignaz Rutter:
Partial and Constrained Level Planarity. SODA 2017: 2000-2011 - [c62]Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. SOFSEM 2017: 295-308 - [c61]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) - [c60]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 - [c59]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond Level Planarity. Graph Drawing 2016: 482-495 - [c58]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. Graph Drawing 2016: 532-545 - [c57]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2016: 589-595 - [c56]Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher:
Software Visualization via Hierarchic Micro/Macro Layouts. VISIGRAPP (2: IVAPP) 2016: 155-162 - [c55]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 - [c54]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) - [c53]Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter:
Orthogonal Graph Drawing with Inflexible Edges. CIAC 2015: 61-73 - [c52]Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. CIAC 2015: 153-166 - [c51]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 - [c50]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 - [c49]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. Graph Drawing 2015: 217-230 - [c48]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. Graph Drawing 2015: 472-486 - [c47]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. Graph Drawing 2015: 531-537 - [c46]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
On the Relationship Between Map Graphs and Clique Planar Graphs. Graph Drawing 2015: 548-550 - [c45]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. ISAAC 2015: 637-649 - [c44]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) - [c43]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA 2014: 161-172 - [c42]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. Graph Drawing 2014: 40-51 - [c41]