The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- Flattening Fixed-Angle Chains Is Strongly NP-Hard (Q5199252) (← links)
- Remarks on Separating Words (Q5200088) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- Reconfigurable asynchronous logic automata (Q5255056) (← links)
- The Fewest Clues Problem (Q5282810) (← links)
- Super Mario Bros. Is Harder/Easier than We Thought (Q5282811) (← links)
- Push-Pull Block Puzzles are Hard (Q5283366) (← links)
- (Q5290260) (← links)
- GHOST CHIMNEYS (Q5299998) (← links)
- Planar Embeddings of Graphs with Specified Edge Lengths (Q5301415) (← links)
- Deflating the Pentagon (Q5302738) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311096) (← links)
- Bidimensional Parameters and Local Treewidth (Q5317565) (← links)
- Combining Binary Search Trees (Q5326577) (← links)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (Q5326578) (← links)
- Geodesic ham-sandwich cuts (Q5361648) (← links)
- Separating point sets in polygonal environments (Q5361649) (← links)
- An energy-driven approach to linkage unfolding (Q5361665) (← links)
- Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve (Q5361674) (← links)
- Low-dimensional embedding with extra information (Q5361686) (← links)
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting (Q5361862) (← links)
- (Q5368669) (← links)
- (Q5379516) (← links)
- Linear Reconfiguration of Cube-Style Modular Robots (Q5387758) (← links)
- Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (Q5389975) (← links)
- The Price of Anarchy in Cooperative Network Creation Games (Q5389986) (← links)
- Algorithms and Data Structures (Q5394247) (← links)
- Algorithms and Data Structures (Q5394251) (← links)
- Algorithms and Data Structures (Q5394269) (← links)
- The price of anarchy in network creation games (Q5401424) (← links)
- (Q5417628) (← links)
- (Q5417689) (← links)
- (Q5417721) (← links)
- Contraction decomposition in h-minor-free graphs and algorithmic applications (Q5419114) (← links)
- (Q5427478) (← links)
- An Optimal Decomposition Algorithm for Tree Edit Distance (Q5428805) (← links)
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms (Q5432366) (← links)
- Origami, Linkages, and Polyhedra: Folding with Algorithms (Q5449509) (← links)
- Necklaces, Convolutions, and X + Y (Q5449525) (← links)
- Grid Vertex-Unfolding Orthostacks (Q5449756) (← links)
- Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues (Q5452686) (← links)
- Dynamic Optimality—Almost (Q5454250) (← links)
- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction (Q5459097) (← links)
- Approximability of Partitioning Graphs with Supply and Demand (Q5459108) (← links)
- Cache-Oblivious B-Trees (Q5470694) (← links)
- Optimal Covering Tours with Turn Costs (Q5470702) (← links)
- Logarithmic Lower Bounds in the Cell-Probe Model (Q5470720) (← links)
- Algorithms – ESA 2005 (Q5475895) (← links)
- (Q5501238) (← links)
- (Q5501269) (← links)
