( 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.

Zachary Dotscheff

Zachary Evenson

Zachary Hayes

Zachary Taylor

Zachary J Evenson

 

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

Negative Instance for the Edge Patrolling Beacon Problem., , , , , , , и . JCDCGGG, том 13034 из Lecture Notes in Computer Science, стр. 28-35. Springer, (2018)Rigid origami vertices: conditions and forcing sets., , , , , , , и . J. Comput. Geom., 7 (1): 171-184 (2016)A Topologically Convex Vertex-Ununfoldable Polyhedron., , и . CCCG, (2011)Bumpy pyramid folding., , , , , и . Comput. Geom., (2018)A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves., , , , и . SoCG, том 293 из LIPIcs, стр. 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Algorithms for Designing Pop-Up Cards., , , , , , , , и . STACS, том 20 из LIPIcs, стр. 269-280. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Baba Is Universal., и . FUN, том 291 из LIPIcs, стр. 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Bumpy Pyramid Folding., , , , , и . CCCG, Carleton University, Ottawa, Canada, (2014)Conflict-Free Coloring of Graphs, , , , , , , и . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete., и . CCCG, (2011)