Ignaz Rutter

Affiliations:
  • Karlsruhe Institute of Technology, Germany


According to our database1, Ignaz Rutter authored at least 129 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.
Theor. Comput. Sci., 2022

The Influence of Dimensions on the Complexity of Computing Decision Trees.
CoRR, 2022

Inserting an edge into a geometric embedding.
Comput. Geom., 2022

2021
Simultaneous FPQ-ordering and hybrid planarity testing.
Theor. Comput. Sci., 2021

Radial Level Planarity with Fixed Embedding.
J. Graph Algorithms Appl., 2021

Extending Partial Orthogonal Drawings.
J. Graph Algorithms Appl., 2021

Morphing Rectangular Duals.
CoRR, 2021

Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021).
CoRR, 2021

Extending Partial Representations of Circular-Arc Graphs.
CoRR, 2021

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing.
CoRR, 2021

Untangling Circular Drawings: Algorithms and Complexity.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Experimental Comparison of PC-Trees and PQ-Trees.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Synchronized Planarity with Applications to Constrained Planarity Problems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Polygon-Universal Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
Theor. Comput. Sci., 2020

Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171).
NII Shonan Meet. Rep., 2020

Drawing Clustered Planar Graphs on Disk Arrangements.
J. Graph Algorithms Appl., 2020

Simple <i>k</i>-planar graphs are simple (<i>k</i> + 1)-quasiplanar.
J. Comb. Theory, Ser. B, 2020

An SPQR-Tree-Like Embedding Representation for Level Planarity.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Towards a Characterization of Stretchable Aligned Graphs.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On Turn-Regular Orthogonal Representations.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Simultaneous Embedding.
Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019
Planarity of streamed graphs.
Theor. Comput. Sci., 2019

How to Draw a Planarization.
J. Graph Algorithms Appl., 2019

Geometric Heuristics for Rectilinear Crossing Minimization.
ACM J. Exp. Algorithmics, 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR, 2019

Graph Planarity Testing with Hierarchical Embedding Constraints.
CoRR, 2019

NodeTrix Planarity Testing with Small Clusters.
Algorithmica, 2019

Drawing Clustered Graphs on Disk Arrangements.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Minimizing Bias in Estimation of Mutual Information from Data Streams.
Proceedings of the 31st International Conference on Scientific and Statistical Database Management, 2019

Reaching 3-Connectivity via Edge-Edge Additions.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

An SPQR-Tree-Like Embedding Representation for Upward Planarity.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Simultaneous Representation of Proper and Unit Interval Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Geometric Crossing-Minimization - A Scalable Randomized Approach.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Efficient Algorithms for Ortho-Radial Graph Drawing.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Gap-planar graphs.
Theor. Comput. Sci., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
ACM Trans. Algorithms, 2018

Scalable exact visualization of isocontours in road networks via minimum-link paths.
J. Comput. Geom., 2018

Aligned Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2018

Linear-time recognition of map graphs with outerplanar witness.
Discret. Optim., 2018

The Partition Spanning Forest Problem.
CoRR, 2018

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.
Algorithmica, 2018

Approximation Algorithms for Facial Cycles in Planar Embeddings.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Level Planarity: Transitivity vs. Even Crossings.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

The Maximum Transmission Switching Flow Problem.
Proceedings of the Ninth International Conference on Future Energy Systems, 2018

On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

Social Network-Epistemology.
Proceedings of the 14th IEEE International Conference on e-Science, 2018

A Geometric Heuristic for Rectilinear Crossing Minimization.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Intersection-Link Representations of Graphs.
J. Graph Algorithms Appl., 2017

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
Int. J. Comput. Geom. Appl., 2017

Extending Partial Representations of Proper and Unit Interval Graphs.
Algorithmica, 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Partial and Constrained Level Planarity.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Simulated-Annealing-Based Approach for Wind Farm Cabling.
Proceedings of the Eighth International Conference on Future Energy Systems, 2017

Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Radial contour labeling with straight leaders.
Proceedings of the 2017 IEEE Pacific Visualization Symposium, 2017

2016
A new perspective on clustered planarity as a combinatorial embedding problem.
Theor. Comput. Sci., 2016

