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

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)Reconfiguring Undirected Paths., , , , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 353-365. Springer, (2019)Arithmetic Expression Construction., , , , , , , , , and 3 other author(s). ISAAC, volume 181 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Shortest Separating Cycle Problem., , , , and . WAOA, volume 10138 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . Graphs Comb., 36 (2): 251-267 (2020)Finding Closed Quasigeodesics on Convex Polyhedra., , and . SoCG, volume 164 of LIPIcs, page 33:1-33:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multidimensional Scaling: Approximation and Complexity., , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 2568-2578. PMLR, (2021)New Results in Sona Drawing: Hardness and TSP Separation., , , , , , , , and . CCCG, page 63-72. (2020)Conflict-Free Coloring of Graphs, , , , , , , and . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)Scalable Equilibrium Computation in Multi-agent Influence Games on Networks., , , , , , , , and . AAAI, page 5277-5285. AAAI Press, (2021)