( en | de | ru )

 

Disambiguation of "Demaine, Erik D."

Author of the publication

copydeleteadd this publication to your clipboard
An optimal decomposition algorithm for tree edit distance.

, , , and . ACM Trans. Algorithms, 6 (1): 2:1-2:19 (2009)

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

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications., and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 401-413. Springer, (2002)An end-to-end approach to making self-folded 3D surface shapes by uniform heating., , , , , , , , and . ICRA, page 1466-1473. IEEE, (2014)Meshes Preserving Minimum Feature Size., , , , and . EGC, volume 7579 of Lecture Notes in Computer Science, page 258-273. Springer, (2011)Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams., , , , , , and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 80-92. Springer, (2006)Bumpy Pyramid Folding., , , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Computing 3SAT on a Fold-and-Cut Machine., , , and . CCCG, page 208-213. (2017)Locked and Unlocked Chains of Planar Shapes., , , , , , , and . Discret. Comput. Geom., 44 (2): 439-462 (2010)Geometric folding algorithms - linkages, origami, polyhedra., and . Cambridge University Press, (2007)Open Problems from CCCG 2009, and . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..On universally easy classes for NP-complete problems., , and . SODA, page 910-911. ACM/SIAM, (2001)