Author of the publication

Tatamibari Is NP-Complete.

, , , , , and . FUN, volume 157 of LIPIcs, page 1:1-1:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Optimal Covering Tours with Turn Costs, , , , , and . (June 2005)Folding and Unfolding Linkages, Paper, and Polyhedra.. JCDCG, volume 2098 of Lecture Notes in Computer Science, page 113-124. Springer, (2000)Resizable Arrays in Optimal Time and Space., , , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 37-48. Springer, (1999)Flattening Fixed-Angle Chains Is Strongly NP-Hard., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)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)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 208-219. Springer, (2007)Folding and Cutting Paper., , and . JCDCG, volume 1763 of Lecture Notes in Computer Science, page 104-118. Springer, (1998)Algorithms for Solving Rubik's Cubes., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 689-700. Springer, (2011)Canadians Should Travel Randomly., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 380-391. Springer, (2014)Classic Nintendo Games Are (Computationally) Hard., , , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 40-51. Springer, (2014)