| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Erik D. Demaine 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) 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) Greg Aloupis , Erik D. Demaine, Stefan Langerman , Pat Morin , Joseph O'Rourke , Ileana Streinu , Godfried T. Toussaint : Unfolding polyhedral bands. CCCG 2004 : 60-63 Erik D. Demaine, Satyan L. Devadoss , Joseph S. B. Mitchell , Joseph O'Rourke : Continuous foldability of polygonal paper. CCCG 2004 : 64-67 Erik D. Demaine, Dion Harmon , John Iacono , Mihai Patrascu : Dynamic Optimality -- Almost. FOCS 2004 : 484-490 Erik D. Demaine, Mohammad Taghi Hajiaghayi : Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004 : 517-533 Erik D. Demaine: Puzzles, Art, and Magic with Algorithms. ISAAC 2004 : 1 Erik D. Demaine, Fedor V. Fomin , Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos : Bidimensional Parameters and Local Treewidth. LATIN 2004 : 109-118 Mihai Badoiu , Erik D. Demaine: A Simplified, Dynamic Unified Structure. LATIN 2004 : 466-473 Erik D. Demaine, Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos : The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004 : 191-203 Mihai Patrascu , Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004 : 20-29 Erik D. Demaine, John Iacono , Stefan Langerman : Retroactive data structures. SODA 2004 : 281-290 Erik D. Demaine, Thouis R. Jones , Mihai Patrascu : Interpolation search for non-independent data. SODA 2004 : 529-530 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 Erik D. Demaine, Mohammad Taghi Hajiaghayi : Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004 : 840-849 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 Mihai Patrascu , Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004 : 546-553 Prosenjit Bose , Erik D. Demaine, Ferran Hurtado , John Iacono , Stefan Langerman , Pat Morin : Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004 : 1-9 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 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 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 Mihai Badoiu , Erik D. Demaine, Mohammad Taghi Hajiaghayi , Piotr Indyk : Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004 : 320-329 Erik D. Demaine, Mohammad Taghi Hajiaghayi : Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40 (3): 211-215 (2004) Erik D. Demaine, Sándor P. Fekete , Shmuel Gal : Online Searching with Turn Cost CoRR cs.DS/0406045 : (2004) 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) Erik D. Demaine, John Iacono , Stefan Langerman : Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR cs.DS/0410048 : (2004) 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) 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) Erik D. Demaine, Martin L. Demaine , Rudolf Fleischer : Solitaire Clobber. Theor. Comput. Sci. 303 (3): 325-338 (2004) 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) 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) Erik D. Demaine: Open Problems from ALENEX 2003. ALENEX 2003 Erik D. Demaine, Jeff Erickson , Stefan Langerman : On the Complexity of Halfspace Volume Queries. CCCG 2003 : 159-160 Robert Hearn , Erik D. Demaine, Greg N. Frederickson : Hinged Dissection of Polygons is Hard. CCCG 2003 : 98-102 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 Erik D. Demaine, Susan Hohenberger , David Liben-Nowell : Tetris is Hard, Even to Approximate. COCOON 2003 : 351-363 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 Sergio Cabello , Erik D. Demaine, Günter Rote : Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003 : 283-294 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 Erik D. Demaine, Stefan Langerman , Joseph O'Rourke : Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003 : 395-404 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 Erik D. Demaine, Nicole Immorlica : Correlation Clustering with Partial Information. RANDOM-APPROX 2003 : 1-13 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 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) 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) 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) 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) 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) Erik D. Demaine, Martin L. Demaine , Michael Hoffmann , Joseph O'Rourke : Pushing blocks is hard. Comput. Geom. 26 (1): 21-36 (2003) 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) Robert Connelly , Erik D. Demaine, Günter Rote : Blowing Up Polygonal Linkages. Discrete & Computational Geometry 30 (2): 205-239 (2003) Erik D. Demaine, Alejandro López-Ortiz : A linear lower bound on index size for text retrieval. J. Algorithms 48 (1): 2-15 (2003) 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. 1-3 (302): 475-480 (2003) 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) 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 Erik D. Demaine, John Iacono , Stefan Langerman : Proximate point searching. CCCG 2002 : 1-4 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 Erik D. Demaine, Joseph O'Rourke : Open problems from cccg 2001. CCCG 2002 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 Erik D. Demaine, Robert A. Hearn , Michael Hoffmann : Push-2-f is pspace-complete. CCCG 2002 : 31-35 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 Erik D. Demaine, Martin L. Demaine , Rudolf Fleischer : Solitaire Clobber. Computers and Games 2002 : 188-200 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 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 Michael A. Bender , Erik D. Demaine, Martin Farach-Colton : Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002 : 165-173 Erik D. Demaine, Alejandro López-Ortiz , J. Ian Munro : Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002 : 348-360 Robert A. Hearn , Erik D. Demaine: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002 : 401-413 Erik D. Demaine, Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos : Exponential Speedup of Fixed-Parameter Algorithms on K 3, 3 -Minor-Free or K 5 -Minor-Free Graphs. ISAAC 2002 : 262-273 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 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 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 Erik D. Demaine, Alejandro López-Ortiz , J. Ian Munro : Robot Localization without Depth Perception. SWAT 2002 : 249-259 Erik D. Demaine, Stefan Langerman , Joseph O'Rourke , Jack Snoeyink : Interlocked open linkages with few joints. Symposium on Computational Geometry 2002 : 189-198 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 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 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) Erik D. Demaine, Susan Hohenberger , David Liben-Nowell : Tetris is Hard, Even to Approximate CoRR cs.CC/0210020 : (2002) 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) Erik D. Demaine, Joseph O'Rourke : Open Problems from CCCG 2002 CoRR cs.CG/0212050 : (2002) Erik D. Demaine, Martin L. Demaine , Helena A. Verrill : Coin-Moving Puzzles CoRR cs.DM/0204002 : (2002) Erik D. Demaine, Martin L. Demaine , Rudolf Fleischer : Solitaire Clobber CoRR cs.DM/0204017 : (2002) 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) 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) 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) Erik D. Demaine, Alejandro López-Ortiz , J. Ian Munro : Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX 2001 : 91-104 Erik D. Demaine, Joseph O'Rourke : Open problems from cccg 2000. CCCG 2001 : 185-187 Erik D. Demaine, Michael Hoffmann : Pushing blocks is np-complete for noncrossing solution paths. CCCG 2001 : 65-68 Erik D. Demaine, Stefan Langerman , Joseph O'Rourke : Short interlocked linkages. CCCG 2001 : 69-72 Erik D. Demaine, Joseph S. B. Mitchell : Reaching folded states of a rectangular piece of paper. CCCG 2001 : 73-75 Erik D. Demaine, Martin L. Demaine , Anna Lubiw : The cccg 2001 logo. CCCG 2001 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 Erik D. Demaine: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. MFCS 2001 : 18-32 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 Erik D. Demaine, Alejandro López-Ortiz : A linear lower bound on index size for text retrieval. SODA 2001 : 289-294 Erik D. Demaine, Alejandro López-Ortiz , J. Ian Munro : On universally easy classes for NP-complete problems. SODA 2001 : 910-911 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 Erik D. Demaine: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory CoRR cs.CC/0106019 : (2001) 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) Erik D. Demaine, David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke : Vertex-Unfoldings of Simplicial Polyhedra CoRR cs.CG/0107023 : (2001) Erik D. Demaine, Martin L. Demaine , Anna Lubiw , Joseph O'Rourke : Enumerating Foldings and Unfoldings between Polygons and Polytopes CoRR cs.CG/0107024 : (2001) Erik D. Demaine, David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke : Vertex-Unfoldings of Simplicial Manifolds CoRR cs.CG/0110054 : (2001) Erik D. Demaine, Martin L. Demaine , Craig S. Kaplan : Polygons cuttable by a circular saw. Comput. Geom. 20 (1-2): 69-84 (2001) 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) 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) 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) Therese C. Biedl , Prosenjit Bose , Erik D. Demaine, Anna Lubiw : Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38 (1): 110-134 (2001) Erik D. Demaine, Martin L. Demaine , Craig S. Kaplan : Polygons Cuttable by a Circular Saw. CCCG 2000 Erik D. Demaine, Martin L. Demaine , Joseph O'Rourke : PushPush and Push-1 are NP-hard in 2D. CCCG 2000 Oswin Aichholzer , Erik D. Demaine, Jeff Erickson , Ferran Hurtado , Mark H. Overmars , Michael A. Soss , Godfried T. Toussaint : Reconfiguring Convex Polygons. CCCG 2000 Erik D. Demaine, Joseph O'Rourke : Session O1: Open Problems and Planning. CCCG 2000 Robert Connelly , Erik D. Demaine, Günter Rote : Every Polygon Can Be Untangled. EWCG 2000 : 62-65 Michael A. Bender , Erik D. Demaine, Martin Farach-Colton : Cache-Oblivious B-Trees. FOCS 2000 : 399-409 Robert Connelly , Erik D. Demaine, Günter Rote : Straighting Polygonal Arcs and Convexifying Polygonal Cycles. FOCS 2000 : 432-442 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 Erik D. Demaine: Folding and Unfolding Linkages, Paper, and Polyhedra. JCDCG 2000 : 113-124 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 Erik D. Demaine, Alejandro López-Ortiz , J. Ian Munro : Adaptive set intersections, unions, and differences. SODA 2000 : 743-752 Erik D. Demaine, Martin L. Demaine , David Eppstein : Phutball Endgames are Hard CoRR cs.CC/0008025 : (2000) Erik D. Demaine, Martin L. Demaine , Joseph O'Rourke : PushPush is NP-hard in 2D CoRR cs.CG/0001019 : (2000) 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) Erik D. Demaine, Martin L. Demaine , Joseph O'Rourke : PushPush and Push-1 are NP-hard in 2D CoRR cs.CG/0007021 : (2000) Oswin Aichholzer , Carmen Cortes , 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) 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) 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) Erik D. Demaine, Joseph O'Rourke : Computational Geometry Column 37. Int. J. Comput. Geometry Appl. 10 (1): 103-107 (2000) Erik D. Demaine, Martin L. Demaine , David Eppstein , Erich Friedman : Hinged dissections of polyominoes and polyforms. CCCG 1999 Marshall W. Bern , Erik D. Demaine, David Eppstein , Eric Kuo : Ununfoldable polyhedra. CCCG 1999 Erik D. Demaine, J. Ian Munro : Fast Allocation and Deallocation with an Improved Buddy System. FSTTCS 1999 : 84-96 Therese C. Biedl , Erik D. Demaine, Sylvain Lazard , Steven M. Robbins , Michael A. Soss : Convexifying Monotone Polygons. ISAAC 1999 : 415-424 Therese C. Biedl , Prosenjit Bose , Erik D. Demaine, Anna Lubiw : Efficient Algorithms for Petersen's Matching Theorem. SODA 1999 : 130-139 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 Erik D. Demaine, Martin L. Demaine , Anna Lubiw : Folding and One Straight Cut Suffice. SODA 1999 : 891-892 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 Erik D. Demaine, Martin L. Demaine , Anna Lubiw , Joseph O'Rourke , Irena Pashchenko : Metamorphosis of the Cube. Symposium on Computational Geometry 1999 : 409-410 David Benoit , Erik D. Demaine, J. Ian Munro , Venkatesh Raman : Representing Trees of Higer Degree. WADS 1999 : 169-180 Andrej Brodnik , Svante Carlsson , Erik D. Demaine, J. Ian Munro , Robert Sedgewick : Resizable Arrays in Optimal Time and Space. WADS 1999 : 37-48 Erik D. Demaine, Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman : Hinged Dissection of Polyominoes and Polyforms CoRR cs.CG/9907018 : (1999) Marshall W. Bern , Erik D. Demaine, David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink : Ununfoldable Polyhedra with Convex Faces CoRR cs.CG/9908003 : (1999) Erik D. Demaine, Joseph O'Rourke : Computational Geometry Column 37 CoRR cs.CG/9908007 : (1999) 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) 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) Therese C. Biedl , Erik D. Demaine, Martin L. Demaine , Anna Lubiw , Godfried T. Toussaint : Hiding disks in folded polygons. CCCG 1998 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 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 Erik D. Demaine, Martin L. Demaine : Planar Drawings of Origami Polyhedra. Graph Drawing 1998 : 438-440 Erik D. Demaine: Protocols for Non-Deterministic Communication over Synchronous Channels. IPPS/SPDP 1998 : 24-30 Erik D. Demaine, Martin L. Demaine , Anna Lubiw : Folding and Cutting Paper. JCDCG 1998 : 104-118 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) Erik D. Demaine: C to Java: Converting Pointers into References. Concurrency - Practice and Experience 10 (11-13): 851-861 (1998) 1 [ 28 ] [ 41 ] [ 47 ] [ 72 ] [ 80 ] [ 102 ] 2 [ 81 ] [ 89 ] [ 93 ] [ 147 ] 3 [ 68 ] 4 [ 79 ] 5 [ 27 ] [ 54 ] [ 57 ] [ 104 ] 6 [ 128 ] [ 141 ] 7 [ 75 ] [ 106 ] 8 [ 105 ] [ 129 ] 9 [ 27 ] [ 38 ] [ 54 ] [ 57 ] [ 68 ] [ 79 ] [ 85 ] [ 86 ] [ 87 ] [ 104 ] [ 125 ] 10 [ 15 ] 11 [ 12 ] [ 23 ] [ 103 ] 12 [ 2 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 19 ] [ 20 ] [ 21 ] [ 34 ] [ 44 ] [ 46 ] [ 52 ] [ 59 ] [ 67 ] [ 91 ] [ 97 ] [ 113 ] [ 115 ] [ 119 ] [ 123 ] 13 [ 20 ] [ 36 ] [ 44 ] [ 66 ] [ 89 ] [ 132 ] 14 [ 115 ] [ 119 ] 15 [ 72 ] [ 80 ] [ 102 ] [ 107 ] 16 [ 122 ] 17 [ 149 ] 18 [ 14 ] [ 36 ] [ 66 ] 19 [ 125 ] 20 [ 97 ] 21 [ 112 ] 22 [ 130 ] 23 [ 14 ] [ 36 ] [ 66 ] 24 [ 34 ] 25 [ 34 ] [ 91 ] 26 [ 86 ] [ 87 ] 27 [ 37 ] [ 39 ] [ 99 ] 28 [ 28 ] 29 [ 109 ] [ 134 ] 30 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 24 ] [ 26 ] [ 27 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 34 ] [ 42 ] [ 43 ] [ 46 ] [ 48 ] [ 50 ] [ 52 ] [ 54 ] [ 60 ] [ 67 ] [ 69 ] [ 70 ] [ 88 ] [ 91 ] [ 97 ] [ 101 ] [ 121 ] 31 [ 146 ] 32 [ 28 ] [ 81 ] 33 [ 59 ] [ 123 ] 34 [ 12 ] [ 13 ] [ 23 ] [ 24 ] [ 32 ] [ 49 ] [ 51 ] [ 76 ] [ 103 ] 35 [ 28 ] [ 41 ] [ 47 ] [ 49 ] [ 51 ] [ 76 ] [ 81 ] [ 107 ] [ 117 ] [ 131 ] 36 [ 38 ] [ 68 ] [ 85 ] [ 86 ] [ 87 ] 37 [ 57 ] [ 104 ] [ 125 ] [ 126 ] 38 [ 34 ] [ 36 ] [ 52 ] [ 59 ] [ 66 ] [ 69 ] [ 88 ] [ 120 ] [ 121 ] [ 123 ] 39 [ 111 ] [ 136 ] [ 142 ] 40 [ 45 ] 41 [ 120 ] 42 [ 13 ] [ 116 ] 43 [ 13 ] [ 24 ] 44 [ 126 ] 45 [ 75 ] [ 106 ] 46 [ 109 ] [ 134 ] 47 [ 113 ] 48 [ 82 ] [ 95 ] [ 97 ] [ 111 ] [ 127 ] [ 128 ] [ 135 ] [ 136 ] [ 140 ] [ 142 ] [ 144 ] [ 148 ] 49 [ 75 ] [ 106 ] [ 115 ] [ 119 ] 50 [ 145 ] 51 [ 49 ] [ 51 ] [ 76 ] 52 [ 116 ] 53 [ 74 ] [ 83 ] [ 90 ] 54 [ 63 ] [ 90 ] [ 101 ] 55 [ 73 ] [ 114 ] [ 122 ] 56 [ 79 ] 57 [ 122 ] 58 [ 113 ] 59 [ 41 ] [ 47 ] [ 80 ] [ 131 ] [ 132 ] 60 [ 94 ] [ 107 ] [ 124 ] [ 131 ] [ 132 ] [ 138 ] [ 145 ] 61 [ 130 ] 62 [ 108 ] 63 [ 128 ] 64 [ 75 ] [ 106 ] 65 [ 52 ] 66 [ 137 ] 67 [ 43 ] [ 48 ] 68 [ 45 ] 69 [ 59 ] [ 123 ] 70 [ 122 ] 71 [ 80 ] 72 [ 80 ] 73 [ 12 ] [ 23 ] [ 103 ] 74 [ 62 ] [ 77 ] [ 81 ] [ 89 ] [ 94 ] [ 100 ] [ 107 ] [ 110 ] [ 117 ] [ 124 ] [ 131 ] [ 132 ] [ 138 ] [ 147 ] 75 [ 2 ] [ 7 ] [ 9 ] [ 10 ] [ 19 ] [ 21 ] [ 46 ] [ 67 ] 76 [ 125 ] 77 [ 73 ] [ 114 ] [ 122 ] 78 [ 33 ] [ 36 ] [ 55 ] [ 56 ] [ 65 ] [ 66 ] [ 78 ] [ 84 ] [ 96 ] [ 98 ] [ 109 ] [ 113 ] [ 115 ] [ 119 ] [ 134 ] 79 [ 2 ] [ 3 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 16 ] [ 18 ] [ 19 ] [ 20 ] [ 30 ] [ 44 ] [ 46 ] [ 50 ] [ 60 ] [ 67 ] 80 [ 12 ] [ 103 ] 81 [ 28 ] [ 72 ] [ 81 ] [ 89 ] [ 93 ] [ 102 ] [ 125 ] [ 131 ] 82 [ 17 ] [ 26 ] [ 27 ] [ 54 ] [ 57 ] [ 61 ] [ 104 ] [ 146 ] 83 [ 36 ] [ 66 ] [ 107 ] [ 132 ] [ 147 ] 84 [ 14 ] [ 15 ] [ 22 ] [ 33 ] [ 36 ] [ 52 ] [ 55 ] [ 65 ] [ 66 ] [ 68 ] [ 78 ] [ 79 ] [ 84 ] [ 96 ] [ 109 ] [ 149 ] 85 [ 91 ] 86 [ 120 ] 87 [ 130 ] 88 [ 2 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 16 ] [ 19 ] [ 25 ] [ 29 ] [ 30 ] [ 31 ] [ 40 ] [ 42 ] [ 46 ] [ 49 ] [ 50 ] [ 51 ] [ 62 ] [ 64 ] [ 67 ] [ 71 ] [ 76 ] [ 77 ] [ 81 ] [ 92 ] [ 93 ] [ 100 ] [ 101 ] [ 110 ] [ 146 ] [ 147 ] 89 [ 2 ] [ 6 ] [ 10 ] [ 19 ] [ 28 ] [ 41 ] [ 46 ] [ 47 ] [ 81 ] [ 89 ] [ 131 ] 90 [ 28 ] 91 [ 16 ] 92 [ 133 ] [ 137 ] [ 139 ] [ 145 ] 93 [ 125 ] 94 [ 113 ] 95 [ 113 ] 96 [ 15 ] 97 [ 28 ] [ 80 ] 98 [ 68 ] 99 [ 2 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 19 ] [ 46 ] [ 67 ] 100 [ 21 ] 101 [ 37 ] [ 39 ] [ 99 ] [ 112 ] 102 [ 72 ] [ 102 ] 103 [ 14 ] 104 [ 27 ] [ 54 ] [ 57 ] [ 80 ] [ 104 ] 105 [ 27 ] [ 54 ] 106 [ 45 ] 107 [ 12 ] [ 77 ] [ 100 ] [ 103 ] 108 [ 21 ] [ 41 ] [ 47 ] [ 72 ] [ 81 ] [ 102 ] 109 [ 75 ] [ 106 ] 110 [ 2 ] [ 7 ] [ 9 ] [ 10 ] [ 19 ] [ 46 ] [ 67 ] [ 81 ] [ 93 ] [ 147 ] 111 [ 82 ] [ 95 ] [ 111 ] [ 136 ] [ 140 ] [ 142 ] [ 148 ] 112 [ 68 ] 113 [ 2 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 19 ] [ 28 ] [ 41 ] [ 46 ] [ 47 ] [ 67 ] [ 81 ] [ 89 ] [ 93 ] [ 107 ] [ 147 ] 114 [ 91 ] 115 [ 80 ] 116 [ 70 ] 117 [ 97 ] [ 115 ] [ 119 ] 118 [ 34 ] [ 91 ] 119 [ 2 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 19 ] [ 46 ] [ 67 ] [ 131 ] 120 [ 86 ]  ©2005 Association for Computing Machinery |
