13 papers
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Alexander Firbas, Robert Ganian, Sylvain Meunier +1
Two-layer drawings of bipartite graphs place the vertices of each part on one of two parallel lines and draw the edges as straight-line links. Traditionally, the optimization goal…
Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints
Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg
Geophylogenies are a common type of diagram for visualizing the evolutionary history of species in a geographic context. As a drawing problem, these diagrams are commonly modeled a…
Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola +2
A preference profile (i.e., a collection of linear preference orders of the voters over a set of alternatives) with alternatives and voters is -Manhattan (resp. -Eucl…
Representing Hypergraphs by Point-Line Incidences
Alexander Dobler, Stephen Kobourov, Debajyoti Mondal +1
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, w…
Realizing Planar Linkages in Polygonal Domains
Thomas Depian, Carolina Haase, Martin Nöllenburg +1
A linkage consists of a graph and an edge-length function . Deciding whether can be realized as a planar straight-line embedding in $\ma…
Clarity and Computational Efficiency of Orbital Boundary Labeling
Markus Wallinger, Annika Bonerath, Soeren Terziadis +2
Circular interfaces such as those found on smartwatches, automotive dashboards, cockpit instruments, or in radial visualizations pose unique challenges for placing readable labels.…