No. Title Author Year
1 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete Brunner, Josh et al. 2020
2 Finding Closed Quasigeodesics on Convex Polyhedra Demaine, Erik D. et al. 2020
3 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
4 Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard Demaine, Erik D. et al. 2020
5 Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets Ani, Joshua et al. 2020
6 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
7 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
8 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
9 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
10 Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Demaine, Erik D. et al. 2018
11 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
12 Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures Chen, Lijie et al. 2018
13 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
14 The Computational Complexity of Portal and Other 3D Video Games Demaine, Erik D. et al. 2018
15 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
16 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
17 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
18 Front Matter, Table of Contents, Preface, Conference Organization Demaine, Erik D. et al. 2016
19 LIPIcs, Volume 49, FUN'16, Complete Volume Demaine, Erik D. et al. 2016
20 Super Mario Bros. is Harder/Easier Than We Thought Demaine, Erik D. et al. 2016
21 The Complexity of Hex and the Jordan Curve Theorem Adler, Aviv et al. 2016
22 The Fewest Clues Problem Demaine, Erik D. et al. 2016
23 Who Needs Crossings? Hardness of Plane Graph Rigidity Abel, Zachary et al. 2016
24 Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals Becker, Aaron T. et al. 2015
25 Algorithms for Designing Pop-Up Cards Abel, Zachary et al. 2013
26 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Demaine, Erik D. et al. 2013
27 Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM Cannon, Sarah et al. 2013
28 Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) Demaine, Erik D. et al. 2011
29 09511 Abstracts Collection -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
30 09511 Executive Summary -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
Current Page :
Number of result pages: 2
Number of documents: 34


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