Queue Layout Extension is NP-complete with all vertices present, W[1]-hard parameterized by missing elements, FPT when page count is added, and polynomial when only two vertices are missing.
O n the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults
1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.
1
Pith paper citing it
6
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Peculiarities of Extending Queue Layouts
Queue Layout Extension is NP-complete with all vertices present, W[1]-hard parameterized by missing elements, FPT when page count is added, and polynomial when only two vertices are missing.