Showing 1–20 of 207 results
/ Date/ Name
Sep 23, 2021Multidimensional Scaling: Approximation and ComplexityJun 27, 2021Edge-Unfolding Prismatoids: Tall or Rectangular BaseApr 1, 2022Traversability, Reconfiguration, and Reachability in the Gadget FrameworkNov 1, 2016Unfolding Genus-2 Orthogonal Polyhedra with Linear RefinementSep 29, 2020Tetris is NP-hard even with $O(1)$ rows or columnsJan 16, 2021Strings-and-Coins and Nimstring are PSPACE-completeJul 28, 2020Acutely Triangulated, Stacked, and Very Ununfoldable PolyhedraDec 30, 2008A Pseudopolynomial Algorithm for Alexandrov's TheoremJun 1, 2023Complexity of Simple Folding of Mixed Orthogonal Crease PatternsJun 8, 2022Reconfiguration of Non-crossing Spanning TreesDec 19, 2024Folding One Polyhedral Metric Graph into AnotherJul 6, 2015Rigid Origami Vertices: Conditions and Forcing SetsFeb 11, 2015Characterization of Curved Creases and Rulings: Design and Analysis of Lens TessellationsMar 16, 2012Picture-Hanging PuzzlesMar 9, 2018Computational Complexity of Generalized Push FightMar 31, 2002Coin-Moving PuzzlesApr 9, 2002Solitaire ClobberJun 7, 2025#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?Jul 17, 2020Escaping a PolygonOct 20, 2025Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard