default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDella H. Hendrickson
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Zachary Abel, Della H. Hendrickson:
Baba Is Universal. FUN 2024: 1:1-1:15- [c16]MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman:
ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. FUN 2024: 23:1-23:20 - [c15]MIT Hardness Group, Della H. Hendrickson, Andy Tockman:
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. FUN 2024: 25:1-25:20 - [c14]MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna:
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. SWAT 2024: 34:1-34:18 - [c13]Hayashi Ani, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Della H. Hendrickson, Yael Kirkpatrick, Jeffery Li, Jayson Lynch, Ritam Nag, Frederick Stock:
Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. UCNC 2024: 219-236 - [i20]MIT Hardness Group, Della H. Hendrickson, Andy Tockman:
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. CoRR abs/2404.14519 (2024) - [i19]MIT Hardness Group, Josh Brunner, Della H. Hendrickson, Lily Chung, Erik D. Demaine, Andy Tockman:
ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. CoRR abs/2405.08377 (2024) - [i18]MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna:
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. CoRR abs/2405.15724 (2024) - 2023
- [j4]Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch
:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. Algorithmica 85(11): 3453-3486 (2023) - [j3]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: 113945 (2023) - [c12]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: 5:1-5:21 - [i17]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 abs/2302.01145 (2023) - [i16]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 abs/2306.00702 (2023) - [i15]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 abs/2306.01193 (2023) - 2022
- [c11]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: 29:1-29:17 - [c10]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: 3:1-3:30 - [c9]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Lower Bounds on Retroactive Data Structures. ISAAC 2022: 32:1-32:12 - [c8]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. MCU 2022: 91-108 - [c7]Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM 2022: 47-58 - [c6]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: 187-198 - [i14]Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara:
Orthogonal Fold & Cut. CoRR abs/2202.01293 (2022) - [i13]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 abs/2203.17167 (2022) - [i12]Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR abs/2204.00600 (2022) - [i11]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 abs/2204.03696 (2022) - [i10]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. CoRR abs/2207.07229 (2022) - [i9]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Lower Bounds on Retroactive Data Structures. CoRR abs/2211.14664 (2022) - 2021
- [c5]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: 10:1-10:20 - [c4]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: 3:1-3:23 - [c3]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: 7:1-7:14 - 2020
- [j2]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: 929-941 (2020) - [j1]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: 987-1007 (2020) - [c2]Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS 2020: 62:1-62:42 - [c1]Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ISAAC 2020: 17:1-17:14 - [i8]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 abs/2002.03887 (2020) - [i7]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 abs/2003.09914 (2020) - [i6]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 abs/2005.03192 (2020) - [i5]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 abs/2006.01256 (2020) - [i4]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 abs/2006.04337 (2020) - [i3]Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard. CoRR abs/2010.09271 (2020) - [i2]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 abs/2012.07556 (2020)
2010 – 2019
- 2018
- [i1]Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. CoRR abs/1812.03592 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
