Fabrizio Frati

activity

20142022

most citedA Survey on Small-Area Planar Graph Drawing

12 citations · 19 across the 11 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 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.DS2014

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Markus Chimani, Giuseppe Di Battista, Fabrizio Frati +1

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

cs.DS2014

On the Complexity of Clustered-Level Planarity and T-Level Planarity

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2

In this paper we study two problems related to the drawing of level graphs, that is, T-LEVEL PLANARITY and CLUSTERED-LEVEL PLANARITY. We show that both problems are NP-complete in…

Testing Upward Planarity of Partial 2-Trees

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

On the Complexity of Clustered-Level Planarity and T-Level Planarity

Testing Upward Planarity of Partial $2$ -Trees