On the complexity of the storyplan problem
From MaRDI portal
Publication:6078287
DOI10.1016/j.jcss.2023.103466MaRDI QIDQ6078287
Fabrizio Montecchiani, Martin Nöllenburg, Giuseppe Liotta, Carla Binucci, Emilio Di Giacomo, Antonios Symvonis, William J. Lenhart
Publication date: 24 October 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Drawing trees in a streaming model
- A linear-time algorithm for drawing a planar graph on a grid
- Improved upper bounds for vertex cover
- Graph minors. I. Excluding a forest
- Min Cut is NP-complete for edge weighted trees
- The vertex separation number of a graph equals its path-width
- Which problems have strongly exponential complexity?
- 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
- Algorithms finding tree-decompositions of graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Algorithmic Aspects of Vertex Elimination on Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph Stories in Small Area
- Beyond Planar Graphs
- The complexity of satisfiability problems
- On the complexity of \(k\)-SAT
- On the complexity of the storyplan problem
This page was built for publication: On the complexity of the storyplan problem
