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

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets., , , and . Theor. Comput. Sci., (August 2023)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . Algorithmica, 85 (11): 3453-3486 (November 2023)Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude., , , , , and . FUN, volume 226 of LIPIcs, page 3:1-3:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)PSPACE-completeness of Pulling Blocks to Reach a Goal., , , , , , , and . J. Inf. Process., (2020)Orthogonal Fold & Cut., , , , , , and . CoRR, (2022)Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets., , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 187-198. Springer, (2022)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)Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets., , , , , and . CoRR, (2020)Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines., , , , , , and . SAND, volume 257 of LIPIcs, page 5:1-5:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 47-58. Springer, (2022)