On the Complexity of the Storyplan Problem

Abstract

Full Citation:

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis. On the Complexity of the Storyplan Problem. Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.