| No. |
Title |
Author |
Year |
| 1 |
Algorithms for Designing Pop-Up Cards |
Abel, Zachary et al. |
2013 |
| 2 |
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM |
Cannon, Sarah et al. |
2013 |
| 3 |
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) |
Demaine, Erik D. et al. |
2011 |
| 4 |
09511 Abstracts Collection -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 5 |
09511 Executive Summary -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 6 |
09511 Open Problems -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 7 |
10091 Abstracts Collection -- Data Structures |
Arge, Lars et al. |
2010 |
| 8 |
A Pseudopolynomial Algorithm for Alexandrov's Theorem |
Kane, Daniel et al. |
2009 |
| 9 |
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs |
Borradaile, Glencora et al. |
2009 |
| 10 |
The Price of Anarchy in Cooperative Network Creation Games |
Demaine, Erik D. et al. |
2009 |
