1 citations · 1 across the 2 of their papers we have counts for
4 papers
Computing Weak Dominance Drawings with Minimum Number of Fips
Giacomo Ortali, Ioannis G. Tollis
A weak dominance drawing of a DAG , is a -dimensional drawing such that there is a directed path from a vertex to a vertex in if for every…
Adventures in Abstraction: Reachability in Hierarchical Drawings
Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis
We present algorithms and experiments for the visualization of directed graphs that focus on displaying their reachability information. Our algorithms are based on the concepts of…
Multidimensional Dominance Drawings
Giacomo Ortali, Ioannis G. Tollis
Let be a DAG with vertices and edges. Two vertices are incomparable if doesn't reach and vice versa. We denote by \emph{width} of a DAG , , the ma…
Algorithms and Bounds for Drawing Directed Graphs
Giacomo Ortali, Ioannis G. Tollis
In this paper we present a new approach to visualize directed graphs and their hierarchies that completely departs from the classical four-phase framework of Sugiyama and computes…