| 2009 |
|---|
| 278 | EE | Ken-ichi Kawarabayashi,
Erik D. Demaine,
MohammadTaghi Hajiaghayi:
Additive approximation algorithms for list-coloring minor-closed class of graphs.
SODA 2009: 1166-1175 |
| 277 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Daniel Kane,
Mihai Patrascu:
The geometry of binary search trees.
SODA 2009: 496-505 |
| 276 | EE | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
STACS 2009: 171-182 |
| 275 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Hamid Mahini,
Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games.
STACS 2009: 301-312 |
| 274 | EE | Timothy G. Abbott,
Erik D. Demaine,
Blaise Gassend:
A Generalized Carpenter's Rule Theorem for Self-Touching Linkages
CoRR abs/0901.1322: (2009) |
| 273 | EE | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
CoRR abs/0902.1043: (2009) |
| 272 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Hamid Mahini,
Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games
CoRR abs/0902.1400: (2009) |
| 2008 |
|---|
| 271 | EE | Mihai Badoiu,
Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Anastasios Sidiropoulos,
Morteza Zadimoghaddam:
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.
APPROX-RANDOM 2008: 21-34 |
| 270 | | Erik D. Demaine,
Martin L. Demaine,
Vi Hart:
Computational Balloon Twisting: The Theory of Balloon Polyhedra.
CCCG 2008 |
| 269 | EE | Erik D. Demaine,
Robert A. Hearn:
Constraint Logic: A Uniform Framework for Modeling Computation as Games.
IEEE Conference on Computational Complexity 2008: 149-162 |
| 268 | EE | Jun-geun Park,
Erik D. Demaine,
Seth J. Teller:
Moving-Baseline Localization.
IPSN 2008: 15-26 |
| 267 | EE | Takehiro Ito,
Erik D. Demaine,
Nicholas J. A. Harvey,
Christos H. Papadimitriou,
Martha Sideri,
Ryuhei Uehara,
Yushi Uno:
On the Complexity of Reconfiguration Problems.
ISAAC 2008: 28-39 |
| 266 | EE | Greg Aloupis,
Sébastien Collette,
Erik D. Demaine,
Stefan Langerman,
Vera Sacristán Adinolfi,
Stefanie Wuhrer:
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
ISAAC 2008: 342-353 |
| 265 | EE | Erik D. Demaine:
Algorithmic Graph Minors and Bidimensionality.
IWPEC 2008: 9 |
| 264 | EE | Erik D. Demaine,
Stefan Langerman,
Eric Price:
Confluently Persistent Tries for Efficient Version Control.
SWAT 2008: 160-172 |
| 263 | EE | Timothy G. Abbott,
Zachary Abel,
David Charlton,
Erik D. Demaine,
Martin L. Demaine,
Scott D. Kominers:
Hinged dissections exist.
Symposium on Computational Geometry 2008: 110-119 |
| 262 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi:
Approximation Schemes for Planar Graph Problems.
Encyclopedia of Algorithms 2008 |
| 261 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi:
Bidimensionality.
Encyclopedia of Algorithms 2008 |
| 260 | EE | Noga Alon,
Mihai Badoiu,
Erik D. Demaine,
Martin Farach-Colton,
Mohammad Taghi Hajiaghayi,
Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.
ACM Transactions on Algorithms 4(4): (2008) |
| 259 | EE | Ilya Baran,
Erik D. Demaine,
Dmitriy A. Katz:
Optimally Adaptive Integration of Univariate Lipschitz Functions.
Algorithmica 50(2): 255-278 (2008) |
| 258 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica 50(2): 279-298 (2008) |
| 257 | EE | Ilya Baran,
Erik D. Demaine,
Mihai Patrascu:
Subquadratic Algorithms for 3SUM.
Algorithmica 50(4): 584-596 (2008) |
| 256 | EE | David Charlton,
Erik D. Demaine,
Martin L. Demaine,
Gregory N. Price,
Yaa-Lirng Tu:
A Locked Orthogonal Tree
CoRR abs/0801.4405: (2008) |
| 255 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues
CoRR abs/0803.0316: (2008) |
| 254 | EE | Zachary Abel,
David Charlton,
Sébastien Collette,
Erik D. Demaine,
Martin L. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Val Pinciu,
Godfried T. Toussaint:
Cauchy's Arm Lemma on a Growing Sphere
CoRR abs/0804.0986: (2008) |
| 253 | EE | Daniel Kane,
Gregory N. Price,
Erik D. Demaine:
A Pseudopolynomial Algorithm for Alexandrov's Theorem
CoRR abs/0812.5030: (2008) |
| 252 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi:
Linearity of grid minors in treewidth with applications through bidimensionality.
Combinatorica 28(1): 19-36 (2008) |
| 251 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands.
Comput. Geom. 39(1): 30-42 (2008) |
| 250 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi:
The Bidimensionality Theory and Its Algorithmic Applications.
Comput. J. 51(3): 292-302 (2008) |
| 249 | EE | Erik D. Demaine,
Jeff Erickson,
Danny Krizanc,
Henk Meijer,
Pat Morin,
Mark H. Overmars,
Sue Whitesides:
Realizing partitions respecting full and partial order information.
J. Discrete Algorithms 6(1): 51-58 (2008) |
| 248 | EE | Takehiro Ito,
Erik D. Demaine,
Xiao Zhou,
Takao Nishizeki:
Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms 6(4): 627-650 (2008) |
| 247 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues.
Natural Computing 7(3): 347-370 (2008) |
| 246 | EE | Erik D. Demaine,
Uriel Feige,
MohammadTaghi Hajiaghayi,
Mohammad R. Salavatipour:
Combination Can Be Hard: Approximability of the Unique Coverage Problem.
SIAM J. Comput. 38(4): 1464-1483 (2008) |
| 2007 |
|---|
| 245 | | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 244 | | Nadia Benbernou,
Erik D. Demaine,
Martin L. Demaine,
Michael Hoffmann,
Mashhood Ishaque,
Diane L. Souvaine,
Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
CCCG 2007: 13-16 |
| 243 | | Greg Aloupis,
Brad Ballinger,
Prosenjit Bose,
Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Robin Y. Flatland,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke,
Perouz Taslakian,
Godfried T. Toussaint:
Vertex Pops and Popturns.
CCCG 2007: 137-140 |
| 242 | | Kevin Buchin,
Maike Buchin,
Erik D. Demaine,
Martin L. Demaine,
Dania El-Khechen,
Sándor P. Fekete,
Christian Knauer,
André Schulz,
Perouz Taslakian:
On Rolling Cube Puzzles.
CCCG 2007: 141-144 |
| 241 | | Erik D. Demaine,
Joseph O'Rourke:
Open Problems from CCCG 2006.
CCCG 2007: 277-280 |
| 240 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues.
DNA 2007: 1-14 |
| 239 | EE | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance.
ICALP 2007: 146-157 |
| 238 | EE | Greg Aloupis,
Sébastien Collette,
Mirela Damian,
Erik D. Demaine,
Robin Y. Flatland,
Stefan Langerman,
Joseph O'Rourke,
Suneeta Ramaswami,
Vera Sacristán Adinolfi,
Stefanie Wuhrer:
Linear Reconfiguration of Cube-Style Modular Robots.
ISAAC 2007: 208-219 |
| 237 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Hamid Mahini,
Morteza Zadimoghaddam:
The price of anarchy in network creation games.
PODC 2007: 292-298 |
| 236 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Hamid Mahini,
Amin S. Sayedi-Roshkhar,
Shayan Oveis Gharan,
Morteza Zadimoghaddam:
Minimizing movement.
SODA 2007: 258-267 |
| 235 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Bojan Mohar:
Approximation algorithms via contraction decomposition.
SODA 2007: 278-287 |
| 234 | EE | Erik D. Demaine,
Mohammad Ghodsi,
Mohammad Taghi Hajiaghayi,
Amin S. Sayedi-Roshkhar,
Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption.
SPAA 2007: 46-54 |
| 233 | EE | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 232 | EE | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 231 | EE | Erik D. Demaine,
Mihai Patrascu:
Tight bounds for dynamic convex hull queries (again).
Symposium on Computational Geometry 2007: 354-363 |
| 230 | EE | Ajay Deshpande,
Taejung Kim,
Erik D. Demaine,
Sanjay E. Sarma:
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems.
WADS 2007: 163-174 |
| 229 | EE | Jean Cardinal,
Erik D. Demaine,
Samuel Fiorini,
Gwenaël Joret,
Stefan Langerman,
Ilan Newman,
Oren Weimann:
The Stackelberg Minimum Spanning Tree Game.
WADS 2007: 64-76 |
| 228 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
ACM Transactions on Algorithms 3(2): (2007) |
| 227 | EE | Erik D. Demaine,
Francisco Gomez-Martin,
Henk Meijer,
David Rappaport,
Perouz Taslakian,
Godfried T. Toussaint,
Terry Winograd,
David R. Wood:
The Distance Geometry of Music
CoRR abs/0705.4085: (2007) |
| 226 | EE | Gregory N. Price,
Erik D. Demaine:
Generalized D-Forms Have No Spurious Creases
CoRR abs/0711.2605: (2007) |
| 225 | EE | Timothy G. Abbott,
Zachary Abel,
David Charlton,
Erik D. Demaine,
Martin L. Demaine,
Scott D. Kominers:
Hinged Dissections Exist
CoRR abs/0712.2094: (2007) |
| 224 | EE | Jean Cardinal,
Erik D. Demaine,
Samuel Fiorini,
Gwenaël Joret,
Stefan Langerman,
Ilan Newman,
Oren Weimann:
The Stackelberg Minimum Spanning Tree Game
CoRR abs/cs/0703019: (2007) |
| 223 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic Ham-Sandwich Cuts.
Discrete & Computational Geometry 37(3): 325-339 (2007) |
| 222 | EE | MohammadHossein Bateni,
Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Mohammad Moharrami:
Plane Embeddings of Planar Graph Metrics.
Discrete & Computational Geometry 38(3): 615-637 (2007) |
| 221 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Quickly deciding minor-closed parameters in general graphs.
Eur. J. Comb. 28(1): 311-314 (2007) |
| 220 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
J. Graph Algorithms Appl. 11(1): 259-276 (2007) |
| 219 | EE | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Bryan Holland-Minkley,
J. Ian Munro:
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.
SIAM J. Comput. 36(6): 1672-1695 (2007) |
| 218 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Mihai Patrascu:
Dynamic Optimality - Almost.
SIAM J. Comput. 37(1): 240-251 (2007) |
| 217 | EE | Mihai Badoiu,
Richard Cole,
Erik D. Demaine,
John Iacono:
A unified access bound on comparison-based dynamic dictionaries.
Theor. Comput. Sci. 382(2): 86-96 (2007) |
| 2006 |
|---|
| 216 | EE | Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Vida Dujmovic,
Dania El-Khechen,
Robin Y. Flatland,
John Iacono,
Stefan Langerman,
Henk Meijer,
Suneeta Ramaswami,
Diane L. Souvaine,
Perouz Taslakian,
Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing.
CCCG 2006 |
| 215 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open Problems: Open Problems from CCCG 2005.
CCCG 2006 |
| 214 | EE | Erik D. Demaine:
Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins.
CCCG 2006 |
| 213 | EE | Erik D. Demaine,
Blaise Gassend,
Joseph O'Rourke,
Godfried T. Toussaint:
Polygons Flip Finitely: Flaws and a Fix.
CCCG 2006 |
| 212 | EE | Sachio Teramoto,
Erik D. Demaine,
Ryuhei Uehara:
Voronoi game on graphs and its complexity.
CIG 2006: 265-271 |
| 211 | EE | Erik D. Demaine:
Origami, Linkages, and Polyhedra: Folding with Algorithms.
ESA 2006: 1 |
| 210 | EE | David Bremner,
Timothy M. Chan,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Perouz Taslakian:
Necklaces, Convolutions, and X + Y.
ESA 2006: 160-171 |
| 209 | EE | Takehiro Ito,
Erik D. Demaine,
Xiao Zhou,
Takao Nishizeki:
Approximability of Partitioning Graphs with Supply and Demand.
ISAAC 2006: 121-130 |
| 208 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.
ISAAC 2006: 3-15 |
| 207 | EE | Ilya Baran,
Erik D. Demaine,
Dmitriy A. Katz:
Optimally Adaptive Integration of Univariate Lipschitz Functions.
LATIN 2006: 142-153 |
| 206 | EE | Erik D. Demaine,
Friedhelm Meyer auf der Heide,
Rasmus Pagh,
Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).
LATIN 2006: 349-361 |
| 205 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
LATIN 2006: 80-92 |
| 204 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Uriel Feige,
Mohammad R. Salavatipour:
Combination can be hard: approximability of the unique coverage problem.
SODA 2006: 162-171 |
| 203 | EE | Micah Adler,
Erik D. Demaine,
Nicholas J. A. Harvey,
Mihai Patrascu:
Lower bounds for asymmetric communication channels and distributed source coding.
SODA 2006: 251-260 |
| 202 | EE | MohammadHossein Bateni,
Mohammad Taghi Hajiaghayi,
Erik D. Demaine,
Mohammad Moharrami:
Plane embeddings of planar graph metrics.
Symposium on Computational Geometry 2006: 197-206 |
| 201 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and unlocked chains of planar shapes.
Symposium on Computational Geometry 2006: 61-70 |
| 200 | EE | Hayley N. Iben,
James F. O'Brien,
Erik D. Demaine:
Refolding planar polygons.
Symposium on Computational Geometry 2006: 71-79 |
| 199 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
Algorithmica 44(2): 167-181 (2006) |
| 198 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and Unlocked Chains of Planar Shapes
CoRR abs/cs/0604022: (2006) |
| 197 | EE | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance
CoRR abs/cs/0604037: (2006) |
| 196 | EE | Ben Leong,
Barbara Liskov,
Erik D. Demaine:
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management.
Computer Communications 29(9): 1243-1259 (2006) |
| 195 | EE | Mihai Badoiu,
Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Piotr Indyk:
Low-Dimensional Embedding with Extra Information.
Discrete & Computational Geometry 36(4): 609-632 (2006) |
| 194 | EE | Mihai Patrascu,
Erik D. Demaine:
Logarithmic Lower Bounds in the Cell-Probe Model.
SIAM J. Comput. 35(4): 932-963 (2006) |
| 193 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs.
SIAM J. Discrete Math. 20(2): 357-371 (2006) |
| 192 | EE | Erik D. Demaine,
Dotan Emanuel,
Amos Fiat,
Nicole Immorlica:
Correlation clustering in general weighted graphs.
Theor. Comput. Sci. 361(2-3): 172-187 (2006) |
| 191 | EE | Erik D. Demaine,
Sándor P. Fekete,
Shmuel Gal:
Online searching with turn cost.
Theor. Comput. Sci. 361(2-3): 342-355 (2006) |
| 190 | EE | Erik D. Demaine,
Martin L. Demaine,
Arthur Langerman,
Stefan Langerman:
Morpion Solitaire.
Theory Comput. Syst. 39(3): 439-453 (2006) |
| 189 | EE | Erik D. Demaine,
Martin L. Demaine:
Puzzles, Art, and Magic with Algorithms.
Theory Comput. Syst. 39(3): 473-481 (2006) |
| 2005 |
|---|
| 188 | | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Charles E. Leiserson,
Kurt Mehlhorn:
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004
IBFI, Schloss Dagstuhl, Germany 2005 |
| 187 | EE | Erik D. Demaine,
Francisco Gomez-Martin,
Henk Meijer,
David Rappaport,
Perouz Taslakian,
Godfried T. Toussaint,
Terry Winograd,
David R. Wood:
The Distance Geometry of Deep Rhythms and Scales.
CCCG 2005: 163-166 |
| 186 | EE | Timothy G. Abbott,
Erik D. Demaine,
Martin L. Demaine,
Daniel Kane,
Stefan Langerman,
Jelani Nelson,
Vincent Yeung:
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
CCCG 2005: 61-64 |
| 185 | EE | Erik D. Demaine,
Stefan Langerman:
Optimizing a 2D Function Satisfying Unimodality Properties.
ESA 2005: 887-898 |
| 184 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.
FOCS 2005: 637-646 |
| 183 | EE | Nissanka B. Priyantha,
Hari Balakrishnan,
Erik D. Demaine,
Seth J. Teller:
Mobile-assisted localization in wireless sensor networks.
INFOCOM 2005: 172-183 |
| 182 | EE | Jonathan Bredin,
Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Daniela Rus:
Deploying sensor networks with guaranteed capacity and fault tolerance.
MobiHoc 2005: 309-319 |
| 181 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Bidimensionality: new connections between FPT algorithms and PTASs.
SODA 2005: 590-601 |
| 180 | EE | Noga Alon,
Mihai Badoiu,
Erik D. Demaine,
Martin Farach-Colton,
Mohammad Taghi Hajiaghayi,
Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics.
SODA 2005: 650-659 |
| 179 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.
SODA 2005: 682-689 |
| 178 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers.
WADS 2005: 169-181 |
| 177 | EE | Erik D. Demaine,
Martin L. Demaine,
Jeffrey F. Lindy,
Diane L. Souvaine:
Hinged Dissection of Polypolyhedra.
WADS 2005: 205-217 |
| 176 | EE | Ilya Baran,
Erik D. Demaine,
Mihai Patrascu:
Subquadratic Algorithms for 3SUM.
WADS 2005: 409-421 |
| 175 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.
ACM Transactions on Algorithms 1(1): 33-47 (2005) |
| 174 | EE | Gerth Stølting Brodal,
Erik D. Demaine,
J. Ian Munro:
Fast allocation and deallocation with an improved buddy system.
Acta Inf. 41(4-5): 273-291 (2005) |
| 173 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
Algorithmica 41(4): 245-267 (2005) |
| 172 | EE | David Benoit,
Erik D. Demaine,
J. Ian Munro,
Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Representing Trees of Higher Degree.
Algorithmica 43(4): 275-292 (2005) |
| 171 | EE | Mihai Patrascu,
Erik D. Demaine:
Logarithmic Lower Bounds in the Cell-Probe Model
CoRR abs/cs/0502041: (2005) |
| 170 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi:
Bidimensionality, Map Graphs, and Grid Minors
CoRR abs/cs/0502070: (2005) |
| 169 | EE | Erik D. Demaine,
Friedhelm Meyer auf der Heide,
Rasmus Pagh,
Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus
CoRR abs/cs/0512081: (2005) |
| 168 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
CoRR abs/cs/0512091: (2005) |
| 167 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged dissection of polyominoes and polyforms.
Comput. Geom. 31(3): 237-262 (2005) |
| 166 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry 33(4): 593-604 (2005) |
| 165 | EE | Ilya Baran,
Erik D. Demaine:
Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve.
Int. J. Comput. Geometry Appl. 15(4): 327-350 (2005) |
| 164 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005) |
| 163 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM 52(6): 866-893 (2005) |
| 162 | EE | Michael A. Bender,
Erik D. Demaine,
Martin Farach-Colton:
Cache-Oblivious B-Trees.
SIAM J. Comput. 35(2): 341-358 (2005) |
| 161 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs.
SIAM J. Comput. 35(3): 531-566 (2005) |
| 160 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Games on triangulations.
Theor. Comput. Sci. 343(1-2): 42-71 (2005) |
| 159 | EE | Robert A. Hearn,
Erik D. Demaine:
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation.
Theor. Comput. Sci. 343(1-2): 72-96 (2005) |
| 2004 |
|---|
| 158 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Unfolding polyhedral bands.
CCCG 2004: 60-63 |
| 157 | EE | Erik D. Demaine,
Satyan L. Devadoss,
Joseph S. B. Mitchell,
Joseph O'Rourke:
Continuous foldability of polygonal paper.
CCCG 2004: 64-67 |
| 156 | EE | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Charles E. Leiserson,
Kurt Mehlhorn:
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.
Cache-Oblivious and Cache-Aware Algorithms 2004 |
| 155 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Mihai Patrascu:
Dynamic Optimality -- Almost.
FOCS 2004: 484-490 |
| 154 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth.
Graph Drawing 2004: 517-533 |
| 153 | EE | Erik D. Demaine:
Puzzles, Art, and Magic with Algorithms.
ISAAC 2004: 1 |
| 152 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Grid Vertex-Unfolding Orthostacks.
JCDCG 2004: 76-82 |
| 151 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
LATIN 2004: 109-118 |
| 150 | EE | Mihai Badoiu,
Erik D. Demaine:
A Simplified, Dynamic Unified Structure.
LATIN 2004: 466-473 |
| 149 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs.
MFCS 2004: 191-203 |
| 148 | EE | Mihai Patrascu,
Erik D. Demaine:
Tight bounds for the partial-sums problem.
SODA 2004: 20-29 |
| 147 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
SODA 2004: 281-290 |
| 146 | EE | Erik D. Demaine,
Thouis R. Jones,
Mihai Patrascu:
Interpolation search for non-independent data.
SODA 2004: 529-530 |
| 145 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.
SODA 2004: 830-839 |
| 144 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Equivalence of local treewidth and linear local treewidth and its algorithmic applications.
SODA 2004: 840-849 |
| 143 | EE | Lukasz Golab,
David DeHaan,
Alejandro López-Ortiz,
Erik D. Demaine:
Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies.
SSDBM 2004: 425-426 |
| 142 | EE | Mihai Patrascu,
Erik D. Demaine:
Lower bounds for dynamic connectivity.
STOC 2004: 546-553 |
| 141 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic ham-sandwich cuts.
Symposium on Computational Geometry 2004: 1-9 |
| 140 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating point sets in polygonal environments.
Symposium on Computational Geometry 2004: 10-16 |
| 139 | EE | Jason H. Cantarella,
Erik D. Demaine,
Hayley N. Iben,
James F. O'Brien:
An energy-driven approach to linkage unfolding.
Symposium on Computational Geometry 2004: 134-143 |
| 138 | EE | Ilya Baran,
Erik D. Demaine:
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve.
Symposium on Computational Geometry 2004: 220-229 |
| 137 | EE | Mihai Badoiu,
Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Piotr Indyk:
Low-dimensional embedding with extra information.
Symposium on Computational Geometry 2004: 320-329 |
| 136 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi:
Diameter and Treewidth in Minor-Closed Graph Families, Revisited.
Algorithmica 40(3): 211-215 (2004) |
| 135 | EE | Erik D. Demaine,
Sándor P. Fekete,
Shmuel Gal:
Online Searching with Turn Cost
CoRR cs.DS/0406045: (2004) |
| 134 | EE | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers
CoRR cs.DS/0407058: (2004) |
| 133 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Worst-Case Optimal Tree Layout in a Memory Hierarchy
CoRR cs.DS/0410048: (2004) |
| 132 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
Comput. Geom. 28(1): 29-40 (2004) |
| 131 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When can you fold a map?
Comput. Geom. 29(1): 23-46 (2004) |
| 130 | EE | Therese C. Biedl,
Timothy M. Chan,
Erik D. Demaine,
Rudolf Fleischer,
Mordecai J. Golin,
James A. King,
J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search.
Discrete Applied Mathematics 144(3): 231-236 (2004) |
| 129 | EE | Therese C. Biedl,
Erik D. Demaine,
Christian A. Duncan,
Rudolf Fleischer,
Stephen G. Kobourov:
Tight bounds on maximal and maximum matchings.
Discrete Mathematics 285(1-3): 7-15 (2004) |
| 128 | EE | Ron Breukelaar,
Erik D. Demaine,
Susan Hohenberger,
Hendrik Jan Hoogeboom,
Walter A. Kosters,
David Liben-Nowell:
Tetris is hard, even to approximate.
Int. J. Comput. Geometry Appl. 14(1-2): 41-68 (2004) |
| 127 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci. 69(2): 166-195 (2004) |
| 126 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math. 18(3): 501-511 (2004) |
| 125 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber.
Theor. Comput. Sci. 303(3): 325-338 (2004) |
| 124 | EE | Erik D. Demaine,
Rudolf Fleischer,
Aviezri S. Fraenkel,
Richard J. Nowakowski:
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci. 303(3): 539-543 (2004) |
| 123 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding hidden independent sets in interval graphs.
Theor. Comput. Sci. 310(1-3): 287-307 (2004) |
| 2003 |
|---|
| 122 | | Erik D. Demaine:
Open Problems from ALENEX 2003.
ALENEX 2003 |
| 121 | | Erik D. Demaine,
Jeff Erickson,
Stefan Langerman:
On the Complexity of Halfspace Volume Queries.
CCCG 2003: 159-160 |
| 120 | | Robert A. Hearn,
Erik D. Demaine,
Greg N. Frederickson:
Hinged Dissection of Polygons is Hard.
CCCG 2003: 98-102 |
| 119 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding Hidden Independent Sets in Interval Graphs.
COCOON 2003: 182-191 |
| 118 | EE | Erik D. Demaine,
Susan Hohenberger,
David Liben-Nowell:
Tetris is Hard, Even to Approximate.
COCOON 2003: 351-363 |
| 117 | EE | Therese C. Biedl,
Erik D. Demaine,
Alexander Golynski,
Joseph Douglas Horton,
Alejandro López-Ortiz,
Guillaume Poirier,
Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
ESA 2003: 90-101 |
| 116 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
Graph Drawing 2003: 283-294 |
| 115 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
ICALP 2003: 829-844 |
| 114 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
ISAAC 2003: 395-404 |
| 113 | EE | Lukasz Golab,
David DeHaan,
Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Identifying frequent items in sliding windows over on-line packet streams.
Internet Measurement Comference 2003: 173-178 |
| 112 | EE | Erik D. Demaine,
Nicole Immorlica:
Correlation Clustering with Partial Information.
RANDOM-APPROX 2003: 1-13 |
| 111 | EE | Nissanka B. Priyantha,
Hari Balakrishnan,
Erik D. Demaine,
Seth J. Teller:
Anchor-free distributed localization in sensor networks.
SenSys 2003: 340-341 |
| 110 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
WADS 2003: 451-461 |
| 109 | | Ziv Bar-Joseph,
Erik D. Demaine,
David K. Gifford,
Nathan Srebro,
Angèle M. Hamel,
Tommi Jaakkola:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.
Bioinformatics 19(9): 1070-1078 (2003) |
| 108 | EE | Ilya Baran,
Erik D. Demaine:
Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve
CoRR cs.CG/0307005: (2003) |
| 107 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs
CoRR cs.DS/0309014: (2003) |
| 106 | | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo,
Andrea Mantler,
Jack Snoeyink:
Ununfoldable polyhedra with convex faces.
Comput. Geom. 24(2): 51-62 (2003) |
| 105 | | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model.
Comput. Geom. 25(1-2): 139-159 (2003) |
| 104 | EE | Erik D. Demaine,
Martin L. Demaine,
Michael Hoffmann,
Joseph O'Rourke:
Pushing blocks is hard.
Comput. Geom. 26(1): 21-36 (2003) |
| 103 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open and closed linkages with few joints.
Comput. Geom. 26(1): 37-45 (2003) |
| 102 | EE | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Blowing Up Polygonal Linkages.
Discrete & Computational Geometry 30(2): 205-239 (2003) |
| 101 | EE | Erik D. Demaine,
Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval.
J. Algorithms 48(1): 2-15 (2003) |
| 100 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
Theor. Comput. Sci. 1-3(304): 471-476 (2003) |
| 99 | EE | Therese C. Biedl,
Jonathan F. Buss,
Erik D. Demaine,
Martin L. Demaine,
Mohammad Taghi Hajiaghayi,
Tomás Vinar:
Palindrome recognition using a multidimensional tape.
Theor. Comput. Sci. 302(1-3): 475-480 (2003) |
| 2002 |
|---|
| 98 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
APPROX 2002: 67-80 |
| 97 | EE | Greg Aloupis,
Erik D. Demaine,
Henk Meijer,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles.
CCCG 2002: 27-30 |
| 96 | EE | Greg Aloupis,
Prosenjit Bose,
Erik D. Demaine,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Godfried T. Toussaint:
Computing signed permutations of polygons.
CCCG 2002: 68-71 |
| 95 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open problems from cccg 2001.
CCCG 2002 |
| 94 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
CCCG 2002: 1-4 |
| 93 | EE | Therese C. Biedl,
Timothy M. Chan,
Erik D. Demaine,
Martin L. Demaine,
Paul Nijjar,
Ryuhei Uehara,
Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
CCCG 2002: 105-108 |
| 92 | EE | Erik D. Demaine,
Robert A. Hearn,
Michael Hoffmann:
Push-2-f is pspace-complete.
CCCG 2002: 31-35 |
| 91 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber.
Computers and Games 2002: 188-200 |
| 90 | EE | Michael A. Bender,
Richard Cole,
Erik D. Demaine,
Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.
ESA 2002: 139-151 |
| 89 | EE | Michael A. Bender,
Richard Cole,
Erik D. Demaine,
Martin Farach-Colton,
Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List.
ESA 2002: 152-164 |
| 88 | EE | Michael A. Bender,
Erik D. Demaine,
Martin Farach-Colton:
Efficient Tree Layout in a Multilevel Memory Hierarchy.
ESA 2002: 165-173 |
| 87 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space.
ESA 2002: 348-360 |
| 86 | EE | Robert A. Hearn,
Erik D. Demaine:
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.
ICALP 2002: 401-413 |
| 85 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.
ISAAC 2002: 262-273 |
| 84 | EE | Greg Aloupis,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Stefan Langerman,
Henk Meijer,
Joseph O'Rourke,
Mark H. Overmars,
Michael A. Soss,
Ileana Streinu,
Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions.
ISAAC 2002: 369-380 |
| 83 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Playing with Triangulations.
JCDCG 2002: 22-37 |
| 82 | EE | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Bryan Holland-Minkley,
J. Ian Munro:
Cache-oblivious priority queue and graph algorithm applications.
STOC 2002: 268-276 |
| 81 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Robot Localization without Depth Perception.
SWAT 2002: 249-259 |
| 80 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open linkages with few joints.
Symposium on Computational Geometry 2002: 189-198 |
| 79 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds.
Symposium on Computational Geometry 2002: 237-243 |
| 78 | EE | Ziv Bar-Joseph,
Erik D. Demaine,
David K. Gifford,
Angèle M. Hamel,
Tommi Jaakkola,
Nathan Srebro:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.
WABI 2002: 506-520 |
| 77 | EE | Robert A. Hearn,
Erik D. Demaine:
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
CoRR cs.CC/0205005: (2002) |
| 76 | EE | Erik D. Demaine,
Susan Hohenberger,
David Liben-Nowell:
Tetris is Hard, Even to Approximate
CoRR cs.CC/0210020: (2002) |
| 75 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Henk Meijer,
Vera Sacristan,
Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model
CoRR cs.CG/0201018: (2002) |
| 74 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open Problems from CCCG 2002
CoRR cs.CG/0212050: (2002) |
| 73 | EE | Erik D. Demaine,
Martin L. Demaine,
Helena A. Verrill:
Coin-Moving Puzzles
CoRR cs.DM/0204002: (2002) |
| 72 | EE | Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer:
Solitaire Clobber
CoRR cs.DM/0204017: (2002) |
| 71 | EE | Stephen Alstrup,
Michael A. Bender,
Erik D. Demaine,
Martin Farach-Colton,
J. Ian Munro,
Theis Rauhe,
Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy
CoRR cs.DS/0211010: (2002) |
| 70 | | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock.
Discrete Applied Mathematics 117(1-3): 293-297 (2002) |
| 69 | EE | Therese C. Biedl,
Eowyn Cenek,
Timothy M. Chan,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Ming-wei Wang:
Balanced k-colorings.
Discrete Mathematics 254(1-3): 19-32 (2002) |
| 68 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Enumerating Foldings and Unfoldings Between Polygons and Polytopes.
Graphs and Combinatorics 18(1): 93-104 (2002) |
| 67 | EE | Prosenjit Bose,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
Alejandro López-Ortiz,
Pat Morin,
J. Ian Munro:
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl. 12(4): 283-296 (2002) |
| 2001 |
|---|
| 66 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems.
ALENEX 2001: 91-104 |
| 65 | EE | Erik D. Demaine,
Joseph O'Rourke:
Open problems from cccg 2000.
CCCG 2001: 185-187 |
| 64 | EE | Erik D. Demaine,
Michael Hoffmann:
Pushing blocks is np-complete for noncrossing solution paths.
CCCG 2001: 65-68 |
| 63 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Short interlocked linkages.
CCCG 2001: 69-72 |
| 62 | EE | Erik D. Demaine,
Joseph S. B. Mitchell:
Reaching folded states of a rectangular piece of paper.
CCCG 2001: 73-75 |
| 61 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw:
The cccg 2001 logo.
CCCG 2001 |
| 60 | EE | Therese C. Biedl,
Erik D. Demaine,
Christian A. Duncan,
Rudolf Fleischer,
Stephen G. Kobourov:
Tight Bounds on Maximal and Maximum Matchings.
ISAAC 2001: 308-319 |
| 59 | EE | Erik D. Demaine:
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.
MFCS 2001: 18-32 |
| 58 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal covering tours with turn costs.
SODA 2001: 138-147 |
| 57 | EE | Erik D. Demaine,
Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval.
SODA 2001: 289-294 |
| 56 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
SODA 2001: 910-911 |
| 55 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
WADS 2001: 401-413 |
| 54 | EE | Erik D. Demaine:
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
CoRR cs.CC/0106019: (2001) |
| 53 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Lars Jacobsen,
J. Ian Munro:
The Complexity of Clickomania
CoRR cs.CC/0107031: (2001) |
| 52 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra
CoRR cs.CG/0107023: (2001) |
| 51 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Enumerating Foldings and Unfoldings between Polygons and Polytopes
CoRR cs.CG/0107024: (2001) |
| 50 | EE | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds
CoRR cs.CG/0110054: (2001) |
| 49 | | Erik D. Demaine,
Martin L. Demaine,
Craig S. Kaplan:
Polygons cuttable by a circular saw.
Comput. Geom. 20(1-2): 69-84 (2001) |
| 48 | | Oswin Aichholzer,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
Mark H. Overmars,
Michael A. Soss,
Godfried T. Toussaint:
Reconfiguring convex polygons.
Comput. Geom. 20(1-2): 85-95 (2001) |
| 47 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry 26(3): 269-281 (2001) |
| 46 | EE | Erik D. Demaine,
Ian T. Foster,
Carl Kesselman,
Marc Snir:
Generalized Communicators in the Message Passing Interface.
IEEE Trans. Parallel Distrib. Syst. 12(6): 610-616 (2001) |
| 45 | | Therese C. Biedl,
Prosenjit Bose,
Erik D. Demaine,
Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem.
J. Algorithms 38(1): 110-134 (2001) |
| 2000 |
|---|
| 44 | EE | Erik D. Demaine,
Martin L. Demaine,
Craig S. Kaplan:
Polygons Cuttable by a Circular Saw.
CCCG 2000 |
| 43 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D.
CCCG 2000 |
| 42 | EE | Oswin Aichholzer,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
Mark H. Overmars,
Michael A. Soss,
Godfried T. Toussaint:
Reconfiguring Convex Polygons.
CCCG 2000 |
| 41 | EE | Erik D. Demaine,
Joseph O'Rourke:
Session O1: Open Problems and Planning.
CCCG 2000 |
| 40 | | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Every Polygon Can Be Untangled.
EWCG 2000: 62-65 |
| 39 | | Michael A. Bender,
Erik D. Demaine,
Martin Farach-Colton:
Cache-Oblivious B-Trees.
FOCS 2000: 399-409 |
| 38 | | Robert Connelly,
Erik D. Demaine,
Günter Rote:
Straighting Polygonal Arcs and Convexifying Polygonal Cycles.
FOCS 2000: 432-442 |
| 37 | EE | Prosenjit Bose,
Pat Morin,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
J. Ian Munro,
Alejandro López-Ortiz:
Online Routing in Convex Subdivisions.
ISAAC 2000: 47-59 |
| 36 | EE | Erik D. Demaine:
Folding and Unfolding Linkages, Paper, and Polyhedra.
JCDCG 2000: 113-124 |
| 35 | EE | Therese C. Biedl,
Eowyn Cenek,
Timothy M. Chan,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Ming-wei Wang:
Balanced k-Colorings.
MFCS 2000: 202-211 |
| 34 | EE | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Adaptive set intersections, unions, and differences.
SODA 2000: 743-752 |
| 33 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein:
Phutball Endgames are Hard
CoRR cs.CC/0008025: (2000) |
| 32 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush is NP-hard in 2D
CoRR cs.CG/0001019: (2000) |
| 31 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke:
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR cs.CG/0007019: (2000) |
| 30 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph O'Rourke:
PushPush and Push-1 are NP-hard in 2D
CoRR cs.CG/0007021: (2000) |
| 29 | EE | Oswin Aichholzer,
Carmen Cortés,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Henk Meijer,
Mark H. Overmars,
Belén Palop,
Suneeta Ramaswami,
Godfried T. Toussaint:
Flipturning polygons
CoRR cs.CG/0008010: (2000) |
| 28 | EE | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
CoRR cs.CG/0011026: (2000) |
| 27 | | Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell:
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom. 16(1): 3-21 (2000) |
| 26 | | Erik D. Demaine,
Joseph O'Rourke:
Computational Geometry Column 37.
Int. J. Comput. Geometry Appl. 10(1): 103-107 (2000) |
| 1999 |
|---|
| 25 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Erich Friedman:
Hinged dissections of polyominoes and polyforms.
CCCG 1999 |
| 24 | EE | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo:
Ununfoldable polyhedra.
CCCG 1999 |
| 23 | EE | Erik D. Demaine,
J. Ian Munro:
Fast Allocation and Deallocation with an Improved Buddy System.
FSTTCS 1999: 84-96 |
| 22 | EE | Therese C. Biedl,
Erik D. Demaine,
Sylvain Lazard,
Steven M. Robbins,
Michael A. Soss:
Convexifying Monotone Polygons.
ISAAC 1999: 415-424 |
| 21 | EE | Therese C. Biedl,
Prosenjit Bose,
Erik D. Demaine,
Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem.
SODA 1999: 130-139 |
| 20 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D.
SODA 1999: 866-867 |
| 19 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw:
Folding and One Straight Cut Suffice.
SODA 1999: 891-892 |
| 18 | EE | Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell:
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami.
Symposium on Computational Geometry 1999: 105-114 |
| 17 | EE | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Joseph O'Rourke,
Irena Pashchenko:
Metamorphosis of the Cube.
Symposium on Computational Geometry 1999: 409-410 |
| 16 | EE | David Benoit,
Erik D. Demaine,
J. Ian Munro,
Venkatesh Raman:
Representing Trees of Higer Degree.
WADS 1999: 169-180 |
| 15 | EE | Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
J. Ian Munro,
Robert Sedgewick:
Resizable Arrays in Optimal Time and Space.
WADS 1999: 37-48 |
| 14 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged Dissection of Polyominoes and Polyforms
CoRR cs.CG/9907018: (1999) |
| 13 | EE | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo,
Andrea Mantler,
Jack Snoeyink:
Ununfoldable Polyhedra with Convex Faces
CoRR cs.CG/9908003: (1999) |
| 12 | EE | Erik D. Demaine,
Joseph O'Rourke:
Computational Geometry Column 37
CoRR cs.CG/9908007: (1999) |
| 11 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D
CoRR cs.CG/9910009: (1999) |
| 10 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock
CoRR cs.CG/9910024: (1999) |
| 1998 |
|---|
| 9 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Godfried T. Toussaint:
Hiding disks in folded polygons.
CCCG 1998 |
| 8 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
On reconfiguring tree linkages: Trees can lock.
CCCG 1998 |
| 7 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw,
Mark H. Overmars,
Joseph O'Rourke,
Steve Robbins,
Sue Whitesides:
Unfolding some classes of orthogonal polyhedra.
CCCG 1998 |
| 6 | EE | Erik D. Demaine,
Martin L. Demaine:
Planar Drawings of Origami Polyhedra.
Graph Drawing 1998: 438-440 |
| 5 | EE | Erik D. Demaine:
Protocols for Non-Deterministic Communication over Synchronous Channels.
IPPS/SPDP 1998: 24-30 |
| 4 | | Erik D. Demaine,
Martin L. Demaine,
Anna Lubiw:
Folding and Cutting Paper.
JCDCG 1998: 104-118 |
| 3 | EE | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Sylvain Lazard,
Anna Lubiw,
Joseph O'Rourke,
Mark H. Overmars,
Steve Robbins,
Ileana Streinu,
Godfried T. Toussaint,
Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D
CoRR cs.CG/9811019: (1998) |
| 2 | | Erik D. Demaine:
C to Java: Converting Pointers into References.
Concurrency - Practice and Experience 10(11-13): 851-861 (1998) |
| 1996 |
|---|
| 1 | EE | Erik D. Demaine,
Sampalli Srinivas:
A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks.
International Journal of High Speed Computing 8(1): 81-92 (1996) |
