38 citations · 68 across the 29 of their papers we have counts for
3 papers · 1 filter
Clustered Planarity = Flat Clustered Planarity
Pier Francesco Cortese, Maurizio Patrignani
The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts…
Upward Planar Morphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati +2
We prove that, given two topologically-equivalent upward planar straight-line drawings of an -vertex directed graph , there always exists a morph between them such that all t…
Bend-minimum Orthogonal Drawings in Quadratic Time
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
Let be a planar -graph (i.e., a planar graph with vertex degree at most three) with vertices. We present the first -time algorithm that computes a planar orthogo…