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


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