The following pages link to Martin L. Demaine (Q223973):
Displaying 50 items.
- UNO is hard, even for a single player (Q389942) (← links)
- Reprint of: Refold rigidity of convex polyhedra (Q390173) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- (Non)Existence of pleated folds: How paper folds between creases (Q659705) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- Continuous blooming of convex polyhedra (Q659710) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- Morpion solitaire (Q864955) (← links)
- Puzzles, art, and magic with algorithms (Q864956) (← links)
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues (Q941687) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Wrapping spheres with flat paper (Q1028228) (← links)
- (Q1348401) (redirect page) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Enumerating foldings and unfoldings between polygons and polytopes (Q1348668) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami (Q1567302) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
- Pachinko (Q1699294) (← links)
- Any monotone function is realized by interlocked polygons (Q1736502) (← links)
- When can you fold a map? (Q1883580) (← links)
- Solitaire clobber (Q1884994) (← links)
- Developing a tetramonohedron with minimum cut length (Q2088883) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- Continuous flattening of all polyhedral manifolds using countably infinite creases (Q2230401) (← links)
- Snipperclips: cutting tools into desired polygons using themselves (Q2230404) (← links)
- On the effects of hierarchical self-assembly for reducing program-size complexity (Q2243581) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Fun with fonts: algorithmic typography (Q2347005) (← links)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← links)
- Refold rigidity of convex polyhedra (Q2391544) (← links)
- Hinged dissection of polyominoes and polyforms (Q2486086) (← links)
- Negative instance for the edge patrolling beacon problem (Q2695468) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)
- Variations on Instant Insanity (Q2848966) (← links)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (Q2936933) (← links)
- Polynomial-Time Algorithm for Sliding Tokens on Trees (Q2942646) (← links)
- (Q2949117) (← links)
- (Q2957882) (← links)
- Algorithms for Designing Pop-Up Cards (Q2957890) (← links)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085) (← links)
- Continuous Flattening of Orthogonal Polyhedra (Q2958089) (← links)
- Algorithms for Solving Rubik’s Cubes (Q3092271) (← links)
- Making Polygons by Simple Folds and One Straight Cut (Q3098066) (← links)
- Common Unfoldings of Polyominoes and Polycubes (Q3098067) (← links)
