The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm (Q2441357) (← links)
- Edge-unfolding nested polyhedral bands (Q2456664) (← links)
- Plane embeddings of planar graph metrics (Q2465416) (← links)
- Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
- Optimally adaptive integration of univariate Lipschitz functions (Q2480911) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries (Q2484010) (← links)
- Hinged dissection of polyominoes and polyforms (Q2486086) (← links)
- Geometric restrictions on producible polygonal protein chains (Q2492634) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Games on triangulations (Q2570126) (← links)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127) (← links)
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- Negative instance for the edge patrolling beacon problem (Q2695468) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)
- Efficient algorithms for Petersen's matching theorem (Q2709795) (← links)
- Optimal covering tours with turn costs (Q2768284) (← links)
- A linear lower bound on index size for text retrieval (Q2768307) (← links)
- On universally easy classes for NP-complete problems (Q2768398) (← links)
- Energy-efficient algorithms (Q2800581) (← links)
- Blame Trees (Q2842166) (← links)
- Basic network creation games (Q2848528) (← links)
- Variations on Instant Insanity (Q2848966) (← links)
- The Voronoi game on graphs and its complexity (Q2865040) (← links)
- Constant price of anarchy in network-creation games via public-service advertising (Q2909128) (← links)
- Bidimensionality: new connections between FPT algorithms and PTASs (Q2921717) (← links)
- Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics (Q2921724) (← links)
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality (Q2921728) (← links)
- Minimizing movement (Q2930255) (← links)
- An optimal decomposition algorithm for tree edit distance (Q2930275) (← links)
- (Q2934604) (← links)
- (Q2934606) (← links)
- Correction: Basic Network Creation Games (Q2935293) (← links)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (Q2936933) (← links)
- Polynomial-Time Algorithm for Sliding Tokens on Trees (Q2942646) (← links)
- Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488) (← links)
- Retroactive data structures (Q2944550) (← links)
- On Wrapping Spheres and Cubes with Rectangular Paper (Q2945662) (← links)
- (Q2949117) (← links)
- Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM (Q2957882) (← links)
- Algorithms for Designing Pop-Up Cards (Q2957890) (← links)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085) (← links)
- Mario Kart Is Hard (Q2958086) (← links)
