research
∙
09/05/2023
Computing Hive Plots: A Combinatorial Framework
Hive plots are a graph visualization style placing vertices on a set of ...
share
research
∙
08/02/2023
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
A fundamental question in computational geometry is for a dynamic collec...
research
∙
06/22/2023
MySemCloud: Semantic-aware Word Cloud Editing
Word clouds are a popular text visualization technique that summarize an...
research
∙
05/08/2023
Block Crossings in One-Sided Tanglegrams
Tanglegrams are drawings of two rooted binary phylogenetic trees and a m...
research
∙
02/28/2023
Crossing Minimization in Time Interval Storylines
Storyline visualizations are a popular way of visualizing characters and...
research
∙
02/20/2023
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
The task of finding an extension to a given partial drawing of a graph w...
research
∙
02/16/2023
LinSets.zip: Compressing Linear Set Diagrams
Linear diagrams are used to visualize set systems by depicting set membe...
research
∙
01/25/2023
Splitting Vertices in 2-Layer Graph Drawings
Bipartite graphs model the relationships between two disjoint sets of en...
research
∙
01/23/2023
Splitting Plane Graphs to Outerplanarity
Vertex splitting replaces a vertex by two copies and partitions its inci...
research
∙
09/29/2022
Minimum Link Fencing
We study a variant of the geometric multicut problem, where we are given...
research
∙
09/01/2022
On the Complexity of the Storyplan Problem
Motivated by dynamic graph visualization, we study the problem of repres...
research
∙
08/30/2022
Shape-Guided Mixed Metro Map Layout
Metro or transit maps, are schematic representations of transit networks...
research
∙
08/16/2022
MosaicSets: Embedding Set Systems into Grid Graphs
Visualizing sets of elements and their relations is an important researc...
research
∙
08/09/2022
A Survey on Computing Schematic Network Maps: The Challenge to Interactivity
Schematic maps are in daily use to show the connectivity of subway syste...
research
∙
06/17/2022
On Computing Optimal Linear Diagrams
Linear diagrams are an effective way to visualize set-based data by repr...
research
∙
02/24/2022
Planarizing Graphs and their Drawings by Vertex Splitting
The splitting number of a graph G=(V,E) is the minimum number of vertex ...
research
∙
02/23/2022
Transitions in Dynamic Map Labeling
The labeling of point features on a map is a well-studied topic. In a st...
research
∙
01/24/2022
Multidimensional Manhattan Preferences
A preference profile with m alternatives and n voters is d-Manhattan (re...
research
∙
11/18/2021
Untangling Circular Drawings: Algorithms and Complexity
We consider the problem of untangling a given (non-planar) straight-line...
research
∙
10/10/2021
Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges
The concept of multilayer networks has become recently integrated into c...
research
∙
09/09/2021
Worbel: Aggregating Point Labels into Word Clouds
Point feature labeling is a classical problem in cartography and GIS tha...
research
∙
08/27/2021
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that th...
research
∙
08/24/2021
Layered Area-Proportional Rectangle Contact Representations
We investigate two optimization problems on area-proportional rectangle ...
research
∙
08/11/2021
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Edge bundling techniques cluster edges with similar attributes (i.e. sim...
research
∙
07/28/2021
On Families of Planar DAGs with Constant Stack Number
A k-stack layout (or k-page book embedding) of a graph consists of a tot...
research
∙
03/15/2021
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
A unit disk intersection representation (UDR) of a graph G represents ea...
research
∙
01/20/2021
On the Readability of Abstract Set Visualizations
Set systems are used to model data that naturally arises in many context...
research
∙
10/05/2020
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard
Weak unit disk contact graphs are graphs that admit a representation of ...
research
∙
08/21/2020
MetroSets: Visualizing Sets as Metro Maps
We propose MetroSets, a new, flexible online tool for visualizing set sy...
research
∙
08/19/2020
Parameterized Algorithms for Queue Layouts
An h-queue layout of a graph G consists of a linear order of its vertice...
research
∙
07/08/2020
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
The problem of extending partial geometric graph representations such as...
research
∙
04/25/2020
Extending Partial 1-Planar Drawings
Algorithmic extension problems of partial graph representations such as ...
research
∙
03/11/2020
Balanced Independent and Dominating Sets on Colored Interval Graphs
We study two new versions of independent and dominating set problems on ...
research
∙
02/22/2020
On Layered Fan-Planar Graph Drawings
In this paper, we study fan-planar drawings that use h layers and are pr...
research
∙
02/18/2020
Independent Sets of Dynamic Rectangles: Algorithms and Experiments
We study the maximal independent set (MIS) and maximum independent set (...
research
∙
11/20/2019
Geometric Planar Networks on Bichromatic Points
We study four classical graph problems – Hamiltonian path, Traveling sal...
research
∙
10/17/2019
Exploring Semi-Automatic Map Labeling
Label placement in maps is a very challenging task that is critical for ...
research
∙
08/23/2019
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
A k-page linear graph layout of a graph G = (V,E) draws all vertices alo...
research
∙
08/23/2019
Parameterized Algorithms for Book Embedding Problems
A k-page book embedding of a graph G draws the vertices of G on a line a...
research
∙
08/23/2019
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Partial edge drawing (PED) is a drawing style for non-planar graphs, in ...
research
∙
08/20/2019
Computing Stable Demers Cartograms
Cartograms are popular for visualizing numerical data for map regions. M...
research
∙
08/14/2019
On Strict (Outer-)Confluent Graphs
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
research
∙
04/05/2019
Drawing k-linear Metro Maps
Schematic metro maps in practice as well as metro map layout algorithms ...
research
∙
02/04/2019
External Labeling Techniques: A Taxonomy and Survey
External labeling is frequently used for annotating features in graphica...
research
∙
08/30/2018
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
While orthogonal drawings have a long history, smooth orthogonal drawing...
research
∙
08/29/2018
Short Plane Supports for Spatial Hypergraphs
A graph G=(V,E) is a support of a hypergraph H=(V,S) if every hyperedge ...
research
∙
03/15/2018
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Circular layouts are a popular graph drawing style, where vertices are p...
research
∙
08/31/2017
Lombardi Drawings of Knots and Links
Knot and link diagrams are projections of one or more 3-dimensional simp...
research
∙
08/30/2017
Planar Drawings of Fixed-Mobile Bigraphs
A fixed-mobile bigraph G is a bipartite graph such that the vertices of ...
research
∙
08/30/2017