Author of the publication

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete.

, , , , , , and . FUN, volume 157 of LIPIcs, page 7:1-7:14. 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

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard., , and . CoRR, (2018)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard., , and . ITCS, volume 151 of LIPIcs, page 62:1-62:42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets., , , and . Theor. Comput. Sci., (August 2023)Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard., , , and . ISAAC, volume 181 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles., , , and . SoCG, volume 224 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 47-58. Springer, (2022)This Game Is Not Going To Analyze Itself., , , , , , , and . CoRR, (2023)PSPACE-completeness of Pulling Blocks to Reach a Goal., , , , , , , and . J. Inf. Process., (2020)Orthogonal Fold & Cut., , , , , , and . CoRR, (2022)