The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- One-dimensional staged self-assembly (Q256717) (← links)
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- Reprint of: Refold rigidity of convex polyhedra (Q390173) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- New geometric algorithms for fully connected staged self-assembly (Q529018) (← links)
- Proximate point searching (Q598552) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- On the complexity of reconfiguration problems (Q631762) (← 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)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Representing trees of higher degree (Q818675) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- Generalized D-forms have no spurious creases (Q848862) (← links)
- Low-dimensional embedding with extra information (Q854713) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Morpion solitaire (Q864955) (← links)
- Puzzles, art, and magic with algorithms (Q864956) (← links)
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Linear reconfiguration of cube-style modular robots (Q924084) (← links)
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues (Q941687) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Realizing partitions respecting full and partial order information (Q954955) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Refolding planar polygons (Q1014339) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Wrapping spheres with flat paper (Q1028228) (← links)
- (Q1348400) (redirect page) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Enumerating foldings and unfoldings between polygons and polytopes (Q1348668) (← links)
- Interlocked open and closed linkages with few joints. (Q1395574) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Straightening polygonal arcs and convexifying polygonal cycles (Q1423583) (← links)
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami (Q1567302) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
