The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- (Q4547796) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Interlocked open linkages with few joints (Q4557554) (← links)
- Vertex-unfoldings of simplicial manifolds (Q4557559) (← links)
- Folding Polyominoes into (Poly)Cubes (Q4557731) (← links)
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces (Q4575751) (← links)
- Three Colors Suffice: Conflict-Free Coloring of Planar Graphs (Q4575874) (← links)
- Origamizer: A Practical Algorithm for Folding Any Polyhedron (Q4580109) (← links)
- The Complexity of Hex and the Jordan Curve Theorem (Q4598160) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Flat foldings of plane graphs with prescribed angles and edge lengths (Q4626289) (← links)
- (Q4633860) (← links)
- (Q4633931) (← links)
- Continuously Flattening Polyhedra Using Straight Skeletons (Q4635564) (← links)
- Juggling and Card Shuffling Meet Mathematical Fonts (Q4686109) (← links)
- (Q4737175) (← links)
- (Q4778574) (← links)
- (Q4779132) (← links)
- (Q4797605) (← links)
- (Q4801183) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596) (← links)
- A Generalization of the Source Unfolding of Convex Polyhedra (Q4899277) (← links)
- Meshes Preserving Minimum Feature Size (Q4899286) (← links)
- (Q4952695) (← links)
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (Q4962150) (← links)
- Minimizing Movement: Fixed-Parameter Tractability (Q4962172) (← links)
- Ordinal embeddings of minimum relaxation (Q4962751) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- Strings-and-Coins and Nimstring are PSPACE-complete (Q5041706) (← links)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (Q5075735) (← links)
- (Q5075776) (← links)
- Rigid flattening of polyhedra with slits (Q5078741) (← links)
- Filling a hole in a crease pattern: Isometric mapping from prescribed boundary folding (Q5078749) (← links)
- Scaling any surface down to any fraction (Q5078752) (← links)
- Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations (Q5078753) (← links)
- Weaving a uniformly thick sheet from rectangles (Q5078763) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- (Q5104352) (← links)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch (Q5115797) (← links)
- (Q5116496) (← links)
- (Q5116497) (← links)
- (Q5133640) (← links)
- (Q5133641) (← links)
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (Q5167756) (← links)
- Canadians Should Travel Randomly (Q5167757) (← links)
- Folding a Paper Strip to Minimize Thickness (Q5176577) (← links)
- Algorithms and Computation (Q5191667) (← links)
- Lossless Fault-Tolerant Data Structures with Additive Overhead (Q5199246) (← links)
