Erik D. Demaine

	2012
390		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. ACM Transactions on Algorithms 8(2): 13 (2012)
389		Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 5(1): 148-157 (2012)
388		Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow: Two Hands Are Better Than One (up to constant factors) CoRR abs/1201.1650: (2012)
387		Greg Aloupis, Erik D. Demaine, Alan Guo: Classic Nintendo Games are (NP-)Hard CoRR abs/1203.1895: (2012)
386		Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles CoRR abs/1203.3602: (2012)
385		Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012)
384		Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers: Hinged Dissections Exist. Discrete & Computational Geometry 47(1): 150-186 (2012)
383		Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. Internet Mathematics 8(1-2): 29-45 (2012)
	2011
382		Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam: O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74
381		Zachary Abel, Erik D. Demaine, Martin L. Demaine: A Topologically Convex Vertex-Ununfoldable Polyhedron. CCCG 2011
380		Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara: Common Developments of Several Different Orthogonal Boxes. CCCG 2011
379		Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow: Convexifying Polygons Without Losing Visibilities. CCCG 2011
378		Zachary Abel, Erik D. Demaine: Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. CCCG 2011
377		Giovanni Viglietta, Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia: Edge-guarding Orthogonal Polyhedra. CCCG 2011
376		Sarah Eisenstat, Erik D. Demaine: Expansive Motions for d-Dimensional Open Chains. CCCG 2011
375		Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on Separating Words. DCFS 2011: 147-157
374		Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow: One-Dimensional Staged Self-assembly. DNA 2011: 100-114
373		Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes. ESA 2011: 689-700
372		Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz: Folding Equilateral Plane Graphs. ISAAC 2011: 574-583
371		Erik D. Demaine, André Schulz: Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA 2011: 1177-1187
370		Erik D. Demaine: Constructing Strings at the Nano Scale via Staged Self-assembly. SPIRE 2011: 1
369		Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers: Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). STACS 2011: 201-212
368		Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450
367		Takehiro Ito, Erik D. Demaine: Approximability of the Subset Sum Reconfiguration Problem. TAMC 2011: 58-69
366		Paul Christiano, Erik D. Demaine, Shaunak Kishore: Lossless Fault-Tolerant Data Structures with Additive Overhead. WADS 2011: 243-254
365		Erik D. Demaine, Sarah Eisenstat: Flattening Fixed-Angle Chains Is Strongly NP-Hard. WADS 2011: 314-325
364		Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011)
363		Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on separating words CoRR abs/1103.4513: (2011)
362		Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes CoRR abs/1106.5736: (2011)
361		Mirela Damian, Erik D. Demaine, Robin Y. Flatland: Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm CoRR abs/1112.4791: (2011)
360		Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke: Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? Comput. Geom. 44(2): 82-94 (2011)
359		Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son: Covering points by disjoint boxes with outliers. Comput. Geom. 44(3): 178-190 (2011)
358		Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno: Algorithmic Folding Complexity. Graphs and Combinatorics 27(3): 341-351 (2011)
357		Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra. Graphs and Combinatorics 27(3): 363-376 (2011)
356		Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi: (Non)Existence of Pleated Folds: How Paper Folds Between Creases. Graphs and Combinatorics 27(3): 377-397 (2011)
355		Kenneth C. Cheung, Erik D. Demaine, Jonathan Bachrach, Saul Griffith: Programmable Assembly With Universally Foldable Strings (Moteins). IEEE Transactions on Robotics 27(4): 718-729 (2011)
354		Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing Signed Permutations of Polygons. Int. J. Comput. Geometry Appl. 21(1): 87-100 (2011)
353		Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4): 485-501 (2011)
352		Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristan, Stefanie Wuhrer: Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011)
351		Byoungkwon An, Nadia Benbernou, Erik D. Demaine, Daniela Rus: Planning to fold multiple objects from a single self-folding sheet. Robotica 29(1): 87-102 (2011)
350		Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011)
	2010
