Author of the publication

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

, , , , , , , and . FUN, volume 100 of LIPIcs, page 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

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