Author of the publication

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

Dissection with the Fewest Pieces is Hard, Even to Approximate., , , , , , and . CoRR, (2015)Tatamibari is NP-complete., , , , , and . CoRR, (2020)Tatamibari Is NP-Complete., , , , , and . FUN, volume 157 of LIPIcs, page 1:1-1:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . CoRR, (2018)Netrunner Mate-in-1 or -2 is Weakly NP-Hard., and . CoRR, (2017)Losing at Checkers is Hard., , , , and . CoRR, (2018)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , , , and . Theor. Comput. Sci., (2020)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . Graphs Comb., 36 (2): 251-267 (2020)Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets., , , , , and . FUN, volume 157 of LIPIcs, page 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)