The Nesting Bird Box Problem is ER-complete.
Journal of Graph Algorithms and Applications26(4), 421–446 (2022)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.
citing papers explorer
-
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
The Nesting Bird Box Problem is ER-complete.
-
Realizing Planar Linkages in Polygonal Domains
Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.