activity
20082026
most citedMetroSets: Visualizing Sets as Metro Maps

36 citations · 216 across the 70 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.CG2020★ 1 cited

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard

Man-Kwun Chiu, Jonas Cleve, Martin Nöllenburg

Weak unit disk contact graphs are graphs that admit a representation of the nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge betwe…

cs.SI2020★ 25 cited

The Turing Test for Graph Drawing Algorithms

Helen C. Purchase, Daniel Archambault, Stephen Kobourov +3

Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred ex…

cs.GR2020★ 36 cited

MetroSets: Visualizing Sets as Metro Maps

Ben Jacobsen, Markus Wallinger, Stephen Kobourov +1

We propose MetroSets, a new, flexible online tool for visualizing set systems using the metro map metaphor. We model a given set system as a hypergraph $\mathcal{H} = (V, \mathcal{…

cs.CG2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Eduard Eiben, Robert Ganian, Thekla Hamm +2

The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph , a conne…

cs.DS2020

Extending Partial 1-Planar Drawings

Eduard Eiben, Robert Ganian, Thekla Hamm +2

Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph…

cs.DS2020

Balanced Independent and Dominating Sets on Colored Interval Graphs

Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute +2

We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely -Balanced Independent Set (-BIS) and -Balanced Dominating Se…

cs.CG2020

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

Sujoy Bhore, Guangping Li, Martin Nöllenburg

Map labeling is a classical problem in cartography and geographic information systems (GIS) that asks to place labels for area, line, and point features, with the goal to select an…