3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
st-Orientations with Few Transitive Edges
Carla Binucci, Walter Didimo, Maurizio Patrignani
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph the…
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…
Placing Arrows in Directed Graph Drawings
Carla Binucci, Markus Chimani, Walter Didimo +2
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced una…