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)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. - MIT Hardness Group; Josh Brunner; Lily Chung; Erik D. Demaine; Della H. Hendrickson; Andy Tockman (FUN, 2024)

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. - MIT Hardness Group; Della H. Hendrickson; Andy Tockman (FUN, 2024)