No. Title Author Year
1 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
2 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
3 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
4 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
5 Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Demaine, Erik D. et al. 2018
6 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
7 Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures Chen, Lijie et al. 2018
8 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
9 The Computational Complexity of Portal and Other 3D Video Games Demaine, Erik D. et al. 2018
10 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
Current Page :
Number of result pages: 3
Number of documents: 29


DROPS-Home | Imprint | Privacy Published by LZI