( en | de | ru )

 

Disambiguation of "Demaine, Erik D."

Author of the publication

copydeleteadd this publication to your clipboard
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.

, , , , , , and . Discret. Comput. Geom., 33 (4): 593-604 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nilgün Erikli

Anders Erikson

Magdalena Karin Matilda Eriksson

Max-Peter Eriksen

Elina Eriksson

 

Other publications of authors with the same name

Efficient Algorithms for Petersen's Matching Theorem., , , and . J. Algorithms, 38 (1): 110-134 (2001)Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 262-273. Springer, (2002)Particle computation: Designing worlds to control robot swarms with only global signals., , , and . ICRA, page 6751-6756. IEEE, (2014)A Generalization of the Source Unfolding of Convex Polyhedra., and . EGC, volume 7579 of Lecture Notes in Computer Science, page 185-199. Springer, (2011)Vertex-Unfoldings of Simplicial Manifolds, , , , and . CoRR, (2001)Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes, , , and . CoRR, (2000)PushPush is NP-hard in 2D, , and . CoRR, (2000)Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy., , , , and . ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment., , , , , , and . J. Inf. Process., (2020)Adventures in Maze Folding Art., and . J. Inf. Process., (2020)