( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Who Needs Crossings? Hardness of Plane Graph Rigidity.

, , , , , и . SoCG, том 51 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Nilgün Erikli

Anders Erikson

Magdalena Karin Matilda Eriksson

Max-Peter Eriksen

Elina Eriksson

 

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

Optimal Covering Tours with Turn Costs, , , , , и . (июня 2005)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)Basic network creation games., , , и . SPAA, стр. 106-113. ACM, (2010)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 208-219. Springer, (2007)Canadians Should Travel Randomly., , , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 380-391. Springer, (2014)Folding and Unfolding Linkages, Paper, and Polyhedra.. JCDCG, том 2098 из Lecture Notes in Computer Science, стр. 113-124. Springer, (2000)Resizable Arrays in Optimal Time and Space., , , , и . WADS, том 1663 из Lecture Notes in Computer Science, стр. 37-48. Springer, (1999)Flattening Fixed-Angle Chains Is Strongly NP-Hard., и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 314-325. Springer, (2011)A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems., , , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 163-174. Springer, (2007)