Author of the publication

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.

, , , , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 180-192. Springer, (2015)

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.

 

Other publications of authors with the same name

Open Problems from CCCG 2009, and . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..Optimal Covering Tours with Turn Costs, , , , , and . (June 2005)Solving the Rubik's Cube Optimally is NP-complete., , and . CoRR, (2017)The complexity of UNO, , , , and . CoRR, (2010)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , and 1 other author(s). Robotica, 29 (1): 59-71 (2011)Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)On universally easy classes for NP-complete problems., , and . SODA, page 910-911. ACM/SIAM, (2001)Geometric folding algorithms - linkages, origami, polyhedra., and . Cambridge University Press, (2007)Resizable Arrays in Optimal Time and Space., , , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 37-48. Springer, (1999)Flattening Fixed-Angle Chains Is Strongly NP-Hard., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)