38 citations · 50 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 1 cited
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…
cs.DS2019★ 1 cited
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…