Yevhenii Diomidov

According to our database, Yevhenii Diomidov authored at least 11 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Traversability, Reconfiguration, and Reachability in the Gadget Framework.

Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch

Algorithmica, November, 2023

Any platonic solid can transform to another by <i>O</i>(1) refoldings.

Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

Comput. Geom., August, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie

CoRR, 2023

This Game Is Not Going To Analyze Itself.

Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch

CoRR, 2023

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.

Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.

Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Strings-and-Coins and Nimstring are PSPACE-complete.

Erik D. Demaine, Yevhenii Diomidov

CoRR, 2021

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.

Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.

Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

PSPACE-completeness of Pulling Blocks to Reach a Goal.

Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl

J. Inf. Process., 2020

New Results in Sona Drawing: Hardness and TSP Separation.

Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020