2 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo +3
We study a classic problem introduced thirty years ago by Eades and Wormald. Let be a weighted planar graph, where is a length function.…
Graph Stories in Small Area
Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista +2
We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window siz…
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich +1
The C-Planarity problem asks for a drawing of a , i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by…
Planar L-Drawings of Directed Graphs
Steven Chaplick, Markus Chimani, Sabine Cornelsen +5
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence o…