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 cs.DSShow all

2 papers · 1 filter

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…

cs.DS2017

NodeTrix Planarity Testing with Small Clusters

Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2

We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant $k$ . We consider both the case when the sid…

Testing Upward Planarity of Partial 2-Trees

NodeTrix Planarity Testing with Small Clusters

Testing Upward Planarity of Partial $2$ -Trees