NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (46)

cs.CG2015

Multi-Sided Boundary Labeling

Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter +3

cs.CG2014

Evaluation of Labeling Strategies for Rotating Maps

Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter

cs.DS2015

Orthogonal Graph Drawing with Inflexible Edges

Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter

cs.CG2014

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model

Thomas Bläsius, Guido Brückner, Ignaz Rutter

cs.CG2011

Consistent Labeling of Rotating Maps

Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter

cs.DS2016

Beyond Level Planarity

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3

cs.DS2011

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems

Thomas Bläsius, Ignaz Rutter

cs.CG2017

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Martin Nöllenburg, Roman Prutkin, Ignaz Rutter

cs.CC2016

Strengthening Hardness Results to 3-Connected Planar Graphs

Giordano Da Lozzo, Ignaz Rutter

math.CO2012

Cubic Augmentation of Planar Graphs

Tanja Hartmann, Jonathan Rollin, Ignaz Rutter

cs.CG2019

Geometric Crossing-Minimization -- A Scalable Randomized Approach

Marcel Radermacher, Ignaz Rutter

cs.CG2013

Graphs with Plane Outside-Obstacle Representations

Alexander Koch, Marcus Krug, Ignaz Rutter

cs.DS2013

Testing Mutual Duality of Planar Graphs

Patrizio Angelini, Thomas Bläsius, Ignaz Rutter

cs.DS2013

Online Power-Managing Strategy with Hard Real-Time Guarantees

Jian-Jia Chen, Mong-Jen Kao, D. T. Lee +2

cs.CG2017

Radial Contour Labeling with Straight Leaders

Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter

cs.DS2016

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths

Moritz Baum, Thomas Bläsius, Andreas Gemsa +2

cs.DS2015

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

Thomas Bläsius, Ignaz Rutter

cs.DS2018

Aligned Drawings of Planar Graphs

Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter

cs.DS2015

Optimal Shuffle Code with Permutation Instructions

Sebastian Buchwald, Manuel Mohr, Ignaz Rutter

cs.DS2012

Optimal Orthogonal Graph Drawing with Convex Bend Costs

Thomas Bläsius, Ignaz Rutter, Dorothea Wagner

cs.CG2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +4

cs.DS2019

An SPQR-Tree-Like Embedding Representation for Upward Planarity

Guido Brückner, Markus Himmel, Ignaz Rutter

The paper introduces the UP-tree, a data structure that compactly represents all upward planar embeddings of biconnected single‑source directed graphs, and uses it to solve the upw…

#upward planarity#embedding representation#biconnected graphs#single-source digraphs
cs.DS2013

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter +1

cs.CG2018

Drawing Clustered Graphs on Disk Arrangements

Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter +1

cs.CG2014

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs

Martin Nöllenburg, Roman Prutkin, Ignaz Rutter

cs.CG2014

Planar Embeddings with Small and Uniform Faces

Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl +1

cs.DM2012

A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs

Vít Jelínek, Jan Kratochvíl, Ignaz Rutter

cs.CG2019

Efficient Algorithms for Ortho-Radial Graph Drawing

Benjamin Niedermann, Ignaz Rutter, Matthias Wolf

cs.CG2018

The Partition Spanning Forest Problem

Philipp Kindermann, Boris Klemz, Ignaz Rutter +2

cs.CG2013

Drawing Planar Graphs with a Prescribed Inner Face

Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter

cs.DS2018

Inserting an Edge into a Geometric Embedding

Marcel Radermacher, Ignaz Rutter

cs.DS2015

Simultaneous Embedding of Planar Graphs

Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter

cs.DS2015

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices

Thomas Bläsius, Annette Karrer, Ignaz Rutter

cs.DM2015

Pixel and Voxel Representations of Graphs

Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter +2

cs.DM2018

Level Planarity: Transitivity vs. Even Crossings

Guido Brückner, Ignaz Rutter, Peter Stumpf

cs.CG2016

On the Complexity of Realizing Facial Cycles

Giordano Da Lozzo, Ignaz Rutter

cs.CG2015

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

Therese Biedl, Thomas Bläsius, Benjamin Niedermann +3

cs.DM2014

Extending Partial Representations of Proper and Unit Interval Graphs

Pavel Klavík, Jan Kratochvíl, Yota Otachi +4

cs.DS2019

NodeTrix Planarity Testing with Small Clusters

Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2

cs.DS2015

Intersection-Link Representations of Graphs

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3

cs.CG2019

Gap-planar Graphs

Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8

cs.DM2012

Fork-forests in bi-colored complete bipartite graphs

Maria Axenovich, Marcus Krug, Georg Osang +1

cs.DS2015

Planarity of Streamed Graphs

Giordano Da Lozzo, Ignaz Rutter

cs.DM2017

Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings

Lukas Barth, Benjamin Niedermann, Ignaz Rutter +1

cs.CG2013

Many-to-One Boundary Labeling with Backbones

Michael A. Bekos, Sabine Cornelsen, Martin Fink +5

cs.DS2015

Disconnectivity and Relative Positions in Simultaneous Embeddings

Thomas Bläsius, Ignaz Rutter