The following pages link to Erik D. Demaine (Q223972):
Displaying 50 items.
- Continuous Flattening of Orthogonal Polyhedra (Q2958089) (← links)
- Bust-a-Move/Puzzle Bobble Is NP-complete (Q2958090) (← links)
- Box Pleating is Hard (Q2958099) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- Rigid Origami Vertices: Conditions and Forcing Sets (Q2970449) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- (Q3024760) (← links)
- (Q3024774) (← links)
- Robot Localization without Depth Perception (Q3046498) (← links)
- Coverage with k-Transmitters in the Presence of Obstacles (Q3066439) (← links)
- Constant Price of Anarchy in Network Creation Games via Public Service Advertising (Q3067511) (← links)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (Q3079494) (← links)
- Finding Hidden Independent Sets in Interval Graphs (Q3082926) (← links)
- Tetris is Hard, Even to Approximate (Q3082942) (← links)
- O(1)-Approximations for Maximum Movement Problems (Q3088082) (← links)
- Algorithms for Solving Rubik’s Cubes (Q3092271) (← links)
- One-Dimensional Staged Self-assembly (Q3092336) (← links)
- Making Polygons by Simple Folds and One Straight Cut (Q3098066) (← links)
- Common Unfoldings of Polyominoes and Polycubes (Q3098067) (← links)
- Folding Equilateral Plane Graphs (Q3104659) (← links)
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) (Q3113684) (← links)
- Who Needs Crossings? Hardness of Plane Graph Rigidity (Q3132834) (← links)
- Minimal Locked Trees (Q3183441) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem (Q3183474) (← links)
- Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms (Q3186588) (← links)
- The price of anarchy in network creation games (Q3189054) (← links)
- (Q3295674) (← links)
- (Q3295681) (← links)
- (Q3295683) (← links)
- The Computational Complexity of Portal and Other 3D Video Games (Q3301006) (← links)
- Solving the Rubik's Cube Optimally is NP-complete (Q3304120) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q3305721) (← links)
- Computational complexity of generalized Push Fight (Q3305729) (← links)
- Computational complexity of motion planning of a robot through simple gadgets (Q3305736) (← links)
- Strings-and-Coins and Nimstring are PSPACE-complete (Q3390719) (← links)
- Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040) (← links)
- (Q3395518) (← links)
- The Bidimensional Theory of Bounded-Genus Graphs (Q3440261) (← links)
- (Q3445222) (← links)
- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing (Q3449823) (← links)
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing (Q3449825) (← links)
- Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs (Q3455210) (← links)
- FOLDING EQUILATERAL PLANE GRAPHS (Q3459355) (← links)
- CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION (Q3459361) (← links)
- Algorithmic Graph Minors and Bidimensionality (Q3503573) (← links)
- Confluently Persistent Tries for Efficient Version Control (Q3512456) (← links)
- (Q3514523) (← links)
