( 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

Optimal Covering Tours with Turn Costs, , , , , and . (June 2005)Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, , , , and . SIAM J. Comput., 48 (6): 1727--1762 (2019)Area-Optimal Simple Polygonalizations: The CG Challenge 2019, , , , and . CoRR, (2021)A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks., and . Int. J. High Speed Comput., 8 (1): 81-92 (1996)Embedding Stacked Polytopes on a Polynomial-Size Grid., and . SODA, page 1177-1187. SIAM, (2011)Additive approximation algorithms for list-coloring minor-closed class of graphs., , and . SODA, page 1166-1175. SIAM, (2009)Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets., , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 187-198. Springer, (2022)Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs., , and . SODA, page 329-344. SIAM, (2010)Packing Cube Nets into Rectangles with O(1) Holes., , , , and . JCDCGGG, volume 13034 of Lecture Notes in Computer Science, page 152-164. Springer, (2018)Open Problems from CCCG 2009, and . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..