Search-space size in contraction hierarchies.
Theor. Comput. Sci., 2016

Optimal Orthogonal Graph Drawing with Convex Bend Costs.
ACM Trans. Algorithms, 2016

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems.
ACM Trans. Algorithms, 2016

On self-approaching and increasing-chord drawings of 3-connected planar graphs.
J. Comput. Geom., 2016

Consistent labeling of rotating maps.
J. Comput. Geom., 2016

Evaluation of Labeling Strategies for Rotating Maps.
ACM J. Exp. Algorithmics, 2016

On the Complexity of Realizing Facial Cycles.
CoRR, 2016

Strengthening Hardness Results to 3-Connected Planar Graphs.
CoRR, 2016

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths.
CoRR, 2016

Orthogonal graph drawing with inflexible edges.
Comput. Geom., 2016

Extending Convex Partial Drawings of Graphs.
Algorithmica, 2016

Multi-sided Boundary Labeling.
Algorithmica, 2016

Software Visualization via Hierarchic Micro/Macro Layouts.
Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2016), 2016

Beyond Level Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

Simultaneous Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Online dynamic power management with hard real-time guarantees.
Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.
ACM Trans. Algorithms, 2015

Many-to-One Boundary Labeling with Backbones.
J. Graph Algorithms Appl., 2015

Testing Cyclic Level and Simultaneous Level Planarity.
CoRR, 2015

Disconnectivity and relative positions in simultaneous embeddings.
Comput. Geom., 2015

Regular Augmentation of Planar Graphs.
Algorithmica, 2015

Optimal Shuffle Code with Permutation Instructions.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Pixel and Voxel Representations of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Towards Realistic Flow Control in Power Grid Operation.
Proceedings of the Energy Informatics, 2015

Operating Power Grids with Few Flow Control Buses.
Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

2014
Generalizing Geometric Graphs.
J. Graph Algorithms Appl., 2014

Column-Based Graph Layouts.
J. Graph Algorithms Appl., 2014

Testing Mutual duality of Planar graphs.
Int. J. Comput. Geom. Appl., 2014

On d-regular schematization of embedded paths.
Comput. Geom., 2014

Orthogonal Graph Drawing with Flexibility Constraints.
Algorithmica, 2014

Planar Embeddings with Small and Uniform Faces.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Graph Drawing Contest Report.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Drawing Simultaneously Embedded Graphs with Few Bends.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Simultaneous Embedding of Planar Graphs.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Edge-weighted contact representations of planar graphs.
J. Graph Algorithms Appl., 2013

On the Complexity of Partitioning Graphs for Arc-Flags.
J. Graph Algorithms Appl., 2013

The density maximization problem in graphs.
J. Comb. Optim., 2013

Fork-forests in bi-colored complete bipartite graphs.
Discret. Appl. Math., 2013

Online Power-Managing Strategy with Hard Real-Time Guarantees
CoRR, 2013

Graphs with Plane Outside-Obstacle Representations.
CoRR, 2013

A Kuratowski-type theorem for planarity of partially embedded graphs.
Comput. Geom., 2013

Two-Sided Boundary Labeling with Adjacent Sides.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Drawing Planar Graphs with a Prescribed Inner Face.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Hamiltonian orthogeodesic alternating paths.
J. Discrete Algorithms, 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
J. Discrete Algorithms, 2012

Simultaneous Embedding of Planar Graphs
CoRR, 2012

An algorithmic study of switch graphs.
Acta Informatica, 2012

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Cubic Augmentation of Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Column-Based Graph Layouts.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs.
PhD thesis, 2011

Computing large matchings in planar graphs with fixed minimum degree.
Theor. Comput. Sci., 2011

Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

On <i>d</i>-Regular Schematization of Embedded Paths.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs.
Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

Connecting Two Trees with Optimal Routing Cost.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Sliding labels for dynamic point labeling.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Computing large matchings fast.
ACM Trans. Algorithms, 2010

Gateway Decompositions for Constrained Reachability Problems.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Automatic Generation of Route Sketches.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Manhattan-Geodesic Embedding of Planar Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008
Augmenting the Connectivity of Planar and Geometric Graphs.
Electron. Notes Discret. Math., 2008


  Loading...