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


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