The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- Know when to fold 'em: self-assembly of shapes by folding in oritatami (Q1621127) (← links)
- The fewest clues problem (Q1623268) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Unfolding genus-2 orthogonal polyhedra with linear refinement (Q1684951) (← links)
- Pachinko (Q1699294) (← links)
- Any monotone function is realized by interlocked polygons (Q1736502) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Diameter and treewidth in minor-closed graph families, revisited (Q1762990) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- Fast allocation and deallocation with an improved buddy system (Q1772105) (← links)
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (Q1774147) (← links)
- Reconfiguring massive particle swarms with limited, global control (Q1796425) (← links)
- Flipturning Polygons (Q1864190) (← links)
- Long proteins with unique optimal foldings in the H-P model (Q1873159) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- When can you fold a map? (Q1883580) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Solitaire clobber (Q1884994) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Developing a tetramonohedron with minimum cut length (Q2088883) (← links)
- PSPACE-completeness of reversible deterministic systems (Q2104136) (← links)
- Ununfoldable polyhedra with \(6\) vertices or \(6\) faces (Q2123289) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q2154080) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q2154096) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← 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)
- Simulation of programmable matter systems using active tile-based self-assembly (Q2278616) (← links)
- Reconfiguring undirected paths (Q2285101) (← links)
- Polyhedral characterization of reversible hinged dissections (Q2308491) (← links)
- Infinite all-layers simple foldability (Q2308494) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Cookie clicker (Q2308498) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Fun with fonts: algorithmic typography (Q2347005) (← links)
- Classic Nintendo games are (computationally) hard (Q2347007) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← links)
- A unified access bound on comparison-based dynamic dictionaries (Q2381520) (← links)
- Efficient reconfiguration of lattice-based modular robots (Q2391539) (← links)
- Refold rigidity of convex polyhedra (Q2391544) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
