On the complexity of the storyplan problem

DOI10.1007/978-3-031-22203-0_22arXiv2209.00453OpenAlexW4317393666MaRDI QIDQ6172205

Martin Nöllenburg, Giuseppe Liotta, Emilio Di Giacomo, Carla Binucci, Antonios Symvonis, William J. Lenhart, Fabrizio Montecchiani

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.00453

zbMATH Keywords

pathwidthNP-hardnessdynamic graph drawingparameterized analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

On the complexity of the storyplan problem ⋮ On the complexity of the storyplan problem ⋮ Small Point-Sets Supporting Graph Stories

Cites Work

• Drawing trees in a streaming model
• Graph minors. I. Excluding a forest
• Min Cut is NP-complete for edge weighted trees
• Planarity of streamed graphs
• Advancements on SEFE and partitioned book embedding problems
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
• Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
• Graph minors. II. Algorithmic aspects of tree-width
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Graph Stories in Small Area
• Beyond Planar Graphs
• On the complexity of the storyplan problem

This page was built for publication: On the complexity of the storyplan problem