research
∙
09/01/2023
Evaluating Animation Parameters for Morphing Edge Drawings
Partial edge drawings (PED) of graphs avoid edge crossings by subdividin...
share
research
∙
08/25/2023
Min-k-planar Drawings of Graphs
The study of nonplanar drawings of graphs with restricted crossing confi...
research
∙
01/03/2023
k-planar Placement and Packing of Δ-regular Caterpillars
This paper studies a packing problem in the so-called beyond-planar sett...
research
∙
08/30/2022
Small Point-Sets Supporting Graph Stories
In a graph story the vertices enter a graph one at a time and each verte...
research
∙
06/29/2022
Recognizing Map Graphs of Bounded Treewidth
A map graph is a graph admitting a representation in which vertices are ...
research
∙
05/22/2022
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem
We study the parameterized complexity of the s-Club Cluster Edge Deletio...
research
∙
08/24/2021
Quasi-upward Planar Drawings with Minimum Curve Complexity
This paper studies the problem of computing quasi-upward planar drawings...
research
∙
08/23/2021
A User Study on Hybrid Graph Visualizations
Hybrid visualizations mix different metaphors in a single layout of a ne...
research
∙
08/10/2020
Storyline Visualizations with Ubiquitous Actors
Storyline visualizations depict the temporal dynamics of social interact...
research
∙
11/25/2019
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
In this work, we continue the study of vertex colorings of graphs, in wh...
research
∙
11/05/2019
Packing Trees into 1-planar Graphs
We introduce and study the 1-planar packing problem: Given k graphs with...
research
∙
10/22/2019
Simultaneous FPQ-Ordering and Hybrid Planarity Testing
We study the interplay between embedding constrained planarity and hybri...
research
∙
08/22/2019
ChordLink: A New Hybrid Visualization Model
Many real-world networks are globally sparse but locally dense. Typical ...
research
∙
04/29/2019
Graph Planarity Testing with Hierarchical Embedding Constraints
Hierarchical embedding constraints define a set of allowed cyclic orders...
research
∙
08/31/2018
Pole Dancing: 3D Morphs for Tree Drawings
We study the question whether a crossing-free 3D morph between two strai...
research
∙
08/27/2018
Greedy Rectilinear Drawings
A drawing of a graph is greedy if for each ordered pair of vertices u an...
research
∙
08/27/2018
Turning Cliques into Paths to Achieve Planarity
Motivated by hybrid graph representations, we introduce and study the fo...
research
∙
07/03/2018
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
An ortho-polygon visibility representation Γ of a 1-plane graph G (OPVR ...
research
∙
06/29/2018
(k,p)-Planarity: A Relaxation of Hybrid Planarity
We present a new model for hybrid planarity that relaxes existing hybrid...
research
∙
06/29/2018
(k,p)-Planarity: A Generalization of Hybrid Planarity
A graph G is (k,p)-planar if its vertices can be partitioned into cluste...
research
∙
02/23/2018