349		Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any monotone boolean function can be realized by interlocked polygons. CCCG 2010: 139-142
348		Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit: Zipper unfoldings of polyhedral complexes. CCCG 2010: 219-222
347		David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. CCCG 2010: 63-66
346		Erik D. Demaine, Joseph O'Rourke: Open problem session. CCCG 2010: 83-86
345		Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102
344		Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens: Making Polygons by Simple Folds and One Straight Cut. CGGA 2010: 27-43
343		Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54
342		Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15
341		Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: UNO Is Hard, Even for a Single Player. FUN 2010: 133-144
340		Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36
339		Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian: Matching Points with Things. LATIN 2010: 456-467
338		Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, Peter Schmidt-Nielsen: Reconfigurable asynchronous logic automata: (RALA). POPL 2010: 1-6
337		Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott D. Kominers, Robert T. Schweller: Shape Replication through Self-Assembly and RNase Enzymes. SODA 2010: 1045-1064
336		Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro: Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA 2010: 1448-1456
335		Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344
334		Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton: Basic network creation games. SPAA 2010: 106-113
333		Erik D. Demaine, Morteza Zadimoghaddam: Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29
332		Erik D. Demaine, Morteza Zadimoghaddam: Minimizing the Diameter of a Network Using Shortcut Edges. SWAT 2010: 420-431
331		Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW 2010: 122-131
330		Erik D. Demaine: Algorithmic Graph Minors and Bidimensionality. WG 2010: 2
329		Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. Algorithmica 57(3): 462-483 (2010)
328		Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: The complexity of UNO CoRR abs/1003.2851: (2010)
327		Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers: Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract) CoRR abs/1004.4383: (2010)
326		Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-Convex Polygons CoRR abs/1007.3607: (2010)
325		Erik D. Demaine, Sándor P. Fekete, Robert J. Lang: Circle Packing for Origami Design Is Hard CoRR abs/1008.1224: (2010)
324		Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke: Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? CoRR abs/1009.5628: (2010)
323		Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. Combinatorica 30(5): 533-552 (2010)
322		Erik D. Demaine, Gregory N. Price: Generalized D-Forms Have No Spurious Creases. Discrete & Computational Geometry 43(1): 179-186 (2010)
321		Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote: Locked and Unlocked Chains of Planar Shapes. Discrete & Computational Geometry 44(2): 439-462 (2010)
320		Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Trans. Netw. 18(1): 216-228 (2010)
319		Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)
318		Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine: Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. International Journal of Shape Modeling 16(1-2): 151-171 (2010)
	2009
317		Robert A. Hearn, Erik D. Demaine: Games, puzzles and computation. A K Peters 2009: I-IX, 1-237
316		Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke: Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? CCCG 2009: 145-148
315		Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh: Relaxed Gabriel Graphs. CCCG 2009: 169-172
314		Erik D. Demaine, Joseph O'Rourke: Open Problems from CCCG 2008. CCCG 2009: 75-78
313		Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer: Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR 2009: 81-86
312		Erik D. Demaine: Algorithms Meet Art, Puzzles, and Magic. ESA 2009: 289
311		Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729
310		Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327
309		Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340
308		Erik D. Demaine, Gad M. Landau, Oren Weimann: On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353
307		James McLurkin, Erik D. Demaine: A Distributed boundary detection algorithm for multi-robot systems. IROS 2009: 4791-4798
306		Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang: Folding a Better Checkerboard. ISAAC 2009: 1074-1083
305		Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara: Algorithmic Folding Complexity. ISAAC 2009: 452-461
304		Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175
303		Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
302		Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182
301		Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312
300		Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine: Filling holes in triangular meshes by curve unfolding. Shape Modeling International 2009: 66-72
299		Erik D. Demaine: Algorithms Meet Art, Puzzles, and Magic. WADS 2009: 193
298		Takehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386
297		Daniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem. WADS 2009: 435-446
296		Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon: Minimal Locked Trees. WADS 2009: 61-73
295		Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE 2009: 125-136
294		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. ACM Transactions on Algorithms 5(3): (2009)
293		Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An optimal decomposition algorithm for tree edit distance. ACM Transactions on Algorithms 6(1): (2009)
292		Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica 54(2): 142-180 (2009)
291		Timothy G. Abbott, Erik D. Demaine, Blaise Gassend: A Generalized Carpenter's Rule Theorem for Self-Touching Linkages CoRR abs/0901.1322: (2009)
290		Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs CoRR abs/0902.1043: (2009)
289		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games CoRR abs/0902.1400: (2009)
288		Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra CoRR abs/0906.2461: (2009)
287		Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi: (Non)existence of Pleated Folds: How Paper Folds Between Creases CoRR abs/0906.4747: (2009)
286		Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristan, Stefanie Wuhrer: Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves CoRR abs/0908.2440: (2009)
285		Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions CoRR abs/0908.2493: (2009)
284		Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs CoRR abs/0909.3221: (2009)
283		Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Aviv Ovadya: A Universal Crease Pattern for Folding Orthogonal Shapes CoRR abs/0909.5388: (2009)
282		Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son: Covering Points by Disjoint Boxes with Outliers CoRR abs/0910.1643: (2009)
281		Timothy G. Abbott, Michael Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung: Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42(5): 419-428 (2009)
280		Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The distance geometry of music. Comput. Geom. 42(5): 429-454 (2009)
279		Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer: Linear reconfiguration of cube-style modular robots. Comput. Geom. 42(6-7): 652-663 (2009)
278		Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)
277		Hayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding Planar Polygons. Discrete & Computational Geometry 41(3): 444-460 (2009)
276		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2): 2 (2009)
	2008
