Ignaz Rutter

According to our database1, Ignaz Rutter
  • authored at least 143 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Aligned Drawings of Planar Graphs.
CoRR, 2017

Gap-planar Graphs.
CoRR, 2017

Radial Contour Labeling with Straight Leaders.
CoRR, 2017

Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings.
CoRR, 2017

On the Relationship between k-Planar and k-Quasi Planar Graphs.
CoRR, 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

How to Draw a Planarization.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Partial and Constrained Level Planarity.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 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.
JoCG, 2016

Consistent labeling of rotating maps.
JoCG, 2016

Evaluation of Labeling Strategies for Rotating Maps.
ACM Journal of Experimental 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

Simultaneous Orthogonal Planarity.
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

Linear-Time Recognition of Map Graphs with Outerplanar Witness.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization, 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

Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths.
Proceedings of the 24th Annual European Symposium on Algorithms, 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

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
CoRR, 2015

Planarity of Streamed Graphs.
CoRR, 2015

Operating Power Grids with Few Flow Control Buses.
CoRR, 2015

Optimal Shuffle Code with Permutation Instructions.
CoRR, 2015

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.
CoRR, 2015

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.
CoRR, 2015

Testing Cyclic Level and Simultaneous Level Planarity.
CoRR, 2015

Intersection-Link Representations of Graphs.
CoRR, 2015

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
CoRR, 2015

Pixel and Voxel Representations of Graphs.
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

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
Proceedings of the Algorithms and Computation - 26th 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

Intersection-Link Representations of 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

Planarity of Streamed Graphs.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Orthogonal Graph Drawing with Inflexible Edges.
Proceedings of the Algorithms and Complexity - 9th International Conference, 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. Geometry Appl., 2014

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.
CoRR, 2014

Planar Embeddings with Small and Uniform Faces.
CoRR, 2014

Evaluation of Labeling Strategies for Rotating Maps.
CoRR, 2014

Orthogonal Graph Drawing with Inflexible Edges.
CoRR, 2014

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.
CoRR, 2014

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

Orthogonal Graph Drawing with Flexibility Constraints.
Algorithmica, 2014

Evaluation of Labeling Strategies for Rotating Maps.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Extending Partial Representations of Proper and Unit Interval Graphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Online Dynamic Power Management with Hard Real-Time Guarantees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

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

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 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

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.
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.
Discrete Applied Mathematics, 2013

Multi-Sided Boundary Labeling
CoRR, 2013

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

Testing Mutual Duality of Planar Graphs
CoRR, 2013

Drawing Planar Graphs with a Prescribed Inner Face.
CoRR, 2013

Graphs with Plane Outside-Obstacle Representations.
CoRR, 2013

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
CoRR, 2013

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings.
CoRR, 2013

Many-to-One Boundary Labeling with Backbones.
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

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Testing Mutual Duality of Planar Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Optimal Orthogonal Graph Drawing with Convex Bend Costs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Search-Space Size in Contraction Hierarchies.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

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

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.
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

Many-to-One Boundary Labeling with Backbones.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Augmenting the Connectivity of Planar and Geometric Graphs.
J. Graph Algorithms Appl., 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

Cubic Augmentation of Planar Graphs
CoRR, 2012

Extending Partial Representations of Proper and Unit Interval Graphs
CoRR, 2012

Simultaneous Embedding of Planar Graphs
CoRR, 2012

Optimal Orthogonal Graph Drawing with Convex Bend Costs
CoRR, 2012

A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs
CoRR, 2012

Disconnectivity and Relative Positions in Simultaneous Embeddings
CoRR, 2012

Fork-forests in bi-colored complete bipartite graphs
CoRR, 2012

An algorithmic study of switch graphs.
Acta Inf., 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

Edge-Weighted Contact Representations of Planar Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Disconnectivity and Relative Positions in Simultaneous Embeddings.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

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

On the Complexity of Partitioning Graphs for Arc-Flags.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 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

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
CoRR, 2011

Consistent Labeling of Rotating Maps
CoRR, 2011

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

Consistent Labeling of Rotating Maps.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

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

Hamiltonian Orthogeodesic Alternating Paths.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

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

Generalizing Geometric Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

A kuratowski-type theorem for planarity of partially embedded graphs.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The Density Maximization Problem in Graphs.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 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 Planarity of Partially Embedded Graphs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Orthogonal Graph Drawing with Flexibility Constraints.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
An Algorithmic Study of Switch Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
Proceedings of the Algorithms and Computation, 20th International Symposium, 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.
Electronic Notes in Discrete Mathematics, 2008

Computing large matchings fast.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008


  Loading...