research
∙
12/07/2022
Fast and Practical DAG Decomposition with Reachability Applications
We present practical linear and almost linear-time algorithms to compute...
share
research
∙
09/09/2022
Experiments and a User Study for Hierarchical Drawings of Graphs
We present experimental results and a user study for hierarchical drawin...
research
∙
08/19/2022
Computing a Feedback Arc Set Using PageRank
We present a new heuristic algorithm for computing a minimum Feedback Ar...
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
∙
11/24/2020
Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks
We present algorithms that extend the path-based hierarchical drawing fr...
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
Algorithms and Bounds for Drawing Directed Graphs
In this paper we present a new approach to visualize directed graphs and...
research
∙
08/30/2017
