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. J. Computer and Systems Sciences, volume 139, pages 103466, 2024.

Martin Nöllenburg

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