Demaine, Erik - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Advanced Search

Demaine, Erik - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

1 Copyright 2005 by ASME Proceedings of IMECE 2005
Resizable Arrays in Optimal Time and Space Andrej Brodnik y Svante Carlsson y Erik D. Demaine z
Grid Vertex-Unfolding Orthostacks Erik D. Demaine1
Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town?
HigherOrder Concurrency in Java \Lambda Erik D. Demaine
Efficient Algorithms for Petersen's Matching Theorem Therese C. Biedl \Lambda Prosenjit Bose y Erik D. Demaine z Anna Lubiw z
CoinFlipping Magic # Nadia Benbernou + Erik D. Demaine + Martin L. Demaine + Benjamin Rossman +
On Reconfiguring Tree Linkages: Trees can Lock Therese Biedl \Lambda Erik Demaine y Martin Demaine y
Exponential Speedup of Fixed Parameter Algorithms on K 3;3 -minor-free or K 5 -minor-free Graphs ?
Fast Allocation and Deallocation with an Improved Buddy System ?
Ununfoldable Polyhedra Marshall Bern \Lambda Erik D. Demaine y David Eppstein z Eric Kuo x
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams #
Representing Trees of Higher Degree David Benoit 1;2 , Erik D. Demaine 2 , J. Ian Munro 2 , and Venkatesh Raman 3
Computing Extreme Origami Bases Erik D. Demaine and Martin L. Demaine
Hinged Dissection of Polyominoes and Polyforms Erik D. Demaine \Lambda Martin L. Demaine \Lambda
Every Polygon Can Be Untangled Robert Connelly \Lambda Erik D. Demaine y Gunter Rote z
Folding and Unfolding Erik D. Demaine
HigherOrder Concurrency in PVM \Lambda Erik D. Demaine
Polygons Cuttable by a Circular Saw Erik D. Demaine \Lambda Martin L. Demaine \Lambda Craig S. Kaplan y
Convexifying Monotone Polygons Therese C. Biedl 1;? , Erik D. Demaine 1 , Sylvain Lazard 2;? ,
High Performance Computing Symposium 1996 Evaluating the Performance of Parallel Programs in a PseudoParallel MPI
Folding and Unfolding Linkages, Paper, and Polyhedra
When Can You Fold a Map? Esther M. Arkin Michael A. Bender y Erik D. Demaine z Martin L. Demaine z
12th International Parallel Processing Symposium & 9th Symposium on Parallel and Distributed Processing
CCC'97 Presentation IMPLEMENTING
Folding Any Silhouette from a Strip Erik D. Demaine \Lambda Martin L. Demaine \Lambda Joseph S. B. Mitchell y
Theoretical HKUSTTCSC200103 FunSort
Folding Paper Shopping Bags Devin J. Balkcom
Efficient Tree Layout in a Multilevel Memory Michael A. Bender1
Locked Thick Chains Erik D. Demaine
Fixed-Parameter Algorithms for (k, r)-Center in Planar Graphs and Map Graphs
Open Problems from Dagstuhl Seminar 09511: Parameterized Complexity and Approximation Algorithms
PushPush and Push1 are NPhard in 2D Erik D. Demaine Martin L. Demaine \Lambda Joseph O'Rourke y
Folding and One Straight Cut Suffice \Lambda Erik D. Demaine y Martin L. Demaine y Anna Lubiw y
Open Problems from CCCG'99 Erik D. Demaine \Lambda Joseph O'Rourke y
Open Problems from CCCG'99 \Lambda Erik D. Demaine y
Bidimensionality, Map Graphs, and Grid Minors Erik D. Demaine # MohammadTaghi Hajiaghayi #
A ThreadsOnly MPI Implementation for the Development of Parallel Programs
Polyhedral Sculptures with Hyperbolic Paraboloids Erik D. Demaine Martin L. Demaine Anna Lubiw
WoTUG20 Presentation IMPLEMENTING
Open Problems from Dagstuhl Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data
First Class Communication in MPI Erik Demaine
Balanced kColorings Therese C. Biedl, Eowyn
Planar Drawings of Origami Polyhedra ? Erik D. Demaine and Martin L. Demaine
Folding and Cutting Paper Erik D. Demaine, Martin L. Demaine, and Anna Lubiw
Graph Drawing '98 PLANAR DRAWINGS
ACM 1998 Workshop on Java for HighPerformance Network Computing
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Open Problems from CCCG 2002 Erik D. Demaine
Mobile-Assisted Localization in Wireless Sensor Networks
Optimally Adaptive Integration of Univariate Lipschitz Ilya Baran 1 , Erik D. Demaine 1 , and Dmitriy A. Katz 2
On the Complexity of Halfspace Volume Queries Erik D. Demaine Je Erickson y Stefan Langerman z
Metamorphosis of the Cube Erik Demaine Martin Demaine Anna Lubiw
Flipturning Polygons # Oswin Aichholzer +
VertexUnfoldings of Simplicial Manifolds Erik D. Demaine # David Eppstein + Je# Erickson # George W. Hart
Retroactive Data Structures (extended abstract)
Interpolation Search for Non-Independent Data Erik D. Demaine Thouis Jones Mihai P atra scu
Recent Results in Computational Origami Erik D. Demaine Martin L. Demaine
A Distributed Boundary Detection Algorithm for Multi-Robot James McLurkin and Erik D. Demaine
Tight Bounds for the Partial-Sums Problem Mihai Patrascu
Confluently Persistent Tries for Efficient Version Control
Dynamic HamSandwich Cuts in the Plane # Timothy G. Abbott + Michael A. Burr # Timothy M. Chan
Algorithmica manuscript No. (will be inserted by the editor)
CCCG 2009, Vancouver, BC, August 17--19, 2009 Open Problems from CCCG 2008
Constant Price of Anarchy in Network Creation Games via Public Service Advertising
Finding Hidden Independent Sets in Interval Graphs Therese Biedl 1 , Bro na Brejov a 1 , Erik D. Demaine 2 , Ang ele M. Hamel 3 , Alejandro
Deflating The Pentagon Erik D. Demaine 1# , Martin L. Demaine 1 , Thomas Fevens 2 ,
Pushing Blocks is NP-Complete for Noncrossing Solution Paths Erik D. Demaine Michael Ho mann y
Conveyer-Belt Alphabet Erik D. Demaine
Embedding Stacked Polytopes on a Polynomial-Size Grid Erik D. Demaine
Approximation Schemes for Planar Graph Problems (1983, 1994; Baker)
Adaptive Protocols for Negotiating NonDeterministic Choice over Synchronous Channels
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
CCCG 2007, Ottawa, Ontario, August 2022, 2007 Open Problems from CCCG 2006
COMBINATION CAN BE HARD: APPROXIMABILITY OF THE UNIQUE COVERAGE PROBLEM
Ununfoldable Polyhedra with Triangular Faces Marshall Bern \Lambda Erik D. Demaine y David Eppstein z
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)
Frequency Estimation of Internet Packet Streams with Limited Space
PushPush and Push-1 are NP-hard in 2D Erik D. Demaine Martin L. Demaine Joseph O'Rourke y
Theoretical HKUSTTCSC200205 Solitaire Clobber
3rd CGC Workshop on Computational Geometry FOLDING ANY SILHOUETTE
Locked and Unlocked Polygonal Chains in 3D \Lambda T. Biedl y E. Demaine z M. Demaine z S. Lazard y
Balanced kColorings Therese C. Biedl Eowyn
Protocols for NonDeterministic Communication over Synchronous Channels Erik D. Demaine
Efficient Simulation of MessagePassing in DistributedMemory Architectures
Converting C Pointers to Java References Erik D. Demaine
Vertex-Unfoldings of Simplicial Manifolds
On Reconfiguring Tree Linkages: Trees can Lock
Straightening Polygonal Arcs and Convexifying Polygonal Cycles Robert Connelly Erik D. Demaine y Gunter Rote z
Tetris is Hard, Even to Approximate Erik D. Demaine Susan Hohenberger David Liben-Nowell
High Performance Computing Systems '97 THREADSONLY MPI IMPLEMENTATION
WorstCase Optimal Tree Layout in a Memory Hierarchy
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
Edge-Unfolding Nested Polyhedral Bands Greg Aloupis a,1
PushPush-k is PSPACE-Complete Erik D. Demaine
Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs
Minimizing Movement ERIK D. DEMAINE
Hinged Dissection of Polypolyhedra Erik D. Demaine 1# , Martin L. Demaine 1 ,
March 25-26, 2004 Seville (Spain) Optimizing a 2DFunction Sat-
CCCG 2007, Ottawa, Ontario, August 20--22, 2007 Disjoint Segments have Convex Partitions
A Unified Access Bound on ComparisonBased Dynamic Dictionaries 1
Tight Bounds for Dynamic Convex Hull Queries (Again) Erik D. Demaine Mihai P
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
Phutball Endgames are Hard Erik D. Demaine Martin L. Demaine David Eppstein y
Continuous Blooming of Convex Polyhedra Erik D. Demaine
Vertex-Unfoldings of Simplicial Manifolds Erik D. Demaine
Sliding-Coin Puzzles Erik D. Demaine Martin L. Demaine
Hinged Dissection of Polygons is Hard Robert A. Hearn
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technol-
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
Moving-Baseline Localization Jun-geun Park Erik D. Demaine Seth Teller
Correlation Clustering in General Weighted Graphs Erik D. Demaine
Noname manuscript No. (will be inserted by the editor)
Approximation Algorithms via Contraction Decomposition Erik D. Demaine
The Stackelberg Minimum Spanning Tree Game Jean Cardinal
Confluently Persistent Tries for Efficient Version Control
Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics
A reprint from American Scientistthe magazine of Sigma Xi, The Scientific Research Society
Programmable matter by folding , N. M. Benbernoub
The Price of Anarchy in Cooperative Network Creation Games
Approximability of Partitioning Graphs with Supply and Demand
Subquadratic Algorithms for 3SUM Ilya Baran Erik D. Demaine Mihai Patrascu
A Unified Access Bound on Comparison-Based Dynamic Dictionaries 1
DYNAMIC OPTIMALITY--ALMOST ERIK D. DEMAINE, DION HARMON, JOHN IACONO, AND MIHAI PATRASCU
GEODESIC HAM-SANDWICH CUTS Prosenjit Bose
Morpion Solitaire Erik D. Demaine
CACHE-OBLIVIOUS B-TREES MICHAEL A. BENDER, ERIK D. DEMAINE, AND MARTIN FARACH-COLTON
Representing Trees of Higher Degree David Benoit
April 8, 2004 9:50 WSPC/Guidelines tetris International Journal of Computational Geometry & Applications
BIDIMENSIONAL PARAMETERS AND LOCAL TREEWIDTH ERIK D. DEMAINE, FEDOR V. FOMIN, MOHAMMADTAGHI HAJIAGHAYI, AND
Finding a Divisible Pair Stelian Ciurea
Proximate Point Searching Erik D. Demaine
Open Problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
Solitaire Clobber Erik D. Demaine1
A Linear Lower Bound on Index Size for Text Retrieval Erik D. Demaine
Ununfoldable Polyhedra with Convex Faces Marshall Bern
Erik D. Demaine Martin L. Demaine MIT Laboratory for Computer Science
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in
C to Java: Converting Pointers into References Erik D. Demaine
Balloon Polyhedra Erik D. Demaine
Reconstructing David Huffman's Legacy
Circle Packing for Origami Design Is Hard Erik D. Demaine, Sandor P. Fekete, and Robert J. Lang
Fold-and-Cut Magic Erik D. Demaine Martin L. Demaine
0-8493-8524-5/97/$0.00+$.50 c 2002 by CRC Press LLC
Remarks on Separating Words Erik D. Demaine1
Making Polygons by Simple Folds and One Straight Cut Erik D. Demaine
cOMMON uNFOLDINGS oF pOLYOMINOES aND pOLYCUBESGreg Aloupis123
CCCG 2010, Winnipeg MB, August 911, 2010 Zipper Unfoldings of Polyhedral Complexes
CCCG 2010, Winnipeg MB, August 911, 2010 Zipper Unfoldings of Polyhedral Complexes
CCCG 2010, Winnipeg MB, August 911, 2010 Bounded-Degree Polyhedronization of Point Sets
Universal Hinge Patterns to Fold Orthogonal Shapes Nadia M. Benbernou
Folding Any Orthogonal Maze Erik D. Demaine Martin L. Demaine Jason Ku
UNO is hard, even for a single player Erik D. Demaine1
Conveyer Belt Puzzle Font Erik D. Demaine
Origami Maze Puzzle Font Erik D. Demaine
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs Gerth Stlting Brodal
Folding a Better Checkerboard Erik D. Demaine1
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
(Non)existence of Pleated Folds: How Paper Folds Between Creases
Algorithmic Folding Complexity Jean Cardinal
Minimal Locked Trees Brad Ballinger1
CCCG 2009, Vancouver, BC, August 1719, 2009 Integer Point Sets Minimizing Average Pairwise 1 Distance
CCCG 2009, Vancouver, BC, August 1719, 2009 Open Problems from CCCG 2008
CCCG 2009, Vancouver, BC, August 1719, 2009 Relaxed Gabriel Graphs
On Cartesian Trees and Range Minimum Queries
Curved Crease Origami Duks Koschitz
CCCG 2008, Montreal, Quebec, August 1315, 2008 Computational Balloon Twisting
Computational Balloon Twisting: The Theory of Balloon Polyhedra
CCCG 2007, Ottawa, Ontario, August 2022, 2007 On Rolling Cube Puzzles
On Rolling Cube Puzzles Kevin Buchin
The Stackelberg Minimum Spanning Tree Game Jean Cardinal1
Scheduling to Minimize Gaps and Power Consumption Erik D. Demaine
Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
Minimizing Movement Erik D. Demaine
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
CCCG 2006, Kingston, Ontario, August 1416, 2006 Curves in the Sand: Algorithmic Drawing
CCCG 2006, Kingston, Ontario, August 1416, 2006 Open Problems from CCCG 2005
Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine
Locked and Unlocked Chains of Planar Shapes Robert Connelly
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Combination Can Be Hard: Approximability of the Unique Coverage Problem
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Design and Control of Nanostructured OrigamiTM Paul Stellman, (1)
PersiFS: A Versioned File System with an Efficient Representation Dan R. K. Ports, Austin T. Clements, and Erik D. Demaine
Realizing Partitions Respecting Full and Partial Order Information
Subquadratic Algorithms for 3SUM Ilya Baran, Erik D. Demaine, and Mihai Patrascu
Bidimensionality: New Connections between FPT Algorithms and PTASs
Graphs Excluding a Fixed Minor have Grids as Large as Treewidth, with Combinatorial and Algorithmic Applications through Bidimensionality
Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics
Puzzles, Art, and Magic with Algorithms Erik D. Demaine
Hinged Dissection of Polypolyhedra Erik D. Demaine
Folding Paper Shopping Bags Devin. J. Balkcom Erik D. Demaine
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Open Problems from CCCG 2003 Erik D. Demaine
Refolding Planar Polygons Hayley N. Iben
Low-Dimensional Embedding with Extra Information Mihai Badoiu Erik D. Demaine
Geodesic Ham-Sandwich Cuts Prosenjit Bose
FINDING A DIVISIBLE PAIR AND A GOOD WOODEN FENCE Stelian Ciurea
PUZZLES, ART, AND MAGIC WITH ALGORITHMS Erik D. Demaine
Bidimensional Parameters and Local Treewidth Erik D. Demaine1
Interpolation Search for Non-Independent Data Erik D. Demaine
Poster Abstract: Anchor-Free Distributed Localization in Sensor Networks
Planar Embeddings of Graphs with Specified Edge Lengths
Correlation Clustering with Partial Information Erik D. Demaine and Nicole Immorlica
Tetris is Hard, Even to Approximate Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell
Geometric Games on Triangulations Extended Abstract
Playing with Triangulations Oswin Aichholzer1
Flat-State Connectivity of Linkages under Dihedral Motions
Exponential Speedup of Fixed-Parameter Algorithms on
An Energy-Driven Approach to Linkage Unfolding Jason H. Cantarella
Two Simplified Algorithms for Maintaining Order in a List
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles
Proximate Point Searching Erik D. Demaine
Universal Hinge Patterns for Folding Orthogonal Shapes
Retroactive Data Structures ERIK D. DEMAINE
GEODESIC HAMSANDWICH CUTS # Prosenjit Bose + Erik D. Demaine # Ferran Hurtado John Iacono Stefan Langerman #
Computing Signed Permutations of Polygons Greg Aloupis Prosenjit Bose y Erik D. Demaine z Stefan Langerman Henk Meijer x
Shape Replication through Self-Assembly and RNase Enzymes Zachary Abel
Optimizing a 2D Function Satisfying Unimodality Properties
Cache-Oblivious Priority Queue and Graph Algorithm Applications
Constant Price of Anarchy in Network Creation Games via Public Service Advertising
Mathematics Is Art Erik D. Demaine Martin L. Demaine
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a
Generalized D-Forms Have No Spurious Creases Erik D. Demaine
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
Algorithms Meet Art, Puzzles, and Magic Erik D. Demaine
April 22, 2007 20:34 Journal of Mathematics and the Arts sonaArt Journal of Mathematics and the Arts, Vol. 00, No. 00, Month 200x, 19
CCCG 2007, Ottawa, Ontario, August 20--22, 2007 Open Problems from CCCG 2006
LowDimensional Embedding with Extra Information Mihai Badoiu Erik D. Demaine # MohammadTaghi Hajiaghayi # Piotr Indyk
Dynamic Optimality--Almost Erik D. Demaine
On Universally Easy Classes for NPcomplete Problems #
Balloon Polyhedra Erik D. Demaine # Martin L. Demaine # Vi Hart +
Proximate Point Searching Erik D. Demaine John Iacono y Stefan Langerman z
Finding Hidden Independent Sets in Interval Graphs Therese Biedl 1 , Bro na Brejov a 1 , Erik D. Demaine 2 , Ang ele M. Hamel 3 ,
Optimally Adaptive Integration of Univariate Lipschitz Functions Ilya Baran # Erik D. Demaine # Dmitriy A. Katz +
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric BlackBox Curve
Erik D. Demaine Martin L. Demaine MIT Laboratory for Computer Science
Grid VertexUnfolding Orthostacks Erik D. Demaine 1# , John Iacono 2## , and Stefan Langerman 3# # #
An EnergyDriven Approach to Linkage Unfolding Jason H. Cantarella # Erik D. Demaine ## Hayley N. Iben ### James F. O'Brien ###
CCCG 2006, Kingston, Ontario, August 14--16, 2006 Linkage Folding: From Erdos to Proteins
Continuous Blooming of Convex Polyhedra # Erik D. Demaine +# Martin L. Demaine + Vi Hart
Finding Hidden Independent Sets in Interval Therese Biedl 1 , Bro na Brejov a 1 , Erik D. Demaine 2 , Ang ele M. Hamel 3 ,
February 28, 2005 21:19 WSPC/Guidelines nearest6full International Journal of Computational Geometry & Applications
Deflating The Pentagon Erik D. Demaine # Martin L. Demaine # Diane L. Souvaine + Perouz Taslakian #
Polygons Cuttable by a Circular Saw Erik D. Demaine Martin L. Demaine Craig S. Kaplan y
Planning to Fold Multiple Objects from a Single Self-Folding Sheet
To discover correspondences between projects in wildly differing fields of research is like hearing a chord that
October 20, 2006 15:43 WSPC/Guidelines paper GRID VERTEX-UNFOLDING ORTHOSTACKS
An Optimal Decomposition Algorithm for Tree Edit Distance Erik D. Demaine, Shay Mozes , Benjamin Rossman, and Oren Weimann
Contemporary Mathematics All Polygons Flip Finitely. . . Right?
Universal Hinge Patterns for Folding Orthogonal Shapes
Push-2-F is PSPACE-Complete Erik D. Demaine Robert A. Hearn y Michael Ho mann z
LOGARITHMIC LOWER BOUNDS IN THE CELLPROBE MODEL # ATRASCU + AND ERIK D. DEMAINE +
SlidingCoin Puzzles Erik D. Demaine Martin L. Demaine #
Frequency Estimation of Internet Packet Streams with Limited Space ?
NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs
Contraction Decomposition in HMinorFree Graphs and Algorithmic Applications
Pushing Blocks is Hard Erik D. Demaine a , Martin L. Demaine a ,
The Distance Geometry of Music Erik D. Demaine # Francisco GomezMartin + Henk Meijer # David Rappaport
Computational Geometry Column 37 Erik D. Demaine \Lambda Joseph O'Rourke y
FunSort ---Or the Chaos of Unordered Binary Search
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Open Problems from CCCG 2003 Erik D. Demaine # Joseph O'Rourke +
Kaboozle is NPcomplete, even in a Strip Tetsuo Asano 1 , Erik D. Demaine 2 , Martin L. Demaine 2 , and Ryuhei Uehara 1
Geodesic HamSandwich Cuts # Prosenjit Bose
Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics
Linearity of Grid Minors in Treewidth with Applications through Bidimensionality #
Two Simpli ed Algorithms for Maintaining Order in a List
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ?
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory #
Minimal Locked Trees Brad Ballinger 1 , David Charlton 2 , Erik D. Demaine 3# , Martin L. Demaine 3 ,
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in
Games on Triangulations Oswin Aichholzer 1 , David Bremner 2 , Erik D. Demaine 3 ,
Lower Bounds for Asymmetric Communication Channels and Distributed Source Coding
The Price of Anarchy in Network Creation Games Erik D. Demaine
Optimally Adaptive Integration of Univariate Lipschitz Functions Erik D. Demaine
Geometric Restrictions on Producible Polygonal Protein Chains
Deflating The Pentagon Erik D. Demaine1
March 25-26, 2004 Seville (Spain) Optimizing a 2D Function Sat-
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
Optimally Adaptive Integration of Univariate Lipschitz Ilya Baran1
Algorithmic Folding Complexity Jean Cardinal1
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Continuous Foldability of Polygonal Paper Erik D. Demaine # Satyan L. Devadoss + Joseph S. B. Mitchell # Joseph O'Rourke
FunSort \Lambda THERESE BIEDL
Unfolding Polyhedral Bands Greg Aloupis Erik D. Demaine y Stefan Langerman z Pat Morin x Joseph O'Rourke {
In nitesimally Locked Linkages with Applications to Locked Trees Robert Connelly Erik D. Demaine y Gunter Rote z
A Linear Lower Bound on Index Size for Text Retrieval Erik D. Demaine Alejandro L opez-Ortiz y
Approximation Algorithms via Contraction Decomposition # Erik D. Demaine + MohammadTaghi Hajiaghayi # Bojan Mohar
The Distance Geometry of Music Erik D. Demaine
Symposium on Theoretical Aspects of Computer Science 2009 (Freiberg, Germany), pp. to appear www.stacsconf.org
Folding a Better Checkerboard Erik D. Demaine 1# , Martin L. Demaine 1 ,
Ununfoldable Polyhedra with Convex Faces Marshall Bern Erik D. Demaine y David Eppstein z
Balanced kColorings Therese C. Biedl c Eowyn
Adaptive Set Intersections, Unions, and Differences Erik D. Demaine \Lambda Alejandro L'opezOrtiz y J. Ian Munro \Lambda
Interlocked Open and Closed Linkages with Few Joints
On Cartesian Trees and Range Minimum Queries
Basic Network Creation Games Noga Alon #
Optimal Dynamic VideoOnDemand using Adaptive Broadcasting
Long Proteins with Unique Optimal Foldings in the H-P Model Oswin Aichholzer David Bremner y Erik D. Demaine z Henk Meijer x
Combination Can Be Hard: Approximability of the Unique Coverage Problem
Hinged Dissection of Polypolyhedra Erik D. Demaine # Martin L. Demaine #
Scheduling to Minimize Gaps and Power Consumption Erik D. Demaine #
PushPushk is PSPACEComplete Erik D. Demaine
Locked and Unlocked Chains of Planar Shapes # Robert Connelly
Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics
Deploying Sensor Networks with Guaranteed Fault Tolerance
Lossless Fault-Tolerant Data Structures with Additive Overhead
CCCG 2008, Montreal, Quebec, August 1315, 2008 Open Problems from CCCG 2007
Separating point sets in polygonal environments Erik D. Demaine Jeff Erickson
SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 3, pp. 531566
Bidimensionality (2004; Demaine, Fomin, Hajiaghayi, Thilikos)
Robot Localization without Depth Perception Erik D. Demaine1
Constraint Logic: A Uniform Framework for Modeling Computation as Games
Revising Quorum Systems for Energy Conservation in Sensor Networks Daniela Tulone
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
Basic Network Creation Games Schools of Mathematics &
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Necklaces, Convolutions, and X + Y David Bremner 1# , Timothy M. Chan 2# , Erik D. Demaine 3## , Je# Erickson 4 ,
Bidimensionality: New Connections between FPT Algorithms and PTASs
CCCG 2006, Kingston, Ontario, August 14--16, 2006 Curves in the Sand: Algorithmic Drawing
A Simpli ed and Dynamic Uni ed Structure Mihai B adoiu and Erik D. Demaine
Decomposition, Approximation, and Coloring of OddMinorFree Graphs
FixedParameter Algorithms for the (k, r)Center in Planar Graphs and Map Graphs
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
A DiskPacking Algorithm for an Origami Magic Trick \Lambda
Algorithmica manuscript No. (will be inserted by the editor)
The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine # Francisco GomezMartin + Henk Meijer # David Rappaport #
CCCG 2010, Winnipeg MB, August 911, 2010 Ghost Chimneys
Degenerative Coordinates in 22.5 Grid System
Approximation Algorithms via Contraction Decomposition Erik D. Demaine
Contraction Decomposition in H-Minor-Free Graphs and Algorithmic Applications
Open Problems from CCCG 2001 Erik D. Demaine
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
The Price of Anarchy in Network Creation Games ERIK D. DEMAINE
CCCG 2010, Winnipeg MB, August 911, 2010 Ghost Chimneys
Reconstructing David Huffman's Legacy in Curved-Crease Origami
Routing Algorithms on Static Interconnection Networks: A Classification Scheme
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity #
The CCCG 2001 Logo by Erik D. Demaine , Martin L. Demaine , and Anna Lubiw
Retroactive Data Structures (extended abstract)
Folding Any Orthogonal Maze Erik D. Demaine
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
On Flat-State Connectivity of Chains with Fixed Acute Angles Greg Aloupis, Erik D. Demaine, Henk Meijer,
Lower Bounds for Asymmetric Communication Channels and Distributed Source Coding
Integer Point Sets Minimizing Average Pairwise L 1 Distance: What is the Optimal Shape of a Town?
UNO is hard, even for a single player Erik D. Demaine 1 , Martin L. Demaine 1 , Ryuhei Uehara 2 ,
Folding Any Orthogonal Maze Erik D. Demaine # Martin L. Demaine # Jason Ku #
Additive Approximation Algorithms for ListColoring MinorClosed Class of Graphs
Discrete & Computational Geometry manuscript No. (will be inserted by the editor)
March 25, 2005 14:14 WSPC/Guidelines chordsep SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Realizing Partitions Respecting Full and Partial Order Information
FoldandCut Magic Erik D. Demaine Martin L. Demaine #
Lower Bounds for Dynamic Connectivity mip@mit.edu
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a
Algorithmica manuscript No. (will be inserted by the editor)
CCCG 2010, Winnipeg MB, August 911, 2010 Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
Scheduling to Minimize Power Consumption using Submodular Functions
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
Hinged Dissections Exist Timothy G. Abbott
The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine
On the Complexity of Origami Design Erik D. Demaine Sandor P. Fekete Robert J. Lang
Linearity of Grid Minors in Treewidth with Applications through Bidimensionality
Linear Reconfiguration of Cube-Style Modular Greg Aloupis1
Minimizing Movement ERIK D. DEMAINE
Interlocked Open Linkages with Few Joints Erik D. Demaine
A Pseudopolynomial Time O(log n)-Approximation Algorithm for Art
Continuous Foldability of Polygonal Paper Erik D. Demaine
Bidimensionality, Map Graphs, and Grid Minors Erik D. Demaine
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 37 (2004) 147159 PII: S0305-4470(04)66800-4
Coin-Moving Puzzles Erik D. Demaine
Contemporary Mathematics Infinitesimally Locked Self-Touching Linkages
Flattening Fixed-Angle Chains Is Strongly NP-Hard
On the Complexity of Origami Design Erik D. Demaine # Sandor P. Fekete + Robert J. Lang #
Representing Trees of Higher Degree # David Benoit + Erik D. Demaine # J. Ian Munro Rajeev Raman
Folding Paper Shopping Bags Devin. J. Balkcom # Erik D. Demaine +
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
Enumerating Foldings and Unfoldings between Polygons and Polytopes
arXiv:cs.CG/0001019 PushPush is NPhard in 2D
Reconfiguring Convex Polygons Oswin Aichholzer \Lambda Erik D. Demaine y Jeff Erickson z Ferran Hurtado x
Open Problems from CCCG 2002 Erik D. Demaine # Joseph O'Rourke +
Discrete & Computational Geometry manuscript No. (will be inserted by the editor)
Exponential Speedup of Fixed-Parameter Algorithms on
Geometric Games on Triangulations Extended Abstract
Correlation Clustering with Partial Information Erik D. Demaine and Nicole Immorlica #
A NOVEL ROUTING ALGORITHM FOR KARY NCUBE INTERCONNECTION NETWORKS
Correlation Clustering in General Weighted Graphs # Erik D. Demaine + Dotan Emanuel # Amos Fiat + Nicole Immorlica #
Short Interlocked Linkages Erik D. Demaine Stefan Langerman y Joseph O'Rourke z
Deflating The Pentagon Erik D. Demaine
Tight Bounds for Dynamic Convex Hull Queries (Again) Erik D. Demaine Mihai Patrascu
Kaboozle is NP-complete, even in a Strip Tetsuo Asano1
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Open Problems from CCCG 2000 Erik D. Demaine \Lambda Joseph O'Rourke y
Recon guring Convex Polygons Oswin Aichholzer Erik D. Demaine y Je Erickson z
MobileAssisted Localization in Wireless Sensor Networks
Optimal Covering Tours with Turn Costs Esther M. Arkin Michael A. Bender y Erik D. Demaine z S andor P. Fekete x
Noname manuscript No. (will be inserted by the editor)
OutputSensitive Algorithms for Computing NearestNeighbour Decision Boundaries #
Open Problems from CCCG 2001 Erik D. Demaine # Joseph O'Rourke +
Minimizing Movement: FixedParameter Tractability
Minimizing Movement Erik D. Demaine # MohammadTaghi Hajiaghayi #+# Hamid Mahini
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
arXiv:cs.CG/0107023 VertexUnfoldings
MORPION SOLITAIRE Erik D. Demaine
Plane Embeddings of Planar Graph Metrics MohammadHossein Bateni
Confluently Persistent Tries for E#cient Version Control #
The Price of Anarchy in Cooperative Network Creation Games
Geometric Restrictions on Producible Polygonal Protein Chains
Long Proteins with Unique Optimal Foldings in the H-P Model ?
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacsconf.org
Robot Localization without Depth Perception Erik D. Demaine 1 , Alejandro L opez-Ortiz 2 , and J. Ian Munro 2
A Note on Reconfiguring Tree Linkages: Trees can Lock
Solitaire Clobber Erik D. Demaine 1 , Martin L. Demaine 1 , and Rudolf Fleischer 2
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space) #
Generalized Communicators in the Message Passing Interface
Straightening Polygonal Arcs and Convexifying Polygonal Cycles
The Bidimensional Theory of Bounded-Genus Graphs
Plane Embeddings of Planar Graph Metrics MohammadHossein Bateni
Lower Bounds for Dynamic Connectivity Mihai Patrascu
Hinged Dissection of Polyominoes and Polyforms Erik D. Demaine
Long Proteins with Unique Optimal Foldings in the H-P Model
Identifying Frequent Items in Sliding Windows over On-Line Packet Streams
Quickly deciding minor-closed parameters in general graphs
FixedParameter Algorithms for (k, r)Center in Planar Graphs and Map Graphs
Subquadratic Algorithms for 3SUM Ilya Baran, Erik D. Demaine, and Mihai Patrascu
(Non)existence of Pleated Folds: How Paper Folds Between Creases #
Contemporary Mathematics All Polygons Flip Finitely. . . Right?
A Linear Lower Bound on Index Size for Text Retrieval Erik D. Demaine Alejandro L opez-Ortiz y
On FlatState Connectivity of Chains with Fixed Acute Angles # Greg Aloupis, Erik D. Demaine, Henk Meijer,
Fast Allocation and Deallocation with an Improved Buddy System #
Subexponential parameterized algorithms on graphs of boundedgenus and Hminorfree graphs
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
Bidimensional Parameters and Local Treewidth ? Erik D. Demaine 1 , Fedor V. Fomin 2 , MohammadTaghi Hajiaghayi 1 , and
Identifying Frequent Items in Sliding Windows over OnLine Packet Streams #
VERTEXUNFOLDINGS OF SIMPLICIAL MANIFOLDS ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technol
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
DYNAMIC OPTIMALITY---ALMOST # ERIK D. DEMAINE + , DION HARMON + , JOHN IACONO # , AND MIHAI P
Approximability of Partitioning Graphs with Supply and Demand
Algorithmica manuscript No. (will be inserted by the editor)
Algorithmica manuscript No. (will be inserted by the editor)
Realizing Partitions Respecting Full and Partial Order Information
Cache-Oblivious Algorithms and Data Structures
Fast Allocation and Deallocation with an Improved Buddy System
Wrapping Spheres with Flat Paper Erik D. Demaine
Puzzles, Art, and Magic with Algorithms Erik D. Demaine
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)
OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES
On the Complexity of Halfspace Volume Queries Erik D. Demaine
Refolding Planar Polygons Hayley N. Iben
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
Noname manuscript No. (will be inserted by the editor)
Approximation Algorithms via Structural Results for ApexMinorFree Graphs
CacheOblivious Algorithms and Data Structures
A Linear Lower Bound on Index Size for Text Retrieval Erik D. Demaine Alejandro L opez-Ortiz y
Morpion Solitaire Erik D. Demaine
Coin-Moving Puzzles Erik D. Demaine Martin L. Demaine Helena A. Verrill y
Tight Bounds for the PartialSums Problem Mihai Patrascu # Erik D. Demaine #
Hinged Dissection of Polyominoes and Polyforms Erik D. Demaine # Martin L. Demaine #
April 22, 2007 20:34 Journal of Mathematics and the Arts sonaArt Journal of Mathematics and the Arts, Vol. 00, No. 00, Month 200x, 1--9
Interlocked Open Linkages with Few Joints # Erik D. Demaine
Deploying Sensor Networks with Guaranteed Fault Tolerance
Bidimensionality (2004; Demaine, Fomin, Hajiaghayi, Thilikos)
Enumerating Foldings and Unfoldings between Polygons and Polytopes
Solitaire Clobber Erik D. Demaine 1 Martin L. Demaine 1 Rudolf Fleischer 2
CacheOblivious Dynamic Dictionaries with Update/Query Tradeoffs Gerth Stlting Brodal #+ Erik D. Demaine #+ Jeremy T. Fineman # John Iacono
Straightening Polygonal Arcs and Convexifying Polygonal Cycles
Wrapping the Mozartkugel Erik D. Demaine # Martin L. Demaine # John Iacono + Stefan Langerman #
Open Problems from CCCG 2004 Erik D. Demaine
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the
THE BIDIMENSIONAL THEORY OF BOUNDED-GENUS GRAPHS ERIK D. DEMAINE, MOHAMMADTAGHI HAJIAGHAYI, AND
Optimal Dynamic Video-On-Demand using Adaptive Broadcasting
Frequency Estimation of Internet Packet Streams with Limited Space
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Erratum for "Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs"
Discrete & Computational Geometry manuscript No. (will be inserted by the editor)
CCCG 2009, Vancouver, BC, August 17--19, 2009 Integer Point Sets Minimizing Average Pairwise # 1 Distance
Puzzles, Art, and Magic with Algorithms # Erik D. Demaine + Martin L. Demaine #
On Universally Easy Classes for NP-complete Problems Erik D. Demaine Alejandro L opez-Ortiz y J. Ian Munro
Push-2-F is PSPACE-Complete Erik D. Demaine Robert A. Hearn y Michael Ho mann z
Contemporary Mathematics In nitesimally Locked Self-Touching Linkages
C to Java: Converting Pointers into References Erik D. Demaine
0849385245/97/$0.00+$.50 #2002 by CRC Press LLC
Flipturning Polygons (Extended abstract)
CacheOblivious Algorithms and Data Structures
Puzzles, Art, and Magic with Algorithms Erik D. Demaine
Playing with Triangulations Oswin Aichholzer 1 , David Bremner 2 , Erik D. Demaine 3 ,
EdgeUnfolding Nested Polyhedral Bands # Greg Aloupis a,1 , Erik D. Demaine b,2 , Stefan Langerman c,3 ,
1 Introduction 1 2 Linkages 2
Finding a Divisible Pair # Stelian Ciurea + Erik D. Demaine # Corina E. Patrascu Mihai Patrascu #
Planar Embeddings of Graphs with Specified Edge Lengths
Generalized DForms Have No Spurious Creases Erik D. Demaine # and Gregory N. Price +
Approximation Schemes for Planar Graph Problems (1983, 1994; Baker)
Open Problems on Polytope Reconstruction Erik D. Demaine Je Erickson y
Separating point sets in polygonal environments Erik D. Demaine Je# Erickson
cs.CG/9910009 Locked and Unlocked
CCCG 2006, Kingston, Ontario, August 14--16, 2006 Open Problems from CCCG 2005
The Price of Anarchy in Network Creation Games Erik D. Demaine #
CCCG 2006, Kingston, Ontario, August 1416, 2006 Polygons Flip Finitely: Flaws and a Fix
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
CCCG 2007, Ottawa, Ontario, August 2022, 2007 Disjoint Segments have Convex Partitions
The Geometry of Binary Search Trees Erik D. Demaine
Hinged Dissections Exist Timothy G. Abbott
Games on Triangulations Oswin Aichholzer1
A Simplified and Dynamic Unified Structure Mihai Badoiu and Erik D. Demaine
Additive Approximation Algorithms for List-Coloring Minor-Closed Class of Graphs
Minimizing the Diameter of a Network using Shortcut Edges
Confluently Persistent Tries for E#cient Version Control
Reaching Folded States of a Rectangular Piece of Paper Erik D. Demaine Joseph S. B. Mitchell y
Tetris is Hard, Even to Approximate Erik D. Demaine Susan Hohenberger David Liben-Nowell
Graphs Excluding a Fixed Minor have Grids as Large as Treewidth, with Combinatorial and Algorithmic Applications through Bidimensionality
Folding Paper Shopping Bags # Devin J. Balkcom + Erik D. Demaine # Martin L. Demaine # John A. Ochsendorf
The Price of Anarchy in Network Creation Games ERIK D. DEMAINE
A Disk-Packing Algorithm for an Origami Magic Trick
PUZZLES, ART, AND MAGIC WITH ALGORITHMS Erik D. Demaine
arXiv:cs.CG/0007019 Examples, Counterexamples, and
Universal Hinge Patterns to Fold Orthogonal Shapes Nadia M. Benbernou # Erik D. Demaine #+
When Can You Fold a Map? Esther M. Arkin # Michael A. Bender + Erik D. Demaine # Martin L. Demaine #
Open Problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
Open Problems from CCCG 2004 Erik D. Demaine # Joseph O'Rourke +
Dynamic Optimality---Almost Erik D. Demaine #+ Dion Harmon # John Iacono #+ Mihai Patrascu #
FINDING A DIVISIBLE PAIR AND A GOOD WOODEN FENCE Stelian Ciurea
Tetris is Hard, Even to Approximate Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell
Optimizing a 2D Function Satisfying Unimodality Properties
Subexponential Parameterized Algorithms on BoundedGenus Graphs and HMinorFree Graphs
Retroactive Data Structures ERIK D. DEMAINE
Subquadratic Algorithms for 3SUM Ilya Baran Erik D. Demaine Mihai Patrascu
An EnergyDriven Approach to Linkage Unfolding Jason H. Cantarella # Erik D. Demaine + Hayley N. Iben # James F. O'Brien
The Bidimensional Theory of BoundedGenus Graphs #
Locked and Unlocked Chains of Planar Shapes Robert Connelly
Recent Results in Computational Origami Erik D. Demaine
1 Introduction 1 2 Linkages 2
CCCG 2006, Kingston, Ontario, August 1416, 2006 Linkage Folding: From Erdos to Proteins
Algorithmica manuscript No. (will be inserted by the editor)
Matching Points with Things Greg Aloupis
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane Timothy Abbott
The Complexity of the Dyson Telescopes Puzzle Erik D. Demaine 1
Efficient Tree Layout in a Multilevel Memory Hierarchy Stephen Alstrup
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space)
Straightening Polygonal Arcs and Convexifying Polygonal Cycles
Tetris is Hard, Even to Approximate Erik D. Demaine
Metamorphosis of the Cube Erik Demaine Martin Demaine Anna Lubiw
Coin-Flipping Magic Nadia Benbernou
Polyhedral Sculptures with Hyperbolic Paraboloids Erik D. Demaine Martin L. Demaine Anna Lubiw
Frequency Estimation of Internet Packet Streams with Limited Space
Exponential Speedup of Fixed Parameter Algorithms on K3,3-minor-free or K5-minor-free Graphs
Open Problems from Dagstuhl Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Folding and Unfolding Erik D. Demaine
Minimizing the Diameter of a Network using Shortcut Edges
On Universally Easy Classes for NP-complete Problems
EWCG 2007, Graz, March 1921, 2007 Computational Geometry through the Information Lens
April 8, 2004 9:50 WSPC/Guidelines tetris International Journal of Computational Geometry & Applications
Hinged Dissections Exist Timothy G. Abbott #
Proximate Point Searching Erik D. Demaine
Wrapping Spheres with Flat Paper # Erik D. Demaine +# Martin L. Demaine + John Iacono Stefan Langerman
Kary Clustering with Optimal Leaf Ordering for Gene Expression Data
Dynamic HamSandwich Cuts of Convex Polygons in the Plane Timothy Abbott # Erik D. Demaine # Martin L. Demaine # Daniel Kane # Stefan Langerman +
Locked and Unlocked Polygonal Chains in 3D
Quickly deciding minorclosed parameters in general graphs
The Stackelberg Minimum Spanning Tree Game # Jean Cardinal 1 , Erik D. Demaine 2 , Samuel Fiorini 3 ,
Planar Embeddings of Graphs with Specified Edge Lengths #
Hinged Dissections Exist Timothy G. Abbott #+ Zachary Abel # David Charlton
COMBINATION CAN BE HARD: APPROXIMABILITY OF THE UNIQUE COVERAGE PROBLEM #
MORPION SOLITAIRE Erik D. Demaine
Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
Dynamic Ham-Sandwich Cuts in the Plane Timothy G. Abbott
Open Problems from Dagstuhl Seminar 09511: Parameterized Complexity and Approximation Algorithms
Cache-Oblivious B-Trees Michael A. Bender
Reconfigurable Asynchronous Logic Automata Neil Gershenfeld David Dalrymple Kailiang Chen Ara Knaian
Approximability of Partitioning Graphs with Supply and Demand
Fun-Sort --Or the Chaos of Unordered Binary Search
Hinged Dissection of Polypolyhedra Erik D. Demaine1
Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve
When Can You Fold a Map? Esther M. Arkin
Proceedings of the 12th International Conference on Networks 2004 (ICON 2004), Singapore, November 2004. EpiChord: Parallelizing the Chord Lookup
Wrapping the Mozartkugel Erik D. Demaine
Folding and Unfolding Linkages, Paper, and Polyhedra
LOGARITHMIC LOWER BOUNDS IN THE CELL-PROBE MODEL MIHAI PATRASCU AND ERIK D. DEMAINE
Minimizing Movement: Fixed-Parameter Tractability
Coverage with k-Transmitters in the Presence of Obstacles
Solitaire Clobber Erik D. Demaine1
Symposium on Theoretical Aspects of Computer Science 2009 (Freiberg, Germany), pp. to appear www.stacs-conf.org
An Energy-Driven Approach to Linkage Unfolding Jason H. Cantarella
CCCG 2006, Kingston, Ontario, August 14--16, 2006 Polygons Flip Finitely: Flaws and a Fix
Scheduling to Minimize Power Consumption using Submodular Functions
Approximation Algorithms via Contraction Decomposition Erik D. Demaine # MohammadTaghi Hajiaghayi + Bojan Mohar #
An Optimal Decomposition Algorithm for Tree Edit Distance # Erik D. Demaine, Shay Mozes ## , Benjamin Rossman, and Oren Weimann
Flat-State Connectivity of Linkages under Dihedral Motions ?
BIDIMENSIONAL PARAMETERS AND LOCAL TREEWIDTH # ERIK D. DEMAINE + , FEDOR V. FOMIN # , MOHAMMADTAGHI HAJIAGHAYI , AND
Remarks on Separating Words Erik D. Demaine 1 , Sarah Eisenstat 1 , Je#rey Shallit 2 , and David A. Wilson 1
Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine
Computing Signed Permutations of Polygons Greg Aloupis y Prosenjit Bose z Erik D. Demaine x
The Geometry of Binary Search Trees # Erik D. Demaine + Dion Harmon # John Iacono Daniel Kane Mihai Patrascu +
Palindrome Recognition Using a Multidimensional Tape
THE BIDIMENSIONAL THEORY OF BOUNDEDGENUS GRAPHS # ERIK D. DEMAINE + , MOHAMMADTAGHI HAJIAGHAYI # , AND
Experiments on Adaptive Set Intersections for Text Retrieval Systems
March 25, 2005 8:15 WSPC/Guidelines chordsep SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Deflating The Pentagon Erik D. Demaine Martin L. Demaine Diane L. Souvaine Perouz Taslakian
Noname manuscript No. (will be inserted by the editor)
Algorithms for Solving Rubik's Cubes Erik D. Demaine1
O(1)-Approximations for Maximum Movement Piotr Berman1
One-Dimensional Staged Self-Assembly Erik D. Demaine1
Making Polygons by Simple Folds and One Straight Cut
CCCG 2011, Toronto ON, August 1012, 2011 Open Problems from CCCG 2010
CCCG 2010, Winnipeg MB, August 911, 2010 Open Problems from CCCG 2009
10th Canadian Conference on Computational Geometry HIDING DISKS IN FOLDED POLYGONS
Planar Drawings of Origami Polyhedra Erik D. Demaine Martin L. Demaine
OneDimensional Staged SelfAssembly Erik D. Demaine 1 , Sarah Eisenstat 1 ,
Making Polygons by Simple Folds and One Straight Cut
Convexifying Monotone Polygons Therese C. Biedl \Lambday Erik D. Demaine \Lambda Sylvain Lazard zy
Common Unfoldings of Polyominoes and Polycubes
Folding Equilateral Plane Graphs Zachary Abel1
Constant Price of Anarchy in Network Creation Games via Public Service Advertising
Algorithmic Folding Complexity Jean Cardinal1
Constant Price of Anarchy in Network Creation Games via Public Service Advertising
Curved Crease Folding a Review on Art, Design and Mathematics
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with