Dylan H. Hendrickson

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 33

Top Topics

Mazurkiewicz Traces

Complexity Theory

Motion Planning

Top Venues

Publications

Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. SAND (2023)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. Theor. Comput. Sci. 969 (2023)
Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman
Complexity of Simple Folding of Mixed Orthogonal Crease Patterns. CoRR (2023)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. Algorithmica 85 (11) (2023)
Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
This Game Is Not Going To Analyze Itself. CoRR (2023)
Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. CoRR (2023)
Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. FUN (2022)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM (2022)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR (2022)
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
PSPACE-Completeness of Reversible Deterministic Systems. CoRR (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. SoCG (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without Flat Angles. CoRR (2022)
Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara
Orthogonal Fold & Cut. CoRR (2022)
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
PSPACE-Completeness of Reversible Deterministic Systems. MCU (2022)
Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Lower Bounds on Retroactive Data Structures. ISAAC (2022)
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Lower Bounds on Retroactive Data Structures. CoRR (2022)
Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt
The Legend of Zelda: The Complexity of Mechanics. CoRR (2022)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG (2021)
Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. FUN (2021)
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN (2021)
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
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. J. Inf. Process. 28 (2020)
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR (2020)
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR (2020)
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets. CoRR (2020)
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
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. CoRR (2020)
Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
PSPACE-completeness of Pulling Blocks to Reach a Goal. J. Inf. Process. 28 (2020)
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS (2020)
Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ISAAC (2020)
Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
PSPACE-completeness of Pulling Blocks to Reach a Goal. CoRR (2020)
Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete. CoRR (2020)
Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard. CoRR (2020)
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. CoRR (2018)