12 citations · 57 across the 39 of their papers we have counts for
3 papers · 1 filter
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…
Deepening the Relationship between SEFE and C-Planarity
Patrizio Angelini, Giordano Da Lozzo
In this paper we deepen the understanding of the connection between two long-standing Graph Drawing open problems, that is, Simultaneous Embedding with Fixed Edges (SEFE) and Clust…
Morphing Planar Graph Drawings Optimally
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any -vertex plane graph in morphing steps, thus improving upon the p…