E. Di Giacomo

activity

20142026

most citedProperties and Complexity of Fan-Planarity

38 citations · 46 across the 12 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.CC2022

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 $G$ in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…

cs.DS2022

Testing Upward Planarity of Partial $2$ -Trees

Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati +3

We present an $O (n^{2})$ -time algorithm to test whether an $n$ -vertex directed partial $2$ -tree is upward planar. This result improves upon the previously best known algorithm, which…

On the Complexity of the Storyplan Problem

Testing Upward Planarity of Partial 2-Trees

Testing Upward Planarity of Partial $2$ -Trees