36 citations · 216 across the 70 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
Geometry Matters in Planar Storyplans
Alexander Dobler, Maximilian Holzmüller, Martin Nöllenburg
A storyplan visualizes a graph as a sequence of frames , each of which is a drawing of the induced subgraph of a vertex subset $V_i \s…
cs.CC2024
Pathways to Tractability for Geometric Thickness
Thomas Depian, Simon Dominik Fink, Alexander Firbas +2
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible…
cs.CC2022
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…