From post

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.

 

Другие публикации лиц с тем же именем

Open Problems from CCCG 2009, и . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..The complexity of UNO, , , , и . CoRR, (2010)Basic network creation games., , , и . SPAA, стр. 106-113. ACM, (2010)Solving the Rubik's Cube Optimally is NP-complete., , и . CoRR, (2017)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , и 1 other автор(ы). Robotica, 29 (1): 59-71 (2011)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 208-219. Springer, (2007)Resizable Arrays in Optimal Time and Space., , , , и . WADS, том 1663 из Lecture Notes in Computer Science, стр. 37-48. Springer, (1999)A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems., , , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 163-174. Springer, (2007)Flattening Fixed-Angle Chains Is Strongly NP-Hard., и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 314-325. Springer, (2011)Classic Nintendo Games Are (Computationally) Hard., , , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 40-51. Springer, (2014)