Dylan H. Hendrickson

According to our database, Dylan H. Hendrickson authored at least 19 papers between 2018 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

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.

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

Theor. Comput. Sci., August, 2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns.

Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman

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

The Legend of Zelda: The Complexity of Mechanics.

Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt

CoRR, 2022

Orthogonal Fold & Cut.

Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara

CoRR, 2022

PSPACE-Completeness of Reversible Deterministic Systems.

Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

Lower Bounds on Retroactive Data Structures.

Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 33rd International Symposium on Algorithms and Computation, 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

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles.

Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

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

Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff

Proceedings of the 10th International Conference on Fun with Algorithms, 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

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.

Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang

J. Inf. Process., 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

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard.

Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.

Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2018

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard.

Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch

CoRR, 2018