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

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, , , , and . SIAM J. Comput., 48 (6): 1727--1762 (2019)Area-Optimal Simple Polygonalizations: The CG Challenge 2019, , , , and . CoRR, (2021)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . Graphs Comb., 36 (2): 251-267 (2020)A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks., and . Int. J. High Speed Comput., 8 (1): 81-92 (1996)Online searching with turn cost., , and . Theor. Comput. Sci., 361 (2-3): 342-355 (2006)Classic Nintendo games are (computationally) hard., , , and . Theor. Comput. Sci., (2015)Area-Optimal Simple Polygonalizations: The CG Challenge 2019., , , , and . ACM J. Exp. Algorithmics, (2022)Complexity of Solo Chess with Unlimited Moves., , , , , and . CoRR, (2023)An end-to-end approach to making self-folded 3D surface shapes by uniform heating., , , , , , , , and . ICRA, page 1466-1473. IEEE, (2014)Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)