The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Erik D. Demaine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erik D. Demaine
    Open Problems from ALENEX 2003. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:- [Conf]
  2. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Experiments on Adaptive Set Intersections for Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:91-104 [Conf]
  3. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:67-80 [Conf]
  4. Timothy 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:61-64 [Conf]
  5. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo
    Ununfoldable polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  6. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  7. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
    Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:68-71 [Conf]
  8. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:27-30 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:105-108 [Conf]
  11. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
    On reconfiguring tree linkages: Trees can lock. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  13. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
    Hiding disks in folded polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  14. Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
    Hinged dissections of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  15. Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
    Polygons Cuttable by a Circular Saw. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  16. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    The cccg 2001 logo. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:- [Conf]
  17. Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke
    Continuous foldability of polygonal paper. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:64-67 [Conf]
  18. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  19. Erik D. Demaine, Jeff Erickson, Stefan Langerman
    On the Complexity of Halfspace Volume Queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:159-160 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:163-166 [Conf]
  21. Erik D. Demaine, Michael Hoffmann
    Pushing blocks is np-complete for noncrossing solution paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:65-68 [Conf]
  22. Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
    Push-2-f is pspace-complete. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:31-35 [Conf]
  23. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:1-4 [Conf]
  24. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Short interlocked linkages. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:69-72 [Conf]
  25. Erik D. Demaine, Joseph S. B. Mitchell
    Reaching folded states of a rectangular piece of paper. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:73-75 [Conf]
  26. Erik D. Demaine, Joseph O'Rourke
    Session O1: Open Problems and Planning. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  27. Erik D. Demaine, Joseph O'Rourke
    Open problems from cccg 2000. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:185-187 [Conf]
  28. Erik D. Demaine, Joseph O'Rourke
    Open problems from cccg 2001. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:- [Conf]
  29. Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson
    Hinged Dissection of Polygons is Hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:98-102 [Conf]
  30. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:188-200 [Conf]
  31. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:182-191 [Conf]
  32. Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
    Tetris is Hard, Even to Approximate. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:351-363 [Conf]
  33. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-dimensional embedding with extra information. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:320-329 [Conf]
  34. Ilya Baran, Erik D. Demaine
    Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:220-229 [Conf]
  35. MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami
    Plane embeddings of planar graph metrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:197-206 [Conf]
  36. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  37. Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien
    An energy-driven approach to linkage unfolding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:134-143 [Conf]
  38. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  39. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
    Metamorphosis of the Cube. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:409-410 [Conf]
  40. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:105-114 [Conf]
  41. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-unfoldings of simplicial manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:237-243 [Conf]
  42. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  43. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:189-198 [Conf]
  44. Hayley N. Iben, James F. O'Brien, Erik D. Demaine
    Refolding planar polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:71-79 [Conf]
  45. Erik D. Demaine, Mihai Patrascu
    Tight bounds for dynamic convex hull queries (again). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:354-363 [Conf]
  46. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:90-101 [Conf]
  47. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
    Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:139-151 [Conf]
  48. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
    Two Simplified Algorithms for Maintaining Order in a List. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:152-164 [Conf]
  49. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Efficient Tree Layout in a Multilevel Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:165-173 [Conf]
  50. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
  51. Erik D. Demaine
    Origami, Linkages, and Polyhedra: Folding with Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:1- [Conf]
  52. Erik D. Demaine, Stefan Langerman
    Optimizing a 2D Function Satisfying Unimodality Properties. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:887-898 [Conf]
  53. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Frequency Estimation of Internet Packet Streams with Limited Space. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:348-360 [Conf]
  54. Robert Connelly, Erik D. Demaine, Günter Rote
    Every Polygon Can Be Untangled. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:62-65 [Conf]
  55. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:399-409 [Conf]
  56. Robert Connelly, Erik D. Demaine, Günter Rote
    Straighting Polygonal Arcs and Convexifying Polygonal Cycles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:432-442 [Conf]
  57. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality -- Almost. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:484-490 [Conf]
  58. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
    Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:637-646 [Conf]
  59. Erik D. Demaine, J. Ian Munro
    Fast Allocation and Deallocation with an Improved Buddy System. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:84-96 [Conf]
  60. Sergio Cabello, Erik D. Demaine, Günter Rote
    Planar Embeddings of Graphs with Specified Edge Lengths. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:283-294 [Conf]
  61. Erik D. Demaine, Martin L. Demaine
    Planar Drawings of Origami Polyhedra. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:438-440 [Conf]
  62. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:517-533 [Conf]
  63. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:829-844 [Conf]
  64. Robert A. Hearn, Erik D. Demaine
    The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:401-413 [Conf]
  65. 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. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:173-178 [Conf]
  66. Nissanka B. Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller
    Mobile-assisted localization in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:172-183 [Conf]
  67. Erik D. Demaine
    Protocols for Non-Deterministic Communication over Synchronous Channels. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:24-30 [Conf]
  68. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  69. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  70. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight Bounds on Maximal and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:308-319 [Conf]
  71. Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
    Convexifying Monotone Polygons. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:415-424 [Conf]
  72. Erik D. Demaine
    Puzzles, Art, and Magic with Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:1- [Conf]
  73. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
    Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:3-15 [Conf]
  74. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:262-273 [Conf]
  75. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:395-404 [Conf]
  76. Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    Approximability of Partitioning Graphs with Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:121-130 [Conf]
  77. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Playing with Triangulations. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:22-37 [Conf]
  78. Erik D. Demaine
    Folding and Unfolding Linkages, Paper, and Polyhedra. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:113-124 [Conf]
  79. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and Cutting Paper. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:104-118 [Conf]
  80. Erik D. Demaine, John Iacono, Stefan Langerman
    Grid Vertex-Unfolding Orthostacks. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:76-82 [Conf]
  81. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  82. Mihai Badoiu, Erik D. Demaine
    A Simplified, Dynamic Unified Structure. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:466-473 [Conf]
  83. Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
    Optimally Adaptive Integration of Univariate Lipschitz Functions. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:142-153 [Conf]
  84. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:109-118 [Conf]
  85. 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). [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:349-361 [Conf]
  86. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-Colorings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:202-211 [Conf]
  87. Erik D. Demaine
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:18-32 [Conf]
  88. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    The Bidimensional Theory of Bounded-Genus Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:191-203 [Conf]
  89. Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
    Deploying sensor networks with guaranteed capacity and fault tolerance. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2005, pp:309-319 [Conf]
  90. Erik D. Demaine, Nicole Immorlica
    Correlation Clustering with Partial Information. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:1-13 [Conf]
  91. Nissanka B. Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller
    Anchor-free distributed localization in sensor networks. [Citation Graph (0, 0)][DBLP]
    SenSys, 2003, pp:340-341 [Conf]
  92. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:650-659 [Conf]
  93. Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
    Lower bounds for asymmetric communication channels and distributed source coding. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:251-260 [Conf]
  94. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:138-147 [Conf]
  95. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:130-139 [Conf]
  96. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  97. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and One Straight Cut Suffice. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:891-892 [Conf]
  98. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:830-839 [Conf]
  99. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Equivalence of local treewidth and linear local treewidth and its algorithmic applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:840-849 [Conf]
  100. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Bidimensionality: new connections between FPT algorithms and PTASs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:590-601 [Conf]
  101. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:682-689 [Conf]
  102. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour
    Combination can be hard: approximability of the unique coverage problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:162-171 [Conf]
  103. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:281-290 [Conf]
  104. Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
    Interpolation search for non-independent data. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:529-530 [Conf]
  105. Erik D. Demaine, Alejandro López-Ortiz
    A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:289-294 [Conf]
  106. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Adaptive set intersections, unions, and differences. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:743-752 [Conf]
  107. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:910-911 [Conf]
  108. Mihai Patrascu, Erik D. Demaine
    Tight bounds for the partial-sums problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:20-29 [Conf]
  109. Lukasz Golab, David DeHaan, Alejandro López-Ortiz, Erik D. Demaine
    Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2004, pp:425-426 [Conf]
  110. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
    Cache-oblivious priority queue and graph algorithm applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:268-276 [Conf]
  111. Mihai Patrascu, Erik D. Demaine
    Lower bounds for dynamic connectivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:546-553 [Conf]
  112. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Robot Localization without Depth Perception. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:249-259 [Conf]
  113. 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. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:506-520 [Conf]
  114. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  115. David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
    Representing Trees of Higer Degree. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:169-180 [Conf]
  116. 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? [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:401-413 [Conf]
  117. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  118. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
    Resizable Arrays in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:37-48 [Conf]
  119. Ilya Baran, Erik D. Demaine, Mihai Patrascu
    Subquadratic Algorithms for 3SUM. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:409-421 [Conf]
  120. Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
    Hinged Dissection of Polypolyhedra. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:205-217 [Conf]
  121. Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
    Voronoi game on graphs and its complexity. [Citation Graph (0, 0)][DBLP]
    CIG, 2006, pp:265-271 [Conf]
  122. Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
    Fast allocation and deallocation with an improved buddy system. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:4-5, pp:273-291 [Journal]
  123. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
  124. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Diameter and Treewidth in Minor-Closed Graph Families, Revisited. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:3, pp:211-215 [Journal]
  125. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:245-267 [Journal]
  126. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:167-181 [Journal]
  127. 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. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:9, pp:1070-1078 [Journal]
  128. Ben Leong, Barbara Liskov, Erik D. Demaine
    EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2006, v:29, n:9, pp:1243-1259 [Journal]
  129. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:139-159 [Journal]
  130. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  131. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable polyhedra with convex faces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:51-62 [Journal]
  132. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When can you fold a map? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:23-46 [Journal]
  133. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged dissection of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:237-262 [Journal]
  134. Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
    Pushing blocks is hard. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:21-36 [Journal]
  135. Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
    Polygons cuttable by a circular saw. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:69-84 [Journal]
  136. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:3-21 [Journal]
  137. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:29-40 [Journal]
  138. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open and closed linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:37-45 [Journal]
  139. Erik D. Demaine
    C to Java: Converting Pointers into References. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1998, v:10, n:11-13, pp:851-861 [Journal]
  140. Erik D. Demaine, Martin L. Demaine, David Eppstein
    Phutball Endgames are Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  141. Erik D. Demaine
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  142. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
    The Complexity of Clickomania [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  143. Robert A. Hearn, Erik D. Demaine
    PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  144. Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
    Tetris is Hard, Even to Approximate [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  145. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush is NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  146. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  147. Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
    PushPush and Push-1 are NP-hard in 2D [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  148. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  149. 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? [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  150. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  151. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  152. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Manifolds [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  153. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  154. Erik D. Demaine, Joseph O'Rourke
    Open Problems from CCCG 2002 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  155. Ilya Baran, Erik D. Demaine
    Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  156. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  157. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged Dissection of Polyominoes and Polyforms [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  158. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable Polyhedra with Convex Faces [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  159. Erik D. Demaine, Joseph O'Rourke
    Computational Geometry Column 37 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  160. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  161. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  162. Erik D. Demaine, Martin L. Demaine, Helena A. Verrill
    Coin-Moving Puzzles [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  163. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  164. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  165. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  166. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
    Online Searching with Turn Cost [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  167. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  168. Erik D. Demaine, John Iacono, Stefan Langerman
    Worst-Case Optimal Tree Layout in a Memory Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  169. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  170. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:231-236 [Journal]
  171. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  172. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  173. Robert Connelly, Erik D. Demaine, Günter Rote
    Blowing Up Polygonal Linkages. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:205-239 [Journal]
  174. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-Dimensional Embedding with Extra Information. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:609-632 [Journal]
  175. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:19-32 [Journal]
  176. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight bounds on maximal and maximum matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:7-15 [Journal]
  177. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Quickly deciding minor-closed parameters in general graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:311-314 [Journal]
  178. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings Between Polygons and Polytopes. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:93-104 [Journal]
  179. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  180. Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
    Tetris is hard, even to approximate. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:41-68 [Journal]
  181. Ilya Baran, Erik D. Demaine
    Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:327-350 [Journal]
  182. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  183. Erik D. Demaine, Joseph O'Rourke
    Computational Geometry Column 37. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:103-107 [Journal]
  184. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:866-893 [Journal]
  185. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:110-134 [Journal]
  186. Erik D. Demaine, Alejandro López-Ortiz
    A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:2-15 [Journal]
  187. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
  188. Erik D. Demaine, Martin L. Demaine
    Puzzles, Art, and Magic with Algorithms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:473-481 [Journal]
  189. Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman
    Morpion Solitaire. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:439-453 [Journal]
  190. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
  191. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:341-358 [Journal]
  192. Mihai Patrascu, Erik D. Demaine
    Logarithmic Lower Bounds in the Cell-Probe Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:932-963 [Journal]
  193. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1672-1695 [Journal]
  194. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality - Almost. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:240-251 [Journal]
  195. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:501-511 [Journal]
  196. 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. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:33-47 [Journal]
  197. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Games on triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:42-71 [Journal]
  198. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
    Palindrome recognition using a multidimensional tape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:475-480 [Journal]
  199. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:287-307 [Journal]
  200. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
    Solitaire Clobber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:325-338 [Journal]
  201. Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica
    Correlation clustering in general weighted graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:172-187 [Journal]
  202. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:539-543 [Journal]
  203. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
    Online searching with turn cost. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:342-355 [Journal]
  204. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:471-476 [Journal]
  205. Robert A. Hearn, Erik D. Demaine
    PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:72-96 [Journal]
  206. Erik D. Demaine, Ian T. Foster, Carl Kesselman, Marc Snir
    Generalized Communicators in the Message Passing Interface. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:6, pp:610-616 [Journal]
  207. Erik D. Demaine
    Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  208. Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint
    Polygons Flip Finitely: Flaws and a Fix. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  209. Erik D. Demaine, Joseph O'Rourke
    Open Problems: Open Problems from CCCG 2005. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  210. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  211. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:13-16 [Conf]
  212. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:141-144 [Conf]
  213. Erik D. Demaine, Joseph O'Rourke
    Open Problems from CCCG 2006. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:277-280 [Conf]
  214. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  215. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
    An Optimal Decomposition Algorithm for Tree Edit Distance. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:146-157 [Conf]
  216. Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
    The price of anarchy in network creation games. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:292-298 [Conf]
  217. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
    Minimizing movement. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:258-267 [Conf]
  218. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
    Approximation algorithms via contraction decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:278-287 [Conf]
  219. Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
    Scheduling to minimize gaps and power consumption. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:46-54 [Conf]
  220. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:64-76 [Conf]
  221. Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma
    A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:163-174 [Conf]
  222. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  223. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  224. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  225. Mihai Patrascu, Erik D. Demaine
    Logarithmic Lower Bounds in the Cell-Probe Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  226. Erik D. Demaine, MohammadTaghi Hajiaghayi
    Bidimensionality, Map Graphs, and Grid Minors [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  227. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  228. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
    An O(n^3)-Time Algorithm for Tree Edit Distance [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  229. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]
  230. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
  231. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
    A unified access bound on comparison-based dynamic dictionaries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:86-96 [Journal]

  232. Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. [Citation Graph (, )][DBLP]


  233. Computational Balloon Twisting: The Theory of Balloon Polyhedra. [Citation Graph (, )][DBLP]


  234. Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP]


  235. Open Problems from CCCG 2008. [Citation Graph (, )][DBLP]


  236. Open problem session. [Citation Graph (, )][DBLP]


  237. Zipper unfoldings of polyhedral complexes. [Citation Graph (, )][DBLP]


  238. Any monotone boolean function can be realized by interlocked polygons. [Citation Graph (, )][DBLP]


  239. Ghost chimneys. [Citation Graph (, )][DBLP]


  240. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  241. Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? [Citation Graph (, )][DBLP]


  242. Constraint Logic: A Uniform Framework for Modeling Computation as Games. [Citation Graph (, )][DBLP]


  243. Hinged dissections exist. [Citation Graph (, )][DBLP]


  244. 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  245. 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  246. 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. [Citation Graph (, )][DBLP]


  247. Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. [Citation Graph (, )][DBLP]


  248. Algorithms Meet Art, Puzzles, and Magic. [Citation Graph (, )][DBLP]


  249. Minimizing Movement: Fixed-Parameter Tractability. [Citation Graph (, )][DBLP]


  250. On Cartesian Trees and Range Minimum Queries. [Citation Graph (, )][DBLP]


  251. Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. [Citation Graph (, )][DBLP]


  252. Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. [Citation Graph (, )][DBLP]


  253. Moving-Baseline Localization. [Citation Graph (, )][DBLP]


  254. Linear Reconfiguration of Cube-Style Modular Robots. [Citation Graph (, )][DBLP]


  255. Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. [Citation Graph (, )][DBLP]


  256. On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]


  257. Folding a Better Checkerboard. [Citation Graph (, )][DBLP]


  258. Algorithmic Graph Minors and Bidimensionality. [Citation Graph (, )][DBLP]


  259. Matching Points with Things. [Citation Graph (, )][DBLP]


  260. Reconfigurable asynchronous logic automata: (RALA). [Citation Graph (, )][DBLP]


  261. The geometry of binary search trees. [Citation Graph (, )][DBLP]


  262. Additive approximation algorithms for list-coloring minor-closed class of graphs. [Citation Graph (, )][DBLP]


  263. Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. [Citation Graph (, )][DBLP]


  264. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]


  265. Shape Replication through Self-Assembly and RNase Enzymes. [Citation Graph (, )][DBLP]


  266. Scheduling to minimize power consumption using submodular functions. [Citation Graph (, )][DBLP]


  267. Basic network creation games. [Citation Graph (, )][DBLP]


  268. The Price of Anarchy in Cooperative Network Creation Games. [Citation Graph (, )][DBLP]


  269. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. [Citation Graph (, )][DBLP]


  270. Confluently Persistent Tries for Efficient Version Control. [Citation Graph (, )][DBLP]


  271. Minimizing the Diameter of a Network Using Shortcut Edges. [Citation Graph (, )][DBLP]


  272. Minimal Locked Trees. [Citation Graph (, )][DBLP]


  273. Reconfiguration of List Edge-Colorings in a Graph. [Citation Graph (, )][DBLP]


  274. Algorithms Meet Art, Puzzles, and Magic. [Citation Graph (, )][DBLP]


  275. A Pseudopolynomial Algorithm for Alexandrov's Theorem. [Citation Graph (, )][DBLP]


  276. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]


  277. UNO Is Hard, Even for a Single Player. [Citation Graph (, )][DBLP]


  278. Kaboozle Is NP-complete, Even in a Strip. [Citation Graph (, )][DBLP]


  279. Realistic Reconfiguration of Crystalline (and Telecube) Robots. [Citation Graph (, )][DBLP]


  280. A Distributed boundary detection algorithm for multi-robot systems. [Citation Graph (, )][DBLP]


  281. Optimally Adaptive Integration of Univariate Lipschitz Functions. [Citation Graph (, )][DBLP]


  282. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP]


  283. Subquadratic Algorithms for 3SUM. [Citation Graph (, )][DBLP]


  284. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. [Citation Graph (, )][DBLP]


  285. The Bidimensionality Theory and Its Algorithmic Applications. [Citation Graph (, )][DBLP]


  286. Linearity of grid minors in treewidth with applications through bidimensionality. [Citation Graph (, )][DBLP]


  287. Wrapping spheres with flat paper. [Citation Graph (, )][DBLP]


  288. The distance geometry of music. [Citation Graph (, )][DBLP]


  289. Linear reconfiguration of cube-style modular robots. [Citation Graph (, )][DBLP]


  290. Dynamic ham-sandwich cuts in the plane. [Citation Graph (, )][DBLP]


  291. De Dictionariis Dynamicis Pauco Spatio Utentibus [Citation Graph (, )][DBLP]


  292. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  293. Generalized D-Forms Have No Spurious Creases [Citation Graph (, )][DBLP]


  294. Hinged Dissections Exist [Citation Graph (, )][DBLP]


  295. A Locked Orthogonal Tree [Citation Graph (, )][DBLP]


  296. Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues [Citation Graph (, )][DBLP]


  297. Cauchy's Arm Lemma on a Growing Sphere [Citation Graph (, )][DBLP]


  298. A Pseudopolynomial Algorithm for Alexandrov's Theorem [Citation Graph (, )][DBLP]


  299. A Generalized Carpenter's Rule Theorem for Self-Touching Linkages [Citation Graph (, )][DBLP]


  300. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs [Citation Graph (, )][DBLP]


  301. The Price of Anarchy in Cooperative Network Creation Games [Citation Graph (, )][DBLP]


  302. Continuous Blooming of Convex Polyhedra [Citation Graph (, )][DBLP]


  303. (Non)existence of Pleated Folds: How Paper Folds Between Creases [Citation Graph (, )][DBLP]


  304. Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves [Citation Graph (, )][DBLP]


  305. Minimum feature size preserving decompositions [Citation Graph (, )][DBLP]


  306. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]


  307. A Universal Crease Pattern for Folding Orthogonal Shapes [Citation Graph (, )][DBLP]


  308. Covering Points by Disjoint Boxes with Outliers [Citation Graph (, )][DBLP]


  309. The complexity of UNO [Citation Graph (, )][DBLP]


  310. Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract) [Citation Graph (, )][DBLP]


  311. On k-Convex Polygons [Citation Graph (, )][DBLP]


  312. Circle Packing for Origami Design Is Hard [Citation Graph (, )][DBLP]


  313. Plane Embeddings of Planar Graph Metrics. [Citation Graph (, )][DBLP]


  314. Refolding Planar Polygons. [Citation Graph (, )][DBLP]


  315. Generalized D-Forms Have No Spurious Creases. [Citation Graph (, )][DBLP]


  316. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 0.049secs, Finished in 0.065secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002