No. Title Author Year
1 Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares A. Akitaya, Hugo et al. 2022
2 Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles Chung, Lily et al. 2022
3 Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude Ani, Joshua et al. 2022
4 Rolling Polyhedra on Tessellations Baes, Akira et al. 2022
5 Algorithmic Combinatorial Game Theory (Dagstuhl Seminar 02081) Demaine, Erik D. et al. 2021
6 Characterizing Universal Reconfigurability of Modular Pivoting Robots A. Akitaya, Hugo et al. 2021
7 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete Brunner, Josh et al. 2020
8 Arithmetic Expression Construction Alcock, Leo et al. 2020
9 Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard Brunner, Josh et al. 2020
10 Finding Closed Quasigeodesics on Convex Polyhedra Demaine, Erik D. et al. 2020
11 Recursed Is Not Recursive: A Jarring Result Demaine, Erik D. et al. 2020
12 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
13 Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard Demaine, Erik D. et al. 2020
14 Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets Ani, Joshua et al. 2020
15 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
16 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
17 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
18 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
19 Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Demaine, Erik D. et al. 2018
20 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
21 Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures Chen, Lijie et al. 2018
22 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
23 The Computational Complexity of Portal and Other 3D Video Games Demaine, Erik D. et al. 2018
24 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
25 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
26 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
27 Front Matter, Table of Contents, Preface, Conference Organization Demaine, Erik D. et al. 2016
28 LIPIcs, Volume 49, FUN'16, Complete Volume Demaine, Erik D. et al. 2016
29 Super Mario Bros. is Harder/Easier Than We Thought Demaine, Erik D. et al. 2016
30 The Complexity of Hex and the Jordan Curve Theorem Adler, Aviv et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 47


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI