Showing 1–20 of 57 results
/ Date/ Name
Sep 29, 2020Tetris is NP-hard even with $O(1)$ rows or columnsJul 28, 2020Acutely Triangulated, Stacked, and Very Ununfoldable PolyhedraApr 7, 2008Cauchy's Arm Lemma on a Growing SphereDec 19, 2024Folding One Polyhedral Metric Graph into AnotherFeb 11, 2015Characterization of Curved Creases and Rulings: Design and Analysis of Lens TessellationsMar 16, 2012Picture-Hanging PuzzlesMar 31, 2002Coin-Moving PuzzlesApr 9, 2002Solitaire ClobberJul 17, 2020Escaping a PolygonOct 20, 2025Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is HardJun 28, 2011Algorithms for Solving Rubik's CubesApr 3, 2023Every Author as First AuthorApr 7, 2014Fun with Fonts: Algorithmic TypographyMar 18, 2020Tatamibari is NP-completeAug 21, 2019Existence and hardness of conveyor beltsJul 19, 2019Some Polycubes Have No Edge Zipper UnfoldingJul 13, 2000PushPush and Push-1 are NP-hard in 2DJan 29, 2008A Locked Orthogonal TreeJan 21, 2016PachinkoSep 29, 2009A Universal Crease Pattern for Folding Orthogonal Shapes