| Tatamibari is NP-complete | 0 | 0.34 | 2021 |
| Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. | 0 | 0.34 | 2021 |
| On the effects of hierarchical self-assembly for reducing program-size complexity | 0 | 0.34 | 2021 |
| Existence and hardness of conveyor belts | 0 | 0.34 | 2020 |
| Path Puzzles: Discrete Tomography with a Path Constraint is Hard | 0 | 0.34 | 2020 |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 0 | 0.34 | 2020 |
| Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra | 0 | 0.34 | 2020 |
| Rectangular Unfoldings of Polycubes. | 0 | 0.34 | 2019 |
| Folding polyominoes with holes into a cube | 0 | 0.34 | 2019 |
| Pachinko. | 0 | 0.34 | 2018 |
| Conic Crease Patterns with Reflecting Rule Lines. | 0 | 0.34 | 2018 |
| Losing at Checkers is Hard. | 0 | 0.34 | 2018 |
| An End-to-End Approach to Self-Folding Origami Structures. | 0 | 0.34 | 2018 |
| Bumpy pyramid folding | 1 | 0.40 | 2018 |
| Computing 3SAT on a Fold-and-Cut Machine. | 0 | 0.34 | 2017 |
| Folding Polyominoes into (Poly)Cubes. | 1 | 0.38 | 2017 |
| Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... | 0 | 0.34 | 2017 |
| Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. | 0 | 0.34 | 2017 |
| Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. | 0 | 0.34 | 2017 |
| Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. | 0 | 0.34 | 2017 |
| Folding and Punching Paper. | 0 | 0.34 | 2017 |
| Who Needs Crossings? Hardness of Plane Graph Rigidity. | 2 | 0.36 | 2016 |
| A Dissimilarity Measure for Comparing Origami Crease Patterns. | 0 | 0.34 | 2015 |
| Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations. | 1 | 0.37 | 2015 |
| Zig-Zag Numberlink is NP-Complete. | 3 | 0.47 | 2015 |
| Reprint of: Refold rigidity of convex polyhedra | 0 | 0.34 | 2014 |
| UNO Is Hard, Even for a Single Player | 7 | 0.93 | 2014 |
| Polynomial-Time Algorithm for Sliding Tokens on Trees. | 6 | 0.52 | 2014 |
| Flat Foldings Of Plane Graphs With Prescribed Angles And Edge Lengths | 0 | 0.34 | 2014 |
| Fun with Fonts: Algorithmic Typography. | 2 | 0.65 | 2014 |
| One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. | 5 | 0.45 | 2014 |
| Zipper Unfoldability of Domes and Prismoids. | 2 | 0.42 | 2013 |
| Non-crossing matchings of points with geometric objects | 10 | 0.85 | 2013 |
| Algorithms for Designing Pop-Up Cards. | 5 | 0.63 | 2013 |
| Folding equilateral plane graphs | 0 | 0.34 | 2013 |
| Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. | 10 | 0.60 | 2013 |
| Variations on Instant Insanity. | 1 | 0.36 | 2013 |
| Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. | 0 | 0.34 | 2013 |
| One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece | 13 | 0.67 | 2012 |
| Two Hands Are Better Than One (up to constant factors) | 7 | 0.56 | 2012 |
| NP-completeness of generalized Kaboozle. | 1 | 0.36 | 2012 |
| Picture-Hanging Puzzles. | 0 | 0.34 | 2012 |
| Any Monotone Function Is Realized By Interlocked Polygons | 1 | 0.39 | 2012 |
| Meshes Preserving Minimum Feature Size. | 1 | 0.51 | 2012 |
| Convexifying Polygons Without Losing Visibilities. | 8 | 0.70 | 2011 |
| Continuous Blooming of Convex Polyhedra | 2 | 0.43 | 2011 |
| Edge-guarding Orthogonal Polyhedra. | 2 | 0.42 | 2011 |
| Algorithms for solving Rubik's cubes | 5 | 1.01 | 2011 |
| A Topologically Convex Vertex-Ununfoldable Polyhedron. | 0 | 0.34 | 2011 |
| Zipper unfoldings of polyhedral complexes | 1 | 0.49 | 2010 |
