36 citations · 216 across the 70 of their papers we have counts for
8 papers · 1 filter
Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg +2
We consider the problem of untangling a given (non-planar) straight-line circular drawing of an outerplanar graph into a planar straight-line circular drawing by s…
Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
The concept of multilayer networks has become recently integrated into complex systems modeling since it encapsulates a very general concept of complex relationships. Biological pa…
Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li +2
Point feature labeling is a classical problem in cartography and GIS that has been extensively studied for geospatial point data. At the same time, word clouds are a popular visual…
Layered Area-Proportional Rectangle Contact Representations
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoi…
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Markus Wallinger, Daniel Archambault, David Auber +2
Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to d…
On Families of Planar DAGs with Constant Stack Number
Martin Nöllenburg, Sergey Pupyrev
A -stack layout (or -page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into sets of non-crossing edges with respect…