Alexander Wolff

research

∙ 09/04/2023

A Simple Pipeline for Orthogonal Graph Drawing

Orthogonal graph drawing has many applications, e.g., for laying out UML...

0 Tim Hegemann, et al. ∙

research

∙ 08/29/2023

The Parametrized Complexity of the Segment Number

Given a straight-line drawing of a graph, a segment is a maximal set of ...

0 Sabine Cornelsen, et al. ∙

research

∙ 03/14/2023

Coloring and Recognizing Directed Interval Graphs

A mixed interval graph is an interval graph that has, for every pair of ...

0 Grzegorz Gutowski, et al. ∙

research

∙ 10/13/2022

Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

We consider the problem of drawing multiple gene trees inside a single s...

0 Jonathan Klawitter, et al. ∙

research

∙ 10/11/2022

Morphing Planar Graph Drawings Through 3D

In this paper, we investigate crossing-free 3D morphs between planar str...

0 Kevin Buchin, et al. ∙

research

∙ 10/10/2022

Parameterized Approaches to Orthogonal Compaction

Orthogonal graph drawings are used in applications such as UML diagrams,...

0 Walter Didimo, et al. ∙

research

∙ 08/30/2022

Coloring Mixed and Directional Interval Graphs

A mixed graph has a set of vertices, a set of undirected egdes, and a se...

0 Grzegorz Gutowski, et al. ∙

research

∙ 06/30/2022

Bounding and computing obstacle numbers of graphs

An obstacle representation of a graph G consists of a set of pairwise di...

0 Martin Balko, et al. ∙

research

∙ 02/25/2022

Outside-Obstacle Representations with All Vertices on the Outer Face

An obstacle representation of a graph G consists of a set of polygonal o...

0 Oksana Firman, et al. ∙

research

∙ 02/23/2022

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs

The segment number of a planar graph G is the smallest number of line se...

0 Ina Goeßmann, et al. ∙

research

∙ 12/06/2021

Morphing Rectangular Duals

We consider the problem of morphing between rectangular duals of a plane...

0 Steven Chaplick, et al. ∙

research

∙ 07/11/2021

Algorithms for Floor Planning with Proximity Requirements

Floor planning is an important and difficult task in architecture. When ...

0 Jonathan Klawitter, et al. ∙

research

∙ 03/17/2021

Adjacency Graphs of Polyhedral Surfaces

We study whether a given graph can be realized as an adjacency graph of ...

0 Elena Arseneva, et al. ∙

research

∙ 02/03/2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

A rectangular dual of a graph G is a contact representation of G by axis...

0 Steven Chaplick, et al. ∙

research

∙ 08/24/2020

Layered Drawing of Undirected Graphs with Generalized Port Constraints

The aim of this research is a practical method to draw cable plans of co...

0 Julian Walter, et al. ∙

research

∙ 03/10/2020

Drawing Graphs with Circular Arcs and Right-Angle Crossings

In a RAC drawing of a graph, vertices are represented by points in the p...

0 Steven Chaplick, et al. ∙

research

∙ 02/27/2020

The Complexity of Finding Tangles

We study the following combinatorial problem. Given a set of n y-monoton...

0 Oksana Firman, et al. ∙

research

∙ 11/05/2019

Angle Covers: Algorithms and Complexity

Consider a graph with a rotation system, namely, for every vertex, a cir...

0 William Evans, et al. ∙

research

∙ 08/23/2019

Variants of the Segment Number of a Graph

The segment number of a planar graph is the smallest number of line segm...

0 Yoshio Okamoto, et al. ∙

research

∙ 08/22/2019

Representing Graphs and Hypergraphs by Touching Polygons in 3D

Contact representations of graphs have a long history. Most research h...

0 William Evans, et al. ∙

research

∙ 08/20/2019

Line and Plane Cover Numbers Revisited

A measure for the visual complexity of a straight-line crossing-free dra...

0 Therese Biedl, et al. ∙

research

∙ 07/18/2019

On Arrangements of Orthogonal Circles

In this paper, we study arrangements of orthogonal circles, that is, arr...

0 Steven Chaplick, et al. ∙

research

∙ 07/11/2019

Stick Graphs with Length Constraints

Stick graphs are intersection graphs of horizontal and vertical line seg...

0 Steven Chaplick, et al. ∙

research

∙ 01/19/2019

Computing Optimal Tangles Faster

We study the following combinatorial problem. Given a set of n y-monoton...

0 Oksana Firman, et al. ∙

research

∙ 12/11/2018

Bundled Crossings Revisited

An effective way to reduce clutter in a graph drawing that has (many) cr...

0 Steven Chaplick, et al. ∙

research

∙ 08/30/2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

While orthogonal drawings have a long history, smooth orthogonal drawing...

0 Evmorfia Argyriou, et al. ∙

research

∙ 06/26/2018

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-pla...

0 Steven Chaplick, et al. ∙

research

∙ 06/07/2018

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

We initiate the study of the following natural geometric optimization pr...

0 Timothy M. Chan, et al. ∙

research

∙ 04/08/2018

Multi-Level Steiner Trees

In the classical Steiner tree problem, one is given an undirected, conne...

0 Reyan Ahmed, et al. ∙

research

∙ 09/20/2017

Drawing Graphs on Few Circles and Few Spheres

Given a drawing of a graph, its visual complexity is defined as the numb...

0 Myroslav Kryven, et al. ∙

research

∙ 09/04/2017

Computing Storyline Visualizations with Few Block Crossings

Storyline visualizations show the structure of a story, by depicting the...

0 Thomas C. van Dijk, et al. ∙

research

∙ 08/30/2017

Planar L-Drawings of Directed Graphs

We study planar drawings of directed graphs in the L-drawing standard. W...

0 Steven Chaplick, et al. ∙

research

∙ 08/29/2017

Beyond Outerplanarity

We study straight-line drawings of graphs where the vertices are placed ...

0 Steven Chaplick, et al. ∙

Alexander Wolff

Featured Co-authors