Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Erik D. Demaine
2010 – today
- 2013
[j122]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: Non-crossing matchings of points with geometric objects. Comput. Geom. 46(1): 78-92 (2013)- [j121]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. Comput. Geom. 46(2): 148-153 (2013)
- [j120]Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer: Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8): 917-928 (2013)
- [j119]Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke: Refold rigidity of convex polyhedra. Comput. Geom. 46(8): 979-989 (2013)
- [j118]Steve Butler, Erik D. Demaine, Ronald L. Graham, Tomohiro Tachi: Constructing Points through Folding and Intersection. Int. J. Comput. Geometry Appl. 23(1): 49-64 (2013)
- [j117]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. J. Comb. Optim. 25(1): 19-46 (2013)
- [j116]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. J. Comb. Optim. 25(2): 208-233 (2013)
- [j115]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl: Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. JIP 21(3): 368-377 (2013)
- [j114]Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow: One-dimensional staged self-assembly. Natural Computing 12(2): 247-258 (2013)
- [j113]Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. J. Scheduling 16(2): 151-160 (2013)
- [j112]Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton: Basic Network Creation Games. SIAM J. Discrete Math. 27(2): 656-668 (2013)
- [c222]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara: Variations on Instant Insanity. Space-Efficient Data Structures, Streams, and Algorithms 2013: 33-47
- [c221]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. ICALP (1) 2013: 388-399
- [c220]Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods: The Two-Handed Tile Assembly Model Is Not Intrinsically Universal. ICALP (1) 2013: 400-412
- [c219]Erik D. Demaine, Morteza Zadimoghaddam: Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". SODA 2013: 1369-1379
- [c218]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): Self-Assembly In The 2HAM vs. aTAM. STACS 2013: 172-184
- [c217]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow: Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280
- [c216]
- [i71]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. CoRR abs/1304.7604 (2013)
- [i70]Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods: The two-handed tile assembly model is not intrinsically universal. CoRR abs/1306.6710 (2013)
- [i69]Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports 3(3): 51-74 (2013)
- 2012
- [j111]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 5(1): 148-157 (2012)
- [j110]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012)
- [j109]Takehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics 160(15): 2199-2207 (2012)
- [j108]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)
- [j107]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. Int. J. Comput. Geometry Appl. 22(3): 207-214 (2012)
- [j106]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)
- [j105]Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: NP-completeness of generalized Kaboozle. JIP 20(3): 713-718 (2012)
- [j104]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)
- [c215]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles. FUN 2012: 81-93
- [c214]
- [i68]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)
- [i67]Greg Aloupis, Erik D. Demaine, Alan Guo: Classic Nintendo Games are (NP-)Hard. CoRR abs/1203.1895 (2012)
- [i66]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)
- [i65]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. CoRR abs/1205.6960 (2012)
- [i64]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods: One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece. CoRR abs/1212.4756 (2012)
- [i63]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian: Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012)
- 2011
- [j103]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)
- [j102]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)
- [j101]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)
- [j100]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)
- [j99]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)
- [j98]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)
- [j97]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)
- [j96]Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4): 485-501 (2011)
- [j95]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)
- [j94]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)
- [j93]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)
- [j92]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)
- [c213]Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam: O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74
- [c212]Zachary Abel, Erik D. Demaine: Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. CCCG 2011
- [c211]Zachary Abel, Erik D. Demaine, Martin L. Demaine: A Topologically Convex Vertex-Ununfoldable Polyhedron. CCCG 2011
- [c210]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara: Common Developments of Several Different Orthogonal Boxes. CCCG 2011
- [c209]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
- [c208]
- [c207]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
- [c206]Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on Separating Words. DCFS 2011: 147-157
- [c205]Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow: One-Dimensional Staged Self-assembly. DNA 2011: 100-114
- [c204]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes. ESA 2011: 689-700
- [c203]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
- [c202]Erik D. Demaine, Anna Lubiw: A Generalization of the Source Unfolding of Convex Polyhedra. EGC 2011: 185-199
- [c201]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Meshes Preserving Minimum Feature Size. EGC 2011: 258-273
- [c200]Erik D. Demaine, André Schulz: Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA 2011: 1177-1187
- [c199]
- [c198]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
- [c197]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450
- [c196]Takehiro Ito, Erik D. Demaine: Approximability of the Subset Sum Reconfiguration Problem. TAMC 2011: 58-69
- [c195]Paul Christiano, Erik D. Demaine, Shaunak Kishore: Lossless Fault-Tolerant Data Structures with Additive Overhead. WADS 2011: 243-254
- [c194]Erik D. Demaine, Sarah Eisenstat: Flattening Fixed-Angle Chains Is Strongly NP-Hard. WADS 2011: 314-325
- [i62]Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson: Remarks on separating words. CoRR abs/1103.4513 (2011)
- [i61]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes. CoRR abs/1106.5736 (2011)
- [i60]Mirela Damian, Erik D. Demaine, Robin Y. Flatland: Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. CoRR abs/1112.4791 (2011)
- 2010
- [j91]Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. Algorithmica 57(3): 462-483 (2010)
- [j90]Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. Combinatorica 30(5): 533-552 (2010)
- [j89]Erik D. Demaine, Gregory N. Price: Generalized D-Forms Have No Spurious Creases. Discrete & Computational Geometry 43(1): 179-186 (2010)
- [j88]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)
- [j87]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)
- [j86]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)
- [j85]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)
- [c193]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. CCCG 2010: 63-66
- [c192]
- [c191]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
- [c190]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any monotone boolean function can be realized by interlocked polygons. CCCG 2010: 139-142
- [c189]Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit: Zipper unfoldings of polyhedral complexes. CCCG 2010: 219-222
- [c188]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
- [c187]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
- [c186]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
- [c185]Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36
- [c184]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: UNO Is Hard, Even for a Single Player. FUN 2010: 133-144
- [c183]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
- [c182]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
- [c181]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344
- [c180]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
- [c179]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
- [c178]Erik D. Demaine, Morteza Zadimoghaddam: Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29
- [c177]Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton: Basic network creation games. SPAA 2010: 106-113
- [c176]Erik D. Demaine, Morteza Zadimoghaddam: Minimizing the Diameter of a Network Using Shortcut Edges. SWAT 2010: 420-431
- [c175]Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW 2010: 122-131
- [c174]
- [i59]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: The complexity of UNO. CoRR abs/1003.2851 (2010)
- [i58]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)
- [i57]Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-Convex Polygons. CoRR abs/1007.3607 (2010)
- [i56]Erik D. Demaine, Sándor P. Fekete, Robert J. Lang: Circle Packing for Origami Design Is Hard. CoRR abs/1008.1224 (2010)
- [i55]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)
2000 – 2009
- 2009
- [b2]Robert A. Hearn, Erik D. Demaine: Games, puzzles and computation. A K Peters 2009, ISBN 978-1-56881-322-6, pp. I-IX, 1-237
- [j84]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)
- [j83]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)
- [j82]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)
- [j81]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)
- [j80]Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)
- [j79]Hayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding Planar Polygons. Discrete & Computational Geometry 41(3): 444-460 (2009)
- [j78]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)
- [j77]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)
- [j76]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An optimal decomposition algorithm for tree edit distance. ACM Transactions on Algorithms 6(1) (2009)
- [c173]
- [c172]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
- [c171]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh: Relaxed Gabriel Graphs. CCCG 2009: 169-172
- [c170]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
- [c169]
- [c168]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729
- [c167]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327
- [c166]Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340
- [c165]Erik D. Demaine, Gad M. Landau, Oren Weimann: On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353
- [c164]James McLurkin, Erik D. Demaine: A Distributed boundary detection algorithm for multi-robot systems. IROS 2009: 4791-4798
- [c163]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara: Algorithmic Folding Complexity. ISAAC 2009: 452-461
- [c162]Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang: Folding a Better Checkerboard. ISAAC 2009: 1074-1083
- [c161]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
- [c160]Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
- [c159]Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175
- [c158]Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182
- [c157]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312
- [c156]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
- [c155]
- [c154]Takehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386
- [c153]Daniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem. WADS 2009: 435-446
- [c152]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
- [i54]Timothy G. Abbott, Erik D. Demaine, Blaise Gassend: A Generalized Carpenter's Rule Theorem for Self-Touching Linkages. CoRR abs/0901.1322 (2009)
- [i53]Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. CoRR abs/0902.1043 (2009)
- [i52]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. CoRR abs/0902.1400 (2009)
- [i51]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)
- [i50]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)
- [i49]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)
- [i48]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009)
- [i47]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)
- [i46]Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Aviv Ovadya: A Universal Crease Pattern for Folding Orthogonal Shapes. CoRR abs/0909.5388 (2009)
- [i45]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)
- 2008
- [j75]Ilya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. Algorithmica 50(2): 255-278 (2008)
- [j74]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)
- [j73]Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
- [j72]Erik D. Demaine, MohammadTaghi Hajiaghayi: The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008)
- [j71]Erik D. Demaine, MohammadTaghi Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1): 19-36 (2008)
- [j70]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)
- [j69]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)
- [j68]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)
- [j67]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)
- [j66]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)
- [j65]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)
- [c151]Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34
- [c150]Erik D. Demaine, Martin L. Demaine, Vi Hart: Computational Balloon Twisting: The Theory of Balloon Polyhedra. CCCG 2008
- [c149]Erik D. Demaine, Robert A. Hearn: Constraint Logic: A Uniform Framework for Modeling Computation as Games. IEEE Conference on Computational Complexity 2008: 149-162
- [c148]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
- [c147]
- [c146]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
- [c145]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
- [c144]
- [c143]Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. SWAT 2008: 160-172
- [c142]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
- [r2]Erik D. Demaine, MohammadTaghi Hajiaghayi: Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008
- [r1]
- [i44]David Charlton, Erik D. Demaine, Martin L. Demaine, Gregory N. Price, Yaa-Lirng Tu: A Locked Orthogonal Tree. CoRR abs/0801.4405 (2008)
- [i43]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)
- [i42]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)
- [i41]Daniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem. CoRR abs/0812.5030 (2008)
- 2007
- [b1]Erik D. Demaine, Joseph O'Rourke: Geometric folding algorithms - linkages, origami, polyhedra. Cambridge University Press 2007, pp. I-XIII, 1-472
- [j64]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)
- [j63]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami: Plane Embeddings of Planar Graph Metrics. Discrete & Computational Geometry 38(3): 615-637 (2007)
- [j62]Erik D. Demaine, Mohammad Taghi Hajiaghayi: Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007)
- [j61]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)
- [j60]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)
- [j59]Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
- [j58]Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2) (2007)
- [j57]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)
- [c141]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
- [c140]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
- [c139]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
- [c138]
- [c137]Erik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
- [c136]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
- [c135]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
- [c134]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
- [c133]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157
- [c132]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
- [c131]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
- [c130]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298
- [c129]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267
- [c128]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287
- [c127]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
- [c126]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
- [c125]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
- [e2]Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege (Eds.): Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007. Dagstuhl Seminar Proceedings 07281, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [i40]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)
- [i39]Gregory N. Price, Erik D. Demaine: Generalized D-Forms Have No Spurious Creases. CoRR abs/0711.2605 (2007)
- [i38]Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers: Hinged Dissections Exist. CoRR abs/0712.2094 (2007)
- [i37]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)
- 2006
- [j56]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica 44(2): 167-181 (2006)
- [j55]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)
- [j54]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006)
- [j53]Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman: Morpion Solitaire. Theory Comput. Syst. 39(3): 439-453 (2006)
- [j52]Erik D. Demaine, Martin L. Demaine: Puzzles, Art, and Magic with Algorithms. Theory Comput. Syst. 39(3): 473-481 (2006)
- [j51]Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
- [j50]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006)
- [j49]Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3): 172-187 (2006)
- [j48]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online searching with turn cost. Theor. Comput. Sci. 361(2-3): 342-355 (2006)
- [c124]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
- [c123]
- [c122]Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint: Polygons Flip Finitely: Flaws and a Fix. CCCG 2006
- [c121]
- [c120]Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: Voronoi game on graphs and its complexity. CIG 2006: 265-271
- [c119]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
- [c118]Hayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding planar polygons. Symposium on Computational Geometry 2006: 71-79
- [c117]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami: Plane embeddings of planar graph metrics. Symposium on Computational Geometry 2006: 197-206
- [c116]
- [c115]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
- [c114]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
- [c113]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130
- [c112]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
- [c111]Ilya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. LATIN 2006: 142-153
- [c110]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
- [c109]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
- [c108]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
- [i36]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)
- [i35]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006)
- 2005
- [j47]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)
- [j46]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)
- [j45]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)
- [j44]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)
- [j43]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)
- [j42]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)
- [j41]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)
- [j40]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)
- [j39]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005)
- [j38]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)
- [j37]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)
- [j36]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)
- [j35]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)
- [c107]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
- [c106]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
- [c105]Erik D. Demaine, Stefan Langerman: Optimizing a 2D Function Satisfying Unimodality Properties. ESA 2005: 887-898
- [c104]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646
- [c103]Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller: Mobile-assisted localization in wireless sensor networks. INFOCOM 2005: 172-183
- [c102]Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319
- [c101]Erik D. Demaine, Mohammad Taghi Hajiaghayi: Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601
- [c100]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
- [c99]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
- [c98]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
- [c97]Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine: Hinged Dissection of Polypolyhedra. WADS 2005: 205-217
- [c96]
- [e1]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005
- [i34]Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. CoRR abs/cs/0502041 (2005)
- [i33]Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality, Map Graphs, and Grid Minors. CoRR abs/cs/0502070 (2005)
- [i32]Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus. CoRR abs/cs/0512081 (2005)
- [i31]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)
- 2004
- [j34]Erik D. Demaine, Mohammad Taghi Hajiaghayi: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004)
- [j33]Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
- [j32]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)
- [j31]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)
- [j30]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)
- [j29]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)
- [j28]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)
- [j27]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)
- [j26]Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Theor. Comput. Sci. 303(3): 325-338 (2004)
- [j25]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)
- [j24]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)
- [c95]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63
- [c94]Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke: Continuous foldability of polygonal paper. CCCG 2004: 64-67
- [c93]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
- [c92]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
- [c91]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
- [c90]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
- [c89]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329
- [c88]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
- [c87]Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. FOCS 2004: 484-490
- [c86]Erik D. Demaine, Mohammad Taghi Hajiaghayi: Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004: 517-533
- [c85]
- [c84]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
- [c83]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
- [c82]
- [c81]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203
- [c80]
- [c79]
- [c78]Erik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
- [c77]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
- [c76]Erik D. Demaine, Mohammad Taghi Hajiaghayi: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849
- [c75]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
- [c74]
- [i30]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online Searching with Turn Cost. CoRR cs.DS/0406045 (2004)
- [i29]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)
- [i28]Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy. CoRR cs.DS/0410048 (2004)
- 2003
- [j23]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)
- [j22]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)
- [j21]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)
- [j20]Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke: Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003)
- [j19]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)
- [j18]Robert Connelly, Erik D. Demaine, Günter Rote: Blowing Up Polygonal Linkages. Discrete & Computational Geometry 30(2): 205-239 (2003)
- [j17]Erik D. Demaine, Alejandro López-Ortiz: A linear lower bound on index size for text retrieval. J. Algorithms 48(1): 2-15 (2003)
- [j16]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)
- [j15]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)
- [c73]
- [c72]Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
- [c71]Erik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
- [c70]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
- [c69]Erik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate. COCOON 2003: 351-363
- [c68]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
- [c67]Sergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003: 283-294
- [c66]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
- [c65]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
- [c64]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404
- [c63]Erik D. Demaine, Nicole Immorlica: Correlation Clustering with Partial Information. RANDOM-APPROX 2003: 1-13
- [c62]Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller: Anchor-free distributed localization in sensor networks. SenSys 2003: 340-341
- [c61]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
- [i27]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)
- [i26]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)
- 2002
- [j14]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)
- [j13]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)
- [j12]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)
- [j11]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)
- [c60]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
- [c59]
- [c58]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
- [c57]
- [c56]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
- [c55]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
- [c54]
- [c53]Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Computers and Games 2002: 188-200
- [c52]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198
- [c51]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
- [c50]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
- [c49]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
- [c48]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173
- [c47]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002: 348-360
- [c46]Robert A. Hearn, Erik D. Demaine: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002: 401-413
- [c45]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
- [c44]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
- [c43]