research
∙
08/25/2023
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Computing planar orthogonal drawings with the minimum number of bends is...
share
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
∙
09/01/2022
On the Complexity of the Storyplan Problem
Motivated by dynamic graph visualization, we study the problem of repres...
research
∙
08/26/2022
Testing Upward Planarity of Partial 2-Trees
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
research
∙
03/10/2022
Parameterized Algorithms for Upward Planarity
We obtain new parameterized algorithms for the classical problem of dete...
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
∙
05/17/2021
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
The planar slope number psn(G) of a planar graph G is the minimum number...
research
∙
08/10/2020
Storyline Visualizations with Ubiquitous Actors
Storyline visualizations depict the temporal dynamics of social interact...
research
∙
11/05/2019
Packing Trees into 1-planar Graphs
We introduce and study the 1-planar packing problem: Given k graphs with...
research
∙
08/14/2019
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...
research
∙
03/19/2019
Upward Book Embeddings of st-Graphs
We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...
research
∙
09/21/2018
Polyline Drawings with Topological Constraints
Let G be a simple topological graph and let Γ be a polyline drawing of G...
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
∙
03/27/2018
Universal Slope Sets for Upward Planar Drawings
We prove that every set S of Δ slopes containing the horizontal slope i...
research
∙
08/30/2017
