4 citations · 4 across the 3 of their papers we have counts for
3 papers
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.CG2014★ 4 cited
Increasing-Chord Graphs On Point Sets
Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson
We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph…
cs.CG2014
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…