On the Complexity of the Storyplan Problem

Abstract

Full Citation:

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

Martin Nöllenburg
Martin Nöllenburg

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