Erik D. Demaine

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