4 citations · 7 across the 5 of their papers we have counts for
5 papers
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +3
The \emph{local edge-length ratio} of a planar straight-line drawing is the largest ratio between the lengths of any pair of edges of that share a common vertex. The \emph{…
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
Testing Upward Planarity of Partial -Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati +3
We present an -time algorithm to test whether an -vertex directed partial -tree is upward planar. This result improves upon the previously best known algorithm, which…
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…
1-bend Upward Planar Drawings of SP-digraphs
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
It is proved that every series-parallel digraph whose maximum vertex-degree is admits an upward planar drawing with at most one bend per edge such that each edge segment has on…