36 citations · 216 across the 70 of their papers we have counts for
9 papers · 1 filter
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies o…
Recognizing Weighted Disk Contact Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the correspo…
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
A greedily routable region (GRR) is a closed subset of , in which each destination point can be reached from each starting point by choosing the direction with maximum…
On Minimizing Crossings in Storyline Visualizations
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk +2
In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by -monotone curves that converge for each interaction, and dive…
On the Readability of Boundary Labeling
Lukas Barth, Andreas Gemsa, Benjamin Niedermann +1
Boundary labeling deals with annotating features in images such that labels are placed outside of the image and are connected by curves (so-called leaders) to the corresponding fea…
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph la…