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
∙
06/05/2023
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
Orienting the edges of an undirected graph such that the resulting digra...
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
∙
08/26/2022
Rectilinear Planarity of Partial 2-Trees
A graph is rectilinear planar if it admits a planar orthogonal drawing w...
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
∙
05/16/2022
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph ...
research
∙
01/25/2022
Computing Weak Dominance Drawings with Minimum Number of Fips
A weak dominance drawing Γ of a DAG G=(V,E), is a d-dimensional drawing ...
research
∙
10/01/2021
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs
We study the long-standing open problem of efficiently testing rectiline...
research
∙
08/09/2020
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
A plane graph is rectilinear planar if it admits an embedding-preserving...
research
∙
10/25/2019
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
A planar orthogonal drawing Γ of a planar graph G is a geometric represe...
research
∙
07/26/2019
Adventures in Abstraction: Reachability in Hierarchical Drawings
We present algorithms and experiments for the visualization of directed ...
research
∙
06/21/2019
Multidimensional Dominance Drawings
Let G be a DAG with n vertices and m edges. Two vertices u,v are incompa...
research
∙
08/30/2018