36 citations · 216 across the 70 of their papers we have counts for
9 papers · 1 filter
Computing Hive Plots: A Combinatorial Framework
Martin Nöllenburg, Markus Wallinger
Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective en…
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth +1
A fundamental question is whether one can maintain a maximum independent set in polylogarithmic update time for a dynamic collection of geometric objects in Euclidean space. Alread…
MySemCloud: Semantic-aware Word Cloud Editing
Michael Huber, Martin Nöllenburg, Anaïs Villedieu
Word clouds are a popular text visualization technique that summarize an input text by displaying its most important words in a compact image. The traditional layout methods do not…
Block Crossings in One-Sided Tanglegrams
Alexander Dobler, Martin Nöllenburg
Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets fa…
Crossing Minimization in Time Interval Storylines
Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic +2
Storyline visualizations are a popular way of visualizing characters and their interactions over time: Characters are drawn as x-monotone curves and interactions are visualized thr…
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya +2
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well…
LinSets.zip: Compressing Linear Set Diagrams
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a…
Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired…
Splitting Vertices in 2-Layer Graph Drawings
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos +8
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two…