275		Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34
274		Erik D. Demaine, Martin L. Demaine, Vi Hart: Computational Balloon Twisting: The Theory of Balloon Polyhedra. CCCG 2008
273		Erik D. Demaine, Robert A. Hearn: Constraint Logic: A Uniform Framework for Modeling Computation as Games. IEEE Conference on Computational Complexity 2008: 149-162
272		Jun-geun Park, Erik D. Demaine, Seth J. Teller: Moving-Baseline Localization. IPSN 2008: 15-26
271		Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39
270		Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán Adinolfi, Stefanie Wuhrer: Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. ISAAC 2008: 342-353
269		Erik D. Demaine: Algorithmic Graph Minors and Bidimensionality. IWPEC 2008: 9
268		Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. SWAT 2008: 160-172
267		Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers: Hinged dissections exist. Symposium on Computational Geometry 2008: 110-119
266		Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer: Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 2008: 433-447
265		Erik D. Demaine, MohammadTaghi Hajiaghayi: Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008
264		Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality. Encyclopedia of Algorithms 2008
263		Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos: Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Transactions on Algorithms 4(4): (2008)
262		Ilya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. Algorithmica 50(2): 255-278 (2008)
261		Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips: Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Algorithmica 50(2): 279-298 (2008)
260		Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
259		David Charlton, Erik D. Demaine, Martin L. Demaine, Gregory N. Price, Yaa-Lirng Tu: A Locked Orthogonal Tree CoRR abs/0801.4405: (2008)
258		Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine: Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues CoRR abs/0803.0316: (2008)
257		Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint: Cauchy's Arm Lemma on a Growing Sphere CoRR abs/0804.0986: (2008)
256		Daniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem CoRR abs/0812.5030: (2008)
255		Erik D. Demaine, MohammadTaghi Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1): 19-36 (2008)
254		Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008)
253		Erik D. Demaine, MohammadTaghi Hajiaghayi: The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008)
252		Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides: Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008)
251		Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4): 627-650 (2008)
250		Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine: Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. Natural Computing 7(3): 347-370 (2008)
249		Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008)
	2007
248		Erik D. Demaine, Joseph O'Rourke: Geometric folding algorithms - linkages, origami, polyhedra. Cambridge University Press 2007: I-XIII, 1-472
247		Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
246		Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth: Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG 2007: 13-16
245		Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint: Vertex Pops and Popturns. CCCG 2007: 137-140
244		Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian: On Rolling Cube Puzzles. CCCG 2007: 141-144
243		Erik D. Demaine, Joseph O'Rourke: Open Problems from CCCG 2006. CCCG 2007: 277-280
242		Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine: Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. DNA 2007: 1-14
241		Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157
240		Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer: Linear Reconfiguration of Cube-Style Modular Robots. ISAAC 2007: 208-219
239		Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Deflating the Pentagon. KyotoCGGT 2007: 56-67
238		Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298
237		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267
236		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287
235		Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54
234		Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007
233		Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007
232		Erik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
231		Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma: A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. WADS 2007: 163-174
230		Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76
229		Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2): (2007)
228		Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Music CoRR abs/0705.4085: (2007)
227		Gregory N. Price, Erik D. Demaine: Generalized D-Forms Have No Spurious Creases CoRR abs/0711.2605: (2007)
226		Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers: Hinged Dissections Exist CoRR abs/0712.2094: (2007)
225		Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game CoRR abs/cs/0703019: (2007)
224		Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic Ham-Sandwich Cuts. Discrete & Computational Geometry 37(3): 325-339 (2007)
223		MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami: Plane Embeddings of Planar Graph Metrics. Discrete & Computational Geometry 38(3): 615-637 (2007)
222		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007)
221		Sergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007)
220		Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro: An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. 36(6): 1672-1695 (2007)
219		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
218		Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2): 86-96 (2007)
	2006
217		Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Curves in the Sand: Algorithmic Drawing. CCCG 2006
216		Erik D. Demaine, Joseph O'Rourke: Open Problems: Open Problems from CCCG 2005. CCCG 2006
215		Erik D. Demaine: Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. CCCG 2006
214		Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint: Polygons Flip Finitely: Flaws and a Fix. CCCG 2006
213		Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: Voronoi game on graphs and its complexity. CIG 2006: 265-271
212		Erik D. Demaine: Origami, Linkages, and Polyhedra: Folding with Algorithms. ESA 2006: 1
211		David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian: Necklaces, Convolutions, and X + Y. ESA 2006: 160-171
210		Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130
209		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15
208		Ilya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. LATIN 2006: 142-153
207		Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). LATIN 2006: 349-361
206		Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92
205		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour: Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171
204		Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu: Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260
203		MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami: Plane embeddings of planar graph metrics. Symposium on Computational Geometry 2006: 197-206
202		Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote: Locked and unlocked chains of planar shapes. Symposium on Computational Geometry 2006: 61-70
201		Hayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding planar polygons. Symposium on Computational Geometry 2006: 71-79
200		Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica 44(2): 167-181 (2006)
199		Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote: Locked and Unlocked Chains of Planar Shapes CoRR abs/cs/0604022: (2006)
198		Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance CoRR abs/cs/0604037: (2006)
197		Ben Leong, Barbara Liskov, Erik D. Demaine: EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management. Computer Communications 29(9): 1243-1259 (2006)
196		Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006)
195		Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
194		Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006)
193		Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3): 172-187 (2006)
192		Erik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online searching with turn cost. Theor. Comput. Sci. 361(2-3): 342-355 (2006)
191		Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman: Morpion Solitaire. Theory Comput. Syst. 39(3): 439-453 (2006)
190		Erik D. Demaine, Martin L. Demaine: Puzzles, Art, and Magic with Algorithms. Theory Comput. Syst. 39(3): 473-481 (2006)
	2005
189		Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005
188		Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Deep Rhythms and Scales. CCCG 2005: 163-166
187		Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung: Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. CCCG 2005: 61-64
186		Erik D. Demaine, Stefan Langerman: Optimizing a 2D Function Satisfying Unimodality Properties. ESA 2005: 887-898
185		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646
184		Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller: Mobile-assisted localization in wireless sensor networks. INFOCOM 2005: 172-183
183		Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319
182		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601
181		Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos: Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA 2005: 650-659
180		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. SODA 2005: 682-689
179		Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips: Communication-Aware Processor Allocation for Supercomputers. WADS 2005: 169-181
178		Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine: Hinged Dissection of Polypolyhedra. WADS 2005: 205-217
177		Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. WADS 2005: 409-421
176		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Transactions on Algorithms 1(1): 33-47 (2005)
175		Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro: Fast allocation and deallocation with an improved buddy system. Acta Inf. 41(4-5): 273-291 (2005)
174		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Algorithmica 41(4): 245-267 (2005)
173		David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005)
172		Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model CoRR abs/cs/0502041: (2005)
171		Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality, Map Graphs, and Grid Minors CoRR abs/cs/0502070: (2005)
170		Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR abs/cs/0512081: (2005)
169		Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR abs/cs/0512091: (2005)
168		Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged dissection of polyominoes and polyforms. Comput. Geom. 31(3): 237-262 (2005)
167		David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discrete & Computational Geometry 33(4): 593-604 (2005)
166		Ilya Baran, Erik D. Demaine: Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve. Int. J. Comput. Geometry Appl. 15(4): 327-350 (2005)
165		Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating Point Sets in Polygonal Environments. Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005)
164		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005)
163		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005)
162		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia: Optimal Covering Tours with Turn Costs. SIAM J. Comput. 35(3): 531-566 (2005)
161		Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia: Games on triangulations. Theor. Comput. Sci. 343(1-2): 42-71 (2005)
160		Robert A. Hearn, Erik D. Demaine: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2): 72-96 (2005)
	2004
159		Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63
158		Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke: Continuous foldability of polygonal paper. CCCG 2004: 64-67
157		Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004
156		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. FOCS 2004: 484-490
155		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004: 517-533
154		Erik D. Demaine: Puzzles, Art, and Magic with Algorithms. ISAAC 2004: 1
153		Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
152		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
151		Mihai Badoiu, Erik D. Demaine: A Simplified, Dynamic Unified Structure. LATIN 2004: 466-473
150		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203
149		Mihai Patrascu, Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004: 20-29
148		Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. SODA 2004: 281-290
147		Erik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
146		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. SODA 2004: 830-839
145		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849
144		Lukasz Golab, David DeHaan, Alejandro López-Ortiz, Erik D. Demaine: Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. SSDBM 2004: 425-426
143		Mihai Patrascu, Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004: 546-553
142		Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
141		Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16
140		Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien: An energy-driven approach to linkage unfolding. Symposium on Computational Geometry 2004: 134-143
139		Ilya Baran, Erik D. Demaine: Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. Symposium on Computational Geometry 2004: 220-229
138		Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329
137		Erik D. Demaine, Mohammad Taghi Hajiaghayi: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004)
136		Erik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online Searching with Turn Cost CoRR cs.DS/0406045: (2004)
135		Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips: Communication-Aware Processor Allocation for Supercomputers CoRR cs.DS/0407058: (2004)
134		Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR cs.DS/0410048: (2004)
133		Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
132		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena: When can you fold a map? Comput. Geom. 29(1): 23-46 (2004)
131		Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004)
130		Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight bounds on maximal and maximum matchings. Discrete Mathematics 285(1-3): 7-15 (2004)
129		Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell: Tetris is hard, even to approximate. Int. J. Comput. Geometry Appl. 14(1-2): 41-68 (2004)
128		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004)
127		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. SIAM J. Discrete Math. 18(3): 501-511 (2004)
126		Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Theor. Comput. Sci. 303(3): 325-338 (2004)
125		Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski: Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 539-543 (2004)
124		Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar: Finding hidden independent sets in interval graphs. Theor. Comput. Sci. 310(1-3): 287-307 (2004)
	2003
123		Erik D. Demaine: Open Problems from ALENEX 2003. ALENEX 2003
122		Erik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
121		Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
120		Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar: Finding Hidden Independent Sets in Interval Graphs. COCOON 2003: 182-191
119		Erik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate. COCOON 2003: 351-363
118		Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper: Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA 2003: 90-101
117		Sergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003: 283-294
116		Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP 2003: 829-844
115		Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404
114		Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Identifying frequent items in sliding windows over on-line packet streams. Internet Measurement Comference 2003: 173-178
113		Erik D. Demaine, Nicole Immorlica: Correlation Clustering with Partial Information. RANDOM-APPROX 2003: 1-13
112		Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller: Anchor-free distributed localization in sensor networks. SenSys 2003: 340-341
111		David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461
110		Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi Jaakkola: K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. Bioinformatics 19(9): 1070-1078 (2003)
109		Ilya Baran, Erik D. Demaine: Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve CoRR cs.CG/0307005: (2003)
108		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia: Optimal Covering Tours with Turn Costs CoRR cs.DS/0309014: (2003)
107		Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003)
106		Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss: Long proteins with unique optimal foldings in the H-P model. Comput. Geom. 25(1-2): 139-159 (2003)
105		Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke: Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003)
104		Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open and closed linkages with few joints. Comput. Geom. 26(1): 37-45 (2003)
103		Robert Connelly, Erik D. Demaine, Günter Rote: Blowing Up Polygonal Linkages. Discrete & Computational Geometry 30(2): 205-239 (2003)
102		Erik D. Demaine, Alejandro López-Ortiz: A linear lower bound on index size for text retrieval. J. Algorithms 48(1): 2-15 (2003)
101		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: On universally easy classes for NP-complete problems. Theor. Comput. Sci. 1-3(304): 471-476 (2003)
100		Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar: Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003)
	2002
99		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX 2002: 67-80
98		Erik D. Demaine, Joseph O'Rourke: Open problems from cccg 2001. CCCG 2002
97		Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. CCCG 2002: 1-4
96		Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang: Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108
95		Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30
94		Erik D. Demaine, Robert A. Hearn, Michael Hoffmann: Push-2-f is pspace-complete. CCCG 2002: 31-35
93		Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing signed permutations of polygons. CCCG 2002: 68-71
92		Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Computers and Games 2002: 188-200
91		Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton: Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151
90		Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito: Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164
89		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173
88		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002: 348-360
87		Robert A. Hearn, Erik D. Demaine: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002: 401-413
86		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. ISAAC 2002: 262-273
85		Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint: Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380
84		Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia: Playing with Triangulations. JCDCG 2002: 22-37
83		Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro: Cache-oblivious priority queue and graph algorithm applications. STOC 2002: 268-276
82		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Robot Localization without Depth Perception. SWAT 2002: 249-259
81		Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198
80		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-unfoldings of simplicial manifolds. Symposium on Computational Geometry 2002: 237-243
79		Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi Jaakkola, Nathan Srebro: K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. WABI 2002: 506-520
78		Robert A. Hearn, Erik D. Demaine: PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation CoRR cs.CC/0205005: (2002)
77		Erik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate CoRR cs.CC/0210020: (2002)
76		Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, Michael A. Soss: Long Proteins with Unique Optimal Foldings in the H-P Model CoRR cs.CG/0201018: (2002)
75		Erik D. Demaine, Joseph O'Rourke: Open Problems from CCCG 2002 CoRR cs.CG/0212050: (2002)
74		Erik D. Demaine, Martin L. Demaine, Helena A. Verrill: Coin-Moving Puzzles CoRR cs.DM/0204002: (2002)
73		Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber CoRR cs.DM/0204017: (2002)
72		Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup: Efficient Tree Layout in a Multilevel Memory Hierarchy CoRR cs.DS/0211010: (2002)
71		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: A note on reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics 117(1-3): 293-297 (2002)
70		Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-colorings. Discrete Mathematics 254(1-3): 19-32 (2002)
69		Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke: Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs and Combinatorics 18(1): 93-104 (2002)
68		Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro: Online Routing in Convex Subdivisions. Int. J. Comput. Geometry Appl. 12(4): 283-296 (2002)
	2001
67		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX 2001: 91-104
66		Erik D. Demaine, Joseph O'Rourke: Open problems from cccg 2000. CCCG 2001: 185-187
65		Erik D. Demaine, Michael Hoffmann: Pushing blocks is np-complete for noncrossing solution paths. CCCG 2001: 65-68
64		Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Short interlocked linkages. CCCG 2001: 69-72
63		Erik D. Demaine, Joseph S. B. Mitchell: Reaching folded states of a rectangular piece of paper. CCCG 2001: 73-75
62		Erik D. Demaine, Martin L. Demaine, Anna Lubiw: The cccg 2001 logo. CCCG 2001
61		Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319
60		Erik D. Demaine: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. MFCS 2001: 18-32
59		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia: Optimal covering tours with turn costs. SODA 2001: 138-147
58		Erik D. Demaine, Alejandro López-Ortiz: A linear lower bound on index size for text retrieval. SODA 2001: 289-294
57		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: On universally easy classes for NP-complete problems. SODA 2001: 910-911
56		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena: When Can You Fold a Map? WADS 2001: 401-413
55		Erik D. Demaine: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory CoRR cs.CC/0106019: (2001)
54		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro: The Complexity of Clickomania CoRR cs.CC/0107031: (2001)
53		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Polyhedra CoRR cs.CG/0107023: (2001)
52		Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke: Enumerating Foldings and Unfoldings between Polygons and Polytopes CoRR cs.CG/0107024: (2001)
51		Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Manifolds CoRR cs.CG/0110054: (2001)
50		Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan: Polygons cuttable by a circular saw. Comput. Geom. 20(1-2): 69-84 (2001)
49		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001)
48		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete & Computational Geometry 26(3): 269-281 (2001)
47		Erik D. Demaine, Ian T. Foster, Carl Kesselman, Marc Snir: Generalized Communicators in the Message Passing Interface. IEEE Trans. Parallel Distrib. Syst. 12(6): 610-616 (2001)
46		Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001)
	2000
45		Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan: Polygons Cuttable by a Circular Saw. CCCG 2000
44		Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke: PushPush and Push-1 are NP-hard in 2D. CCCG 2000
43		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000
42		Erik D. Demaine, Joseph O'Rourke: Session O1: Open Problems and Planning. CCCG 2000
41		Robert Connelly, Erik D. Demaine, Günter Rote: Every Polygon Can Be Untangled. EuroCG 2000: 62-65
40		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. FOCS 2000: 399-409
39		Robert Connelly, Erik D. Demaine, Günter Rote: Straighting Polygonal Arcs and Convexifying Polygonal Cycles. FOCS 2000: 432-442
38		Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz: Online Routing in Convex Subdivisions. ISAAC 2000: 47-59
37		Erik D. Demaine: Folding and Unfolding Linkages, Paper, and Polyhedra. JCDCG 2000: 113-124
36		Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-Colorings. MFCS 2000: 202-211
35		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Adaptive set intersections, unions, and differences. SODA 2000: 743-752
34		Erik D. Demaine, Martin L. Demaine, David Eppstein: Phutball Endgames are Hard CoRR cs.CC/0008025: (2000)
33		Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke: PushPush is NP-hard in 2D CoRR cs.CG/0001019: (2000)
32		Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke: Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes CoRR cs.CG/0007019: (2000)
31		Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke: PushPush and Push-1 are NP-hard in 2D CoRR cs.CG/0007021: (2000)
30		Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint: Flipturning polygons CoRR cs.CG/0008010: (2000)
29		Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena: When Can You Fold a Map? CoRR cs.CG/0011026: (2000)
28		Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell: Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. 16(1): 3-21 (2000)
27		Erik D. Demaine, Joseph O'Rourke: Computational Geometry Column 37. Int. J. Comput. Geometry Appl. 10(1): 103-107 (2000)
	1999
26		Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman: Hinged dissections of polyominoes and polyforms. CCCG 1999
25		Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo: Ununfoldable polyhedra. CCCG 1999
24		Erik D. Demaine, J. Ian Munro: Fast Allocation and Deallocation with an Improved Buddy System. FSTTCS 1999: 84-96
23		Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss: Convexifying Monotone Polygons. ISAAC 1999: 415-424
22		Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139
21		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867
20		Erik D. Demaine, Martin L. Demaine, Anna Lubiw: Folding and One Straight Cut Suffice. SODA 1999: 891-892
19		Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell: Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. Symposium on Computational Geometry 1999: 105-114
18		Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko: Metamorphosis of the Cube. Symposium on Computational Geometry 1999: 409-410
17		David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman: Representing Trees of Higer Degree. WADS 1999: 169-180
16		Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick: Resizable Arrays in Optimal Time and Space. WADS 1999: 37-48
15		Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged Dissection of Polyominoes and Polyforms CoRR cs.CG/9907018: (1999)
14		Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable Polyhedra with Convex Faces CoRR cs.CG/9908003: (1999)
13		Erik D. Demaine, Joseph O'Rourke: Computational Geometry Column 37 CoRR cs.CG/9908007: (1999)
12		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D CoRR cs.CG/9910009: (1999)
11		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On Reconfiguring Tree Linkages: Trees can Lock CoRR cs.CG/9910024: (1999)
10		Erik D. Demaine, Joseph O'Rourke: Computational geometry column 37. SIGACT News 30(3): 39-42 (1999)
	1998
9		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons. CCCG 1998
8		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On reconfiguring tree linkages: Trees can lock. CCCG 1998
7		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides: Unfolding some classes of orthogonal polyhedra. CCCG 1998
6		Erik D. Demaine, Martin L. Demaine: Planar Drawings of Origami Polyhedra. Graph Drawing 1998: 438-440
5		Erik D. Demaine: Protocols for Non-Deterministic Communication over Synchronous Channels. IPPS/SPDP 1998: 24-30
4		Erik D. Demaine, Martin L. Demaine, Anna Lubiw: Folding and Cutting Paper. JCDCG 1998: 104-118
3		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D CoRR cs.CG/9811019: (1998)
2		Erik D. Demaine: C to Java: Converting Pointers into References. Concurrency - Practice and Experience 10(11-13): 851-861 (1998)
	1996
1		Erik D. Demaine, Sampalli Srinivas: A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks. International Journal of High Speed Computing 8(1): 81-92 (1996)