2 citations · 3 across the 4 of their papers we have counts for
9 papers
Quasi-upward Planar Drawings with Minimum Curve Complexity
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…
A User Study on Hybrid Graph Visualizations
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani +1
Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combine…
Packing Trees into 1-planar Graphs
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong +6
We introduce and study the 1-planar packing problem: Given graphs with vertices , find a 1-planar graph that contains the given graphs as edge-disjoint spa…
Upward Book Embeddings of st-Graphs
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo +3
We study -page upward book embeddings (UBEs) of -graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on pages with the additional re…
Polyline Drawings with Topological Constraints
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta +2
Let be a simple topological graph and let be a polyline drawing of . We say that \emph{partially preserves the topology} of if it has the same external boundary,…
(k,p)-Planarity: A Relaxation of Hybrid Planarity
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta +2
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph is -planar if can be partitioned into clusters of size at m…