No. Title Author Year
1 Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines Ani, Joshua et al. 2023
2 Complexity of Reconfiguration in Surface Chemical Reaction Networks Alaniz, Robert M. et al. 2023
3 Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares A. Akitaya, Hugo et al. 2022
4 Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles Chung, Lily et al. 2022
5 Hardness of Token Swapping on Trees Aichholzer, Oswin et al. 2022
6 Lower Bounds on Retroactive Data Structures Chung, Lily et al. 2022
7 Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude Ani, Joshua et al. 2022
8 Rolling Polyhedra on Tessellations Baes, Akira et al. 2022
9 Algorithmic Combinatorial Game Theory (Dagstuhl Seminar 02081) Demaine, Erik D. et al. 2021
10 Characterizing Universal Reconfigurability of Modular Pivoting Robots A. Akitaya, Hugo et al. 2021
11 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete Brunner, Josh et al. 2020
12 Arithmetic Expression Construction Alcock, Leo et al. 2020
13 Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard Brunner, Josh et al. 2020
14 Finding Closed Quasigeodesics on Convex Polyhedra Demaine, Erik D. et al. 2020
15 Recursed Is Not Recursive: A Jarring Result Demaine, Erik D. et al. 2020
16 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
17 Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard Demaine, Erik D. et al. 2020
18 Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets Ani, Joshua et al. 2020
19 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
20 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
21 Computational Complexity of Generalized Push Fight Bosboom, Jeffrey et al. 2018
22 Computational Complexity of Motion Planning of a Robot through Simple Gadgets Demaine, Erik D. et al. 2018
23 Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Demaine, Erik D. et al. 2018
24 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
25 Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures Chen, Lijie et al. 2018
26 Solving the Rubik's Cube Optimally is NP-complete Demaine, Erik D. et al. 2018
27 The Computational Complexity of Portal and Other 3D Video Games Demaine, Erik D. et al. 2018
28 Tree-Residue Vertex-Breaking: a new tool for proving hardness Demaine, Erik D. et al. 2018
29 Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Abel, Zachary et al. 2018
30 Origamizer: A Practical Algorithm for Folding Any Polyhedron Demaine, Erik D. et al. 2017
31 Front Matter, Table of Contents, Preface, Conference Organization Demaine, Erik D. et al. 2016
32 LIPIcs, Volume 49, FUN'16, Complete Volume Demaine, Erik D. et al. 2016
33 Super Mario Bros. is Harder/Easier Than We Thought Demaine, Erik D. et al. 2016
34 The Complexity of Hex and the Jordan Curve Theorem Adler, Aviv et al. 2016
35 The Fewest Clues Problem Demaine, Erik D. et al. 2016
36 Who Needs Crossings? Hardness of Plane Graph Rigidity Abel, Zachary et al. 2016
37 Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals Becker, Aaron T. et al. 2015
38 Algorithms for Designing Pop-Up Cards Abel, Zachary et al. 2013
39 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Demaine, Erik D. et al. 2013
40 Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM Cannon, Sarah et al. 2013
41 Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) Demaine, Erik D. et al. 2011
42 09511 Abstracts Collection -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
43 09511 Executive Summary -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
44 09511 Open Problems -- Parameterized complexity and approximation algorithms Demaine, Erik D. et al. 2010
45 10091 Abstracts Collection -- Data Structures Arge, Lars et al. 2010
46 A Pseudopolynomial Algorithm for Alexandrov's Theorem Kane, Daniel et al. 2009
47 Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs Borradaile, Glencora et al. 2009
48 The Price of Anarchy in Cooperative Network Creation Games Demaine, Erik D. et al. 2009
49 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Demaine, Erik et al. 2007
50 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs Demaine, Erik et al. 2007
51 04301 Abstracts Collection -- Cache-Oblivious and Cache-Aware Algorithms Arge, Lars et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 51


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