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.

No persons found for author name Diomidov, Yevhenii
add a person with the name Diomidov, Yevhenii
 

Other publications of authors with the same name

This Game Is Not Going To Analyze Itself., , , , , , , and . CoRR, (2023)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 47-58. Springer, (2022)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)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)Any platonic solid can transform to another by O(1) refoldings., , , , , and . Comput. Geom., (August 2023)New Results in Sona Drawing: Hardness and TSP Separation., , , , , , , , and . CCCG, page 63-72. (2020)Complexity of Reconfiguration in Surface Chemical Reaction Networks., , , , , , , , , and 2 other author(s). CoRR, (2023)Strings-and-Coins and Nimstring are PSPACE-complete., and . CoRR, (2021)