The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- (Q5501303) (← links)
- (Q5501345) (← links)
- (Q5501346) (← links)
- OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE (Q5694054) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Graph Drawing (Q5711635) (← links)
- Algorithms and Computation (Q5712100) (← links)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” (Q5741808) (← links)
- (Q5875768) (← links)
- Hinged dissections exist (Q5894520) (← links)
- Graph Drawing (Q5896901) (← links)
- Discrete and Computational Geometry (Q5897086) (← links)
- Algorithms - ESA 2003 (Q5897237) (← links)
- Algorithms and Data Structures (Q5900775) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900917) (← links)
- Hinged dissections exist (Q5901410) (← links)
- LATIN 2004: Theoretical Informatics (Q5901631) (← links)
- LATIN 2004: Theoretical Informatics (Q5901666) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Belga B-trees (Q5918357) (← links)
- Universal hinge patterns for folding strips efficiently into any grid polyhedron (Q5918984) (← links)
- Belga B-trees (Q5919683) (← links)
- Polygons cuttable by a circular saw (Q5952972) (← links)
- Reconfiguring convex polygons (Q5952973) (← links)
- Locked and unlocked polygonal chains in three dimensions (Q5953071) (← links)
- Locked and unlocked chains of planar shapes (Q5962351) (← links)
- (Q6059982) (← links)
- Arithmetic Expression Construction. (Q6065408) (← links)
- (Q6065414) (← links)
- Recursed Is Not Recursive: A Jarring Result (Q6065458) (← links)
- Chess Equilibrium Puzzles (Q6069782) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q6090541) (← links)
- Any Platonic solid can transform to another by \(O(1)\) refoldings (Q6114474) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q6165551) (← links)
- Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class (Q6302707) (← links)
- When Can You Tile an Integer Rectangle with Integer Squares? (Q6449072) (← links)
- Tatamibari is NP-complete (Q6487564) (← links)
- Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets (Q6487567) (← links)
- \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete (Q6487573) (← links)
- Super Guarding and Dark Rays in Art Galleries (Q6529491) (← links)
- Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles (Q6539542) (← links)
- Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude (Q6540571) (← links)
- Rolling polyhedra on tessellations (Q6540575) (← links)
- Compacting squares: input-sensitive in-place reconfiguration of sliding squares (Q6544059) (← links)
- Lower bounds on retroactive data structures (Q6602452) (← links)
- Reconfiguration of non-crossing spanning trees (Q6654540) (← links)
- Deltahedral Domes over Equiangular Polygons (Q6739841) (← links)
- Tiling with Three Polygons is Undecidable (Q6744945) (← links)
- Dudeney's Dissection is Optimal (Q6756673) (← links)
