18 citations · 50 across the 37 of their papers we have counts for
6 papers · 1 filter
Drawing Partially Embedded and Simultaneously Planar Graphs
Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger +3
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing…
A Survey on Small-Area Planar Graph Drawing
Giuseppe Di Battista, Fabrizio Frati
We survey algorithms and bounds for constructing planar drawings of graphs in small area.
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.
Compatible Connectivity-Augmentation of Planar Disconnected Graphs
Greg Aloupis, Luis Barba, Paz Carmi +3
Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled -vertex planar graph, $\mathc…
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…
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…