Erik D. Demaine Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
303Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNeil 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
302Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Gregory N. Price: Generalized D-Forms Have No Spurious Creases. Discrete & Computational Geometry 43(1): 179-186 (2010)
2009
301Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Algorithms Meet Art, Puzzles, and Magic. ESA 2009: 289
300Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729
299Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327
298Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340
297Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Gad M. Landau, Oren Weimann: On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353
296Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames McLurkin, Erik D. Demaine: A Distributed boundary detection algorithm for multi-robot systems. IROS 2009: 4791-4798
295Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang: Folding a Better Checkerboard. ISAAC 2009: 1074-1083
294Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175
293Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
292Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGlencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182
291Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312
290Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Algorithms Meet Art, Puzzles, and Magic. WADS 2009: 193
289Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386
288Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem. WADS 2009: 435-446
287Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBrad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon: Minimal Locked Trees. WADS 2009: 61-73
286Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean 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
285Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
284Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
283Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy G. Abbott, Erik D. Demaine, Blaise Gassend: A Generalized Carpenter's Rule Theorem for Self-Touching Linkages CoRR abs/0901.1322: (2009)
282Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGlencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs CoRR abs/0902.1043: (2009)
281Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games CoRR abs/0902.1400: (2009)
280Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra CoRR abs/0906.2461: (2009)
279Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
278Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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)
277Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions CoRR abs/0908.2493: (2009)
276Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean 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)
275Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Benbernou, Erik D. Demaine, Martin L. Demaine, Aviv Ovadya: A Universal Crease Pattern for Folding Orthogonal Shapes CoRR abs/0909.5388: (2009)
274Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHee-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)
273Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding Planar Polygons. Discrete & Computational Geometry 41(3): 444-460 (2009)
2008
272Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34
271no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Vi Hart: Computational Balloon Twisting: The Theory of Balloon Polyhedra. CCCG 2008
270Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Robert A. Hearn: Constraint Logic: A Uniform Framework for Modeling Computation as Games. IEEE Conference on Computational Complexity 2008: 149-162
269Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJun-geun Park, Erik D. Demaine, Seth J. Teller: Moving-Baseline Localization. IPSN 2008: 15-26
268Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro 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
267Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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
266Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Algorithmic Graph Minors and Bidimensionality. IWPEC 2008: 9
265Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. SWAT 2008: 160-172
264Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy 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
263Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi: Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008
262Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality. Encyclopedia of Algorithms 2008
261Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga 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)
260Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. Algorithmica 50(2): 255-278 (2008)
259Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
258Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
257Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Charlton, Erik D. Demaine, Martin L. Demaine, Gregory N. Price, Yaa-Lirng Tu: A Locked Orthogonal Tree CoRR abs/0801.4405: (2008)
256Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
255Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZachary 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)
254Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel M. Kane, Gregory N. Price, Erik D. Demaine: A Pseudopolynomial Algorithm for Alexandrov's Theorem CoRR abs/0812.5030: (2008)
253Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1): 19-36 (2008)
252Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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)
251Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi: The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008)
250Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
249Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4): 627-650 (2008)
248Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
247Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008)
2007
246no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
245no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia 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
244no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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
243no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKevin 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
242no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Joseph O'Rourke: Open Problems from CCCG 2006. CCCG 2007: 277-280
241Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
240Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157
239Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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
238Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298
237Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267
236Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287
235Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54
234Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
233Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
232Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
231Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAjay 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
230Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean 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
229Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2): (2007)
228Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
227Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGregory N. Price, Erik D. Demaine: Generalized D-Forms Have No Spurious Creases CoRR abs/0711.2605: (2007)
226Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers: Hinged Dissections Exist CoRR abs/0712.2094: (2007)
225Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean 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)
224Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLProsenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic Ham-Sandwich Cuts. Discrete & Computational Geometry 37(3): 325-339 (2007)
223Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami: Plane Embeddings of Planar Graph Metrics. Discrete & Computational Geometry 38(3): 615-637 (2007)
222Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi: Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007)
221Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007)
220Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars 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)
219Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
218Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2): 86-96 (2007)
2006
217Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMirela 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
216Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Joseph O'Rourke: Open Problems: Open Problems from CCCG 2005. CCCG 2006
215Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. CCCG 2006
214Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint: Polygons Flip Finitely: Flaws and a Fix. CCCG 2006
213Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSachio Teramoto, Erik D. Demaine, Ryuhei Uehara: Voronoi game on graphs and its complexity. CIG 2006: 265-271
212Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Origami, Linkages, and Polyhedra: Folding with Algorithms. ESA 2006: 1
211Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid 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
210Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130
209Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15
208Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Dmitriy A. Katz: Optimally Adaptive Integration of Univariate Lipschitz Functions. LATIN 2006: 142-153
207Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
206Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris 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
205Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour: Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171
204Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMicah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu: Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260
203Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami: Plane embeddings of planar graph metrics. Symposium on Computational Geometry 2006: 197-206
202Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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
201Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHayley N. Iben, James F. O'Brien, Erik D. Demaine: Refolding planar polygons. Symposium on Computational Geometry 2006: 71-79
200Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica 44(2): 167-181 (2006)
199Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
198Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance CoRR abs/cs/0604037: (2006)
197Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBen Leong, Barbara Liskov, Erik D. Demaine: EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management. Computer Communications 29(9): 1243-1259 (2006)
196Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006)
195Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
194Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006)
193Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3): 172-187 (2006)
192Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online searching with turn cost. Theor. Comput. Sci. 361(2-3): 342-355 (2006)
191Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman: Morpion Solitaire. Theory Comput. Syst. 39(3): 439-453 (2006)
190Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine: Puzzles, Art, and Magic with Algorithms. Theory Comput. Syst. 39(3): 473-481 (2006)
2005
189no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005
188Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
187Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy 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
186Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Stefan Langerman: Optimizing a 2D Function Satisfying Unimodality Properties. ESA 2005: 887-898
185Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646
184Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNissanka B. Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller: Mobile-assisted localization in wireless sensor networks. INFOCOM 2005: 172-183
183Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319
182Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi: Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601
181Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga 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
180Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
178Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine: Hinged Dissection of Polypolyhedra. WADS 2005: 205-217
177Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. WADS 2005: 409-421
176Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
175Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGerth 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)
174Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
173Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid 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)
172Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model CoRR abs/cs/0502041: (2005)
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality, Map Graphs, and Grid Minors CoRR abs/cs/0502070: (2005)
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR abs/cs/0512081: (2005)
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris 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)
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid 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)
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya 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)
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005)
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEsther 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)
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOswin 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)
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert A. Hearn, Erik D. Demaine: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2): 72-96 (2005)
2004
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke: Continuous foldability of polygonal paper. CCCG 2004: 64-67
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars 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
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality -- Almost. FOCS 2004: 484-490
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi: Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004: 517-533
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Puzzles, Art, and Magic with Algorithms. ISAAC 2004: 1
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine: A Simplified, Dynamic Unified Structure. LATIN 2004: 466-473
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004: 20-29
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. SODA 2004: 281-290
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLukasz 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
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004: 546-553
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLProsenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJason 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
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya 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
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Sándor P. Fekete, Shmuel Gal: Online Searching with Turn Cost CoRR cs.DS/0406045: (2004)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR cs.DS/0410048: (2004)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEsther 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)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese 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)
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese 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)
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon 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)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Martin L. Demaine, Rudolf Fleischer: Solitaire Clobber. Theor. Comput. Sci. 303(3): 325-338 (2004)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar: Finding hidden independent sets in interval graphs. Theor. Comput. Sci. 310(1-3): 287-307 (2004)
2003
123no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine: Open Problems from ALENEX 2003. ALENEX 2003
122no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
121no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese 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
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate. COCOON 2003: 351-363
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTherese 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
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003: 283-294
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404
114Electronic Edition pubzone.org