Author of the publication

10091 Abstracts Collection - Data Structures.

, , and . Data Structures, volume 10091 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)

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

Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , and 1 other author(s). Robotica, 29 (1): 59-71 (2011)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . CoRR, (2018)Embedding Stacked Polytopes on a Polynomial-Size Grid., and . CoRR, (2014)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 208-219. Springer, (2007)Algorithms for Solving Rubik's Cubes., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 689-700. Springer, (2011)Folding and Unfolding Linkages, Paper, and Polyhedra.. JCDCG, volume 2098 of Lecture Notes in Computer Science, page 113-124. Springer, (2000)Canadians Should Travel Randomly., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 380-391. Springer, (2014)A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems., , , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 163-174. Springer, (2007)Flattening Fixed-Angle Chains Is Strongly NP-Hard., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)