38 citations · 77 across the 28 of their papers we have counts for
3 papers · 1 filter
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
Strictly-Convex Drawings of -Connected Planar Graphs
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1
Strictly-convex straight-line drawings of -connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such…
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1
We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motiva…