A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks. - Erik D. Demaine; Sampalli Srinivas (Int. J. High Speed Comput., 1996)

On reconfiguring tree linkages: Trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (CCCG, 1998)

Unfolding some classes of orthogonal polyhedra. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Mark H. Overmars; Joseph O'Rourke; Steve Robbins; Sue Whitesides (CCCG, 1998)

Hiding disks in folded polygons. - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Godfried T. Toussaint (CCCG, 1998)

Planar Drawings of Origami Polyhedra. - Erik D. Demaine; Martin L. Demaine (GD, 1998)

Protocols for Non-Deterministic Communication over Synchronous Channels. - Erik D. Demaine (IPPS/SPDP, 1998)

Folding and Cutting Paper. - Erik D. Demaine; Martin L. Demaine; Anna Lubiw (JCDCG, 1998)

C to Java: Converting Pointers into References. - Erik D. Demaine (Concurr. Pract. Exp., 1998)

Ununfoldable polyhedra. - Marshall W. Bern; Erik D. Demaine; David Eppstein; Eric Kuo (CCCG, 1999)

Hinged dissections of polyominoes and polyforms. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Erich Friedman (CCCG, 1999)

Metamorphosis of the Cube. - Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Joseph O'Rourke; Irena Pashchenko (SCG, 1999)

Fast Allocation and Deallocation with an Improved Buddy System. - Erik D. Demaine; J. Ian Munro (FSTTCS, 1999)

Convexifying Monotone Polygons. - Therese C. Biedl; Erik D. Demaine; Sylvain Lazard; Steven M. Robbins; Michael A. Soss (ISAAC, 1999)

Locked and Unlocked Polygonal Chains in 3D. - Therese 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 (SODA, 1999)

Folding and One Straight Cut Suffice. - Erik D. Demaine; Martin L. Demaine; Anna Lubiw (SODA, 1999)

Representing Trees of Higer Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Venkatesh Raman 001 (WADS, 1999)

Resizable Arrays in Optimal Time and Space. - Andrej Brodnik; Svante Carlsson; Erik D. Demaine; J. Ian Munro; Robert Sedgewick (WADS, 1999)

Computational geometry column 37. - Erik D. Demaine; Joseph O'Rourke (SIGACT News, 1999)

PushPush and Push-1 are NP-hard in 2D. - Erik D. Demaine; Martin L. Demaine; Joseph O'Rourke (CCCG, 2000)

Session O1: Open Problems and Planning. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2000)

Every Polygon Can Be Untangled. - Robert Connelly; Erik D. Demaine; Günter Rote (EuroCG, 2000)

Straighting Polygonal Arcs and Convexifying Polygonal Cycles. - Robert Connelly; Erik D. Demaine; Günter Rote (FOCS, 2000)

Folding and Unfolding Linkages, Paper, and Polyhedra. - Erik D. Demaine (JCDCG, 2000)

Adaptive set intersections, unions, and differences. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SODA, 2000)

Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. - Erik D. Demaine; Martin L. Demaine; Joseph S. B. Mitchell (Comput. Geom., 2000)

Phutball Endgames are Hard - Erik D. Demaine; Martin L. Demaine; David Eppstein (CoRR, 2000)

PushPush is NP-hard in 2D - Erik D. Demaine; Martin L. Demaine; Joseph O'Rourke (CoRR, 2000)

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes - Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Joseph O'Rourke (CoRR, 2000)

Experiments on Adaptive Set Intersections for Text Retrieval Systems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ALENEX, 2001)

The cccg 2001 logo. - Erik D. Demaine; Martin L. Demaine; Anna Lubiw (CCCG, 2001)

Pushing blocks is np-complete for noncrossing solution paths. - Erik D. Demaine; Michael Hoffmann 001 (CCCG, 2001)

Short interlocked linkages. - Erik D. Demaine; Stefan Langerman; Joseph O'Rourke (CCCG, 2001)

Reaching folded states of a rectangular piece of paper. - Erik D. Demaine; Joseph S. B. Mitchell (CCCG, 2001)

Open problems from cccg 2000. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2001)

Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. - Erik D. Demaine (MFCS, 2001)

Reconfiguring convex polygons. - Oswin Aichholzer; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; Mark H. Overmars; Michael A. Soss; Godfried T. Toussaint (Comput. Geom., 2001)

Polygons cuttable by a circular saw. - Erik D. Demaine; Martin L. Demaine; Craig S. Kaplan (Comput. Geom., 2001)

The Complexity of Clickomania - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Lars Jacobsen; J. Ian Munro (CoRR, 2001)

Vertex-Unfoldings of Simplicial Polyhedra - Erik D. Demaine; David Eppstein; Jeff Erickson 001; George W. Hart; Joseph O'Rourke (CoRR, 2001)

Locked and Unlocked Polygonal Chains in Three Dimensions. - Therese 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 (Discret. Comput. Geom., 2001)

Efficient Algorithms for Petersen's Matching Theorem. - Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw (J. Algorithms, 2001)

Generalized Communicators in the Message Passing Interface. - Erik D. Demaine; Ian T. Foster; Carl Kesselman; Marc Snir (IEEE Trans. Parallel Distributed Syst., 2001)

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (APPROX, 2002)

On flat-state connectivity of chains with fixed acute angles. - Greg Aloupis; Erik D. Demaine; Henk Meijer; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2002)

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Paul Nijjar; Ryuhei Uehara; Ming-wei Wang (CCCG, 2002)

Push-2-f is pspace-complete. - Erik D. Demaine; Robert A. Hearn; Michael Hoffmann 001 (CCCG, 2002)

Open problems from cccg 2001. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2002)

Vertex-unfoldings of simplicial manifolds. - Erik D. Demaine; David Eppstein; Jeff Erickson 001; George W. Hart; Joseph O'Rourke (SCG, 2002)

Interlocked open linkages with few joints. - Erik D. Demaine; Stefan Langerman; Joseph O'Rourke; Jack Snoeyink (SCG, 2002)

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. - Michael A. Bender; Richard Cole 001; Erik D. Demaine; Martin Farach-Colton (ESA, 2002)

Two Simplified Algorithms for Maintaining Order in a List. - Michael A. Bender; Richard Cole 001; Erik D. Demaine; Martin Farach-Colton; Jack Zito (ESA, 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy. - Michael A. Bender; Erik D. Demaine; Martin Farach-Colton (ESA, 2002)

Frequency Estimation of Internet Packet Streams with Limited Space. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ESA, 2002)

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. - Robert A. Hearn; Erik D. Demaine (ICALP, 2002)

Flat-State Connectivity of Linkages under Dihedral Motions. - Greg Aloupis; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Stefan Langerman; Henk Meijer; Joseph O'Rourke; Mark H. Overmars; Michael A. Soss; Ileana Streinu; Godfried T. Toussaint (ISAAC, 2002)

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (ISAAC, 2002)

Playing with Triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (JCDCG, 2002)

Cache-oblivious priority queue and graph algorithm applications. - Lars Arge; Michael A. Bender; Erik D. Demaine; Bryan Holland-Minkley; J. Ian Munro (STOC, 2002)

Robot Localization without Depth Perception. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SWAT, 2002)

Open Problems from CCCG 2002 - Erik D. Demaine; Joseph O'Rourke (CoRR, 2002)

Coin-Moving Puzzles - Erik D. Demaine; Martin L. Demaine; Helena A. Verrill (CoRR, 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy - Stephen Alstrup; Michael A. Bender; Erik D. Demaine; Martin Farach-Colton; J. Ian Munro; Theis Rauhe; Mikkel Thorup (CoRR, 2002)

A note on reconfiguring tree linkages: trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Appl. Math., 2002)

Flipturning Polygons. - Oswin Aichholzer; Carmen Cortés; Erik D. Demaine; Vida Dujmovic; Jeff Erickson 001; Henk Meijer; Mark H. Overmars; Belén Palop; Suneeta Ramaswami; Godfried T. Toussaint (Discret. Comput. Geom., 2002)

Balanced k-colorings. - Therese C. Biedl; Eowyn Cenek; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Ming-wei Wang (Discret. Math., 2002)

Enumerating Foldings and Unfoldings Between Polygons and Polytopes. - Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Joseph O'Rourke (Graphs Comb., 2002)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; Alejandro López-Ortiz; Pat Morin; J. Ian Munro (Int. J. Comput. Geom. Appl., 2002)

Open Problems from ALENEX 2003. - Erik D. Demaine (ALENEX, 2003)

On the Complexity of Halfspace Volume Queries. - Erik D. Demaine; Jeff Erickson 001; Stefan Langerman (CCCG, 2003)

Hinged Dissection of Polygons is Hard. - Robert A. Hearn; Erik D. Demaine; Greg N. Frederickson (CCCG, 2003)

Tetris is Hard, Even to Approximate. - Erik D. Demaine; Susan Hohenberger; David Liben-Nowell (COCOON, 2003)

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. - Therese Biedl; Erik D. Demaine; Alexander Golynski; Joseph Douglas Horton; Alejandro López-Ortiz; Guillaume Poirier; Claude-Guy Quimper (ESA, 2003)

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. - Erik D. Demaine; Fedor V. Fomin; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (ICALP, 2003)

Identifying frequent items in sliding windows over on-line packet streams. - Lukasz Golab; David DeHaan; Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (Internet Measurement Conference, 2003)

Correlation Clustering with Partial Information. - Erik D. Demaine; Nicole Immorlica (RANDOM-APPROX, 2003)

Anchor-free distributed localization in sensor networks. - Nissanka Bodhi Priyantha; Hari Balakrishnan; Erik D. Demaine; Seth J. Teller (SenSys, 2003)

K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. - Ziv Bar-Joseph; Erik D. Demaine; David K. Gifford; Nathan Srebro; Angèle M. Hamel; Tommi S. Jaakkola (Bioinform., 2003)

Long proteins with unique optimal foldings in the H-P model. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Henk Meijer; Vera Sacristán; Michael A. Soss (Comput. Geom., 2003)

Ununfoldable polyhedra with convex faces. - Marshall W. Bern; Erik D. Demaine; David Eppstein; Eric Kuo; Andrea Mantler; Jack Snoeyink (Comput. Geom., 2003)

Pushing blocks is hard. - Erik D. Demaine; Martin L. Demaine; Michael Hoffmann 001; Joseph O'Rourke (Comput. Geom., 2003)

Interlocked open and closed linkages with few joints. - Erik D. Demaine; Stefan Langerman; Joseph O'Rourke; Jack Snoeyink (Comput. Geom., 2003)

Straightening Polygonal Arcs and Convexifying Polygonal Cycles. - Robert Connelly; Erik D. Demaine; Günter Rote (Discret. Comput. Geom., 2003)

A linear lower bound on index size for text retrieval. - Erik D. Demaine; Alejandro López-Ortiz (J. Algorithms, 2003)

Palindrome recognition using a multidimensional tape. - Therese Biedl; Jonathan F. Buss; Erik D. Demaine; Martin L. Demaine; Mohammad Taghi Hajiaghayi; Tomás Vinar (Theor. Comput. Sci., 2003)

On universally easy classes for NP-complete problems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (Theor. Comput. Sci., 2003)

Unfolding polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2004)

Continuous foldability of polygonal paper. - Erik D. Demaine; Satyan L. Devadoss; Joseph S. B. Mitchell; Joseph O'Rourke (CCCG, 2004)

An energy-driven approach to linkage unfolding. - Jason H. Cantarella; Erik D. Demaine; Hayley N. Iben; James F. O'Brien (SCG, 2004)

04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. - Lars Arge; Michael A. Bender; Erik D. Demaine; Charles E. Leiserson; Kurt Mehlhorn (Cache-Oblivious and Cache-Aware Algorithms, 2004)

Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (GD, 2004)

Puzzles, Art, and Magic with Algorithms. - Erik D. Demaine (ISAAC, 2004)

A Simplified, Dynamic Unified Structure. - Mihai Badoiu; Erik D. Demaine (LATIN, 2004)

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. - Erik D. Demaine; Fedor V. Fomin; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (SODA, 2004)

Equivalence of local treewidth and linear local treewidth and its algorithmic applications. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (SODA, 2004)

Interpolation search for non-independent data. - Erik D. Demaine; Thouis R. Jones; Mihai Patrascu (SODA, 2004)

Tight bounds for the partial-sums problem. - Mihai Patrascu; Erik D. Demaine (SODA, 2004)

Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. - Lukasz Golab; David DeHaan; Alejandro López-Ortiz; Erik D. Demaine (SSDBM, 2004)

Lower bounds for dynamic connectivity. - Mihai Patrascu; Erik D. Demaine (STOC, 2004)

Diameter and Treewidth in Minor-Closed Graph Families, Revisited. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (Algorithmica, 2004)

When can you fold a map? - Esther M. Arkin; Michael A. Bender; Erik D. Demaine; Martin L. Demaine; Joseph S. B. Mitchell; Saurabh Sethia; Steven Skiena (Comput. Geom., 2004)

Proximate point searching. - Erik D. Demaine; John Iacono; Stefan Langerman (Comput. Geom., 2004)

Worst-Case Optimal Tree Layout in a Memory Hierarchy - Erik D. Demaine; John Iacono; Stefan Langerman (CoRR, 2004)

Fun-Sort–or the chaos of unordered binary search. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Rudolf Fleischer; Mordecai J. Golin; James A. King; J. Ian Munro (Discret. Appl. Math., 2004)

Tight bounds on maximal and maximum matchings. - Therese Biedl; Erik D. Demaine; Christian A. Duncan; Rudolf Fleischer; Stephen G. Kobourov (Discret. Math., 2004)

Tetris is hard, even to approximate. - Ron Breukelaar; Erik D. Demaine; Susan Hohenberger; Hendrik Jan Hoogeboom; Walter A. Kosters; David Liben-Nowell (Int. J. Comput. Geom. Appl., 2004)

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2004)

Bidimensional Parameters and Local Treewidth. - Erik D. Demaine; Fedor V. Fomin; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2004)

Finding hidden independent sets in interval graphs. - Therese Biedl; Brona Brejová; Erik D. Demaine; Angèle M. Hamel; Alejandro López-Ortiz; Tomás Vinar (Theor. Comput. Sci., 2004)

Solitaire Clobber. - Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer (Theor. Comput. Sci., 2004)

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. - Erik D. Demaine; Rudolf Fleischer; Aviezri S. Fraenkel; Richard J. Nowakowski (Theor. Comput. Sci., 2004)

Geometry and Topology of Polygonal Linkages. - Robert Connelly; Erik D. Demaine (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. - Timothy G. Abbott; Erik D. Demaine; Martin L. Demaine; Daniel Kane 001; Stefan Langerman; Jelani Nelson; Vincent Yeung (CCCG, 2005)

The Distance Geometry of Deep Rhythms and Scales. - Erik D. Demaine; Francisco Gomez-Martin; Henk Meijer; David Rappaport; Perouz Taslakian; Godfried T. Toussaint; Terry Winograd; David R. Wood (CCCG, 2005)

Optimizing a 2D Function Satisfying Unimodality Properties. - Erik D. Demaine; Stefan Langerman (ESA, 2005)

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Ken-ichi Kawarabayashi (FOCS, 2005)

Mobile-assisted localization in wireless sensor networks. - Nissanka Bodhi Priyantha; Hari Balakrishnan; Erik D. Demaine; Seth J. Teller (INFOCOM, 2005)

Deploying sensor networks with guaranteed capacity and fault tolerance. - Jonathan Bredin; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Daniela Rus (MobiHoc, 2005)

Bidimensionality: new connections between FPT algorithms and PTASs. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (SODA, 2005)

Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (SODA, 2005)

PersiFS: a versioned file system with an efficient representation. - Dan R. K. Ports; Austin T. Clements; Erik D. Demaine (SOSP, 2005)

Communication-Aware Processor Allocation for Supercomputers. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (WADS, 2005)

Hinged Dissection of Polypolyhedra. - Erik D. Demaine; Martin L. Demaine; Jeffrey F. Lindy; Diane L. Souvaine (WADS, 2005)

Fast allocation and deallocation with an improved buddy system. - Gerth Stølting Brodal; Erik D. Demaine; J. Ian Munro (Acta Informatica, 2005)

Representing Trees of Higher Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (Algorithmica, 2005)

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (Algorithmica, 2005)

Hinged dissection of polyominoes and polyforms. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Greg N. Frederickson; Erich Friedman (Comput. Geom., 2005)

Bidimensionality, Map Graphs, and Grid Minors - Erik D. Demaine; MohammadTaghi Hajiaghayi (CoRR, 2005)

De Dictionariis Dynamicis Pauco Spatio Utentibus - Erik D. Demaine; Friedhelm Meyer auf der Heide; Rasmus Pagh; Mihai Patrascu (CoRR, 2005)

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. - David Bremner; Erik D. Demaine; Jeff Erickson 001; John Iacono; Stefan Langerman; Pat Morin; Godfried T. Toussaint (Discret. Comput. Geom., 2005)

Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve. - Ilya Baran; Erik D. Demaine (Int. J. Comput. Geom. Appl., 2005)

Separating Point Sets in Polygonal Environments. - Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Mark H. Overmars; Sue Whitesides (Int. J. Comput. Geom. Appl., 2005)

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. - Erik D. Demaine; Fedor V. Fomin; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (J. ACM, 2005)

Optimal Covering Tours with Turn Costs. - Esther M. Arkin; Michael A. Bender; Erik D. Demaine; Sándor P. Fekete; Joseph S. B. Mitchell; Saurabh Sethia (SIAM J. Comput., 2005)

Cache-Oblivious B-Trees. - Michael A. Bender; Erik D. Demaine; Martin Farach-Colton (SIAM J. Comput., 2005)

Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. - Erik D. Demaine; Fedor V. Fomin; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (ACM Trans. Algorithms, 2005)

Games on triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (Theor. Comput. Sci., 2005)

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. - Robert A. Hearn; Erik D. Demaine (Theor. Comput. Sci., 2005)

Curves in the Sand: Algorithmic Drawing. - 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; et al. (CCCG, 2006)

Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. - Erik D. Demaine (CCCG, 2006)

Polygons Flip Finitely: Flaws and a Fix. - Erik D. Demaine; Blaise Gassend; Joseph O'Rourke; Godfried T. Toussaint (CCCG, 2006)

Open Problems: Open Problems from CCCG 2005. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2006)

Necklaces, Convolutions, and X + Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Perouz Taslakian (ESA, 2006)

Origami, Linkages, and Polyhedra: Folding with Algorithms. - Erik D. Demaine (ESA, 2006)

De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). - Erik D. Demaine; Friedhelm Meyer auf der Heide; Rasmus Pagh; Mihai Patrascu (LATIN, 2006)

Lower bounds for asymmetric communication channels and distributed source coding. - Micah Adler; Erik D. Demaine; Nicholas J. A. Harvey; Mihai Patrascu (SODA, 2006)

Geometric Restrictions on Producible Polygonal Protein Chains. - Erik D. Demaine; Stefan Langerman; Joseph O'Rourke (Algorithmica, 2006)

EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management. - Ben Leong; Barbara Liskov; Erik D. Demaine (Comput. Commun., 2006)

An O(n^3)-Time Algorithm for Tree Edit Distance - Erik D. Demaine; Shay Mozes; Benjamin Rossman; Oren Weimann (CoRR, 2006)

Low-Dimensional Embedding with Extra Information. - Mihai Badoiu; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Piotr Indyk (Discret. Comput. Geom., 2006)

Puzzles, Art, and Magic with Algorithms. - Erik D. Demaine; Martin L. Demaine (Theory Comput. Syst., 2006)

Morpion Solitaire. - Erik D. Demaine; Martin L. Demaine; Arthur Langerman; Stefan Langerman (Theory Comput. Syst., 2006)

Logarithmic Lower Bounds in the Cell-Probe Model. - Mihai Patrascu; Erik D. Demaine (SIAM J. Comput., 2006)

The Bidimensional Theory of Bounded-Genus Graphs. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2006)

Correlation clustering in general weighted graphs. - Erik D. Demaine; Dotan Emanuel; Amos Fiat; Nicole Immorlica (Theor. Comput. Sci., 2006)

Online searching with turn cost. - Erik D. Demaine; Sándor P. Fekete; Shmuel Gal (Theor. Comput. Sci., 2006)

Geometric folding algorithms - linkages, origami, polyhedra. - Erik D. Demaine; Joseph O'Rourke (Cambridge University Press, 2007)

Vertex Pops and Popturns. - 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 (CCCG, 2007)

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. - Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Michael Hoffmann 001; Mashhood Ishaque; Diane L. Souvaine; Csaba D. Tóth (CCCG, 2007)

On Rolling Cube Puzzles. - Kevin Buchin; Maike Buchin; Erik D. Demaine; Martin L. Demaine; Dania El-Khechen; Sándor P. Fekete; Christian Knauer; André Schulz 001; Perouz Taslakian (CCCG, 2007)

Open Problems from CCCG 2006. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2007)

Tight bounds for dynamic convex hull queries (again). - Erik D. Demaine; Mihai Patrascu (SCG, 2007)

07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. - Erik D. Demaine; Gregory Z. Gutin; Dániel Marx; Ulrike Stege (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. - Erik D. Demaine; Gregory Z. Gutin; Dániel Marx; Ulrike Stege (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

Deflating the Pentagon. - Erik D. Demaine; Martin L. Demaine; Thomas Fevens; Antonio Mesa; Michael A. Soss; Diane L. Souvaine; Perouz Taslakian; Godfried T. Toussaint (KyotoCGGT, 2007)

A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. - Ajay Deshpande; Taejung Kim; Erik D. Demaine; Sanjay E. Sarma (WADS, 2007)

Plane Embeddings of Planar Graph Metrics. - MohammadHossein Bateni; Erik D. Demaine; MohammadTaghi Hajiaghayi; Mohammad Moharrami (Discret. Comput. Geom., 2007)

Geodesic Ham-Sandwich Cuts. - Prosenjit Bose; Erik D. Demaine; Ferran Hurtado; John Iacono; Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2007)

Quickly deciding minor-closed parameters in general graphs. - Erik D. Demaine; Mohammad Taghi Hajiaghayi (Eur. J. Comb., 2007)

Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity. - Erik D. Demaine; Martin L. Demaine (Graphs Comb., 2007)

Planar Embeddings of Graphs with Specified Edge Lengths. - Sergio Cabello; Erik D. Demaine; Günter Rote (J. Graph Algorithms Appl., 2007)

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. - Lars Arge; Michael A. Bender; Erik D. Demaine; Bryan Holland-Minkley; J. Ian Munro (SIAM J. Comput., 2007)

Dynamic Optimality - Almost. - Erik D. Demaine; Dion Harmon; John Iacono; Mihai Patrascu (SIAM J. Comput., 2007)

Retroactive data structures. - Erik D. Demaine; John Iacono; Stefan Langerman (ACM Trans. Algorithms, 2007)

A unified access bound on comparison-based dynamic dictionaries. - Mihai Badoiu; Richard Cole 001; Erik D. Demaine; John Iacono (Theor. Comput. Sci., 2007)

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. - Mihai Badoiu; Erik D. Demaine; MohammadTaghi Hajiaghayi; Anastasios Sidiropoulos; Morteza Zadimoghaddam (APPROX-RANDOM, 2008)

Computational Balloon Twisting: The Theory of Balloon Polyhedra. - Erik D. Demaine; Martin L. Demaine; Vi Hart (CCCG, 2008)

Constraint Logic: A Uniform Framework for Modeling Computation as Games. - Erik D. Demaine; Robert A. Hearn (CCC, 2008)

Moving-Baseline Localization. - Jun-geun Park; Erik D. Demaine; Seth J. Teller (IPSN, 2008)

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. - Greg Aloupis; Sébastien Collette; Erik D. Demaine; Stefan Langerman; Vera Sacristán Adinolfi; Stefanie Wuhrer (ISAAC, 2008)

Realistic Reconfiguration of Crystalline (and Telecube) Robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Dania El-Khechen; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Val Pinciu; Suneeta Ramaswami; Vera Sacristán Adinolfi; Stefanie Wuhrer (WAFR, 2008)

Optimally Adaptive Integration of Univariate Lipschitz Functions. - Ilya Baran; Erik D. Demaine; Dmitriy A. Katz (Algorithmica, 2008)

Subquadratic Algorithms for 3SUM. - Ilya Baran; Erik D. Demaine; Mihai Patrascu (Algorithmica, 2008)

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (Algorithmica, 2008)

The Bidimensionality Theory and Its Algorithmic Applications. - Erik D. Demaine; MohammadTaghi Hajiaghayi (Comput. J., 2008)

Linearity of grid minors in treewidth with applications through bidimensionality. - Erik D. Demaine; MohammadTaghi Hajiaghayi (Comb., 2008)

Edge-unfolding nested polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (Comput. Geom., 2008)

A Locked Orthogonal Tree - David Charlton; Erik D. Demaine; Martin L. Demaine; Gregory N. Price; Yaa-Lirng Tu (CoRR, 2008)

Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Mashhood Ishaque; Eynat Rafalin; Robert T. Schweller; Diane L. Souvaine (CoRR, 2008)

Cauchy's Arm Lemma on a Growing Sphere - Zachary Abel; David Charlton; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Stefan Langerman; Joseph O'Rourke; Val Pinciu; Godfried T. Toussaint (CoRR, 2008)

Realizing partitions respecting full and partial order information. - Erik D. Demaine; Jeff Erickson 001; Danny Krizanc; Henk Meijer; Pat Morin; Mark H. Overmars; Sue Whitesides (J. Discrete Algorithms, 2008)

Approximability of partitioning graphs with supply and demand. - Takehiro Ito; Erik D. Demaine; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2008)

Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Mashhood Ishaque; Eynat Rafalin; Robert T. Schweller; Diane L. Souvaine (Nat. Comput., 2008)

Combination Can Be Hard: Approximability of the Unique Coverage Problem. - Erik D. Demaine; Uriel Feige; MohammadTaghi Hajiaghayi; Mohammad R. Salavatipour (SIAM J. Comput., 2008)

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. - Noga Alon; Mihai Badoiu; Erik D. Demaine; Martin Farach-Colton; Mohammad Taghi Hajiaghayi; Anastasios Sidiropoulos (ACM Trans. Algorithms, 2008)

Approximation Schemes for Planar Graph Problems. - Erik D. Demaine; MohammadTaghi Hajiaghayi (Encyclopedia of Algorithms, 2008)

Bidimensionality. - Erik D. Demaine; MohammadTaghi Hajiaghayi (Encyclopedia of Algorithms, 2008)

Games, puzzles and computation. - Robert A. Hearn; Erik D. Demaine (A K Peters, 2009)

Invited Talk I Actuator Nets: Folding, Reconfiguring and Deploying Sensors. - Erik D. Demaine (ALGOSENSORS, 2009)

Relaxed Gabriel Graphs. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Belén Palop; Perouz Taslakian; Norbert Zeh (CCCG, 2009)

Open Problems from CCCG 2008. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2009)

09511 Abstracts Collection - Parameterized complexity and approximation algorithms. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Dániel Marx (Parameterized complexity and approximation algorithms, 2009)

09511 Executive Summary - Parameterized complexity and approximation algorithms. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Dániel Marx (Parameterized complexity and approximation algorithms, 2009)

09511 Open Problems - Parameterized complexity and approximation algorithms. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Dániel Marx (Parameterized complexity and approximation algorithms, 2009)

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (ICALP (1), 2009)

A Distributed boundary detection algorithm for multi-robot systems. - James McLurkin; Erik D. Demaine (IROS, 2009)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Stefan Langerman; Ryuhei Uehara (ISAAC, 2009)

Folding a Better Checkerboard. - Erik D. Demaine; Martin L. Demaine; Goran Konjevod; Robert J. Lang (ISAAC, 2009)

Filling holes in triangular meshes by curve unfolding. - Alan Brunton; Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose; Erik D. Demaine (Shape Modeling International, 2009)

The geometry of binary search trees. - Erik D. Demaine; Dion Harmon; John Iacono; Daniel Kane 001; Mihai Patrascu (SODA, 2009)

Additive approximation algorithms for list-coloring minor-closed class of graphs. - Ken-ichi Kawarabayashi; Erik D. Demaine; MohammadTaghi Hajiaghayi (SODA, 2009)

Minimal Locked Trees. - Brad Ballinger; David Charlton; Erik D. Demaine; Martin L. Demaine; John Iacono; Ching-Hao Liu; Sheung-Hung Poon (WADS, 2009)

Algorithms Meet Art, Puzzles, and Magic. - Erik D. Demaine (WADS, 2009)

A Pseudopolynomial Algorithm for Alexandrov's Theorem. - Daniel Kane 001; Gregory N. Price; Erik D. Demaine (WADS, 2009)

Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (Algorithmica, 2009)

Dynamic ham-sandwich cuts in the plane. - Timothy G. Abbott; Michael A. Burr; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; John Hugg; Daniel Kane 001; Stefan Langerman; Jelani Nelson; Eynat Rafalin; Kathryn Seyboth; Vincent Yeung (Comput. Geom., 2009)

Linear reconfiguration of cube-style modular robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Suneeta Ramaswami; Vera Sacristán Adinolfi; Stefanie Wuhrer (Comput. Geom., 2009)

Wrapping spheres with flat paper. - Erik D. Demaine; Martin L. Demaine; John Iacono; Stefan Langerman (Comput. Geom., 2009)

The distance geometry of music. - Erik D. Demaine; Francisco Gomez-Martin; Henk Meijer; David Rappaport; Perouz Taslakian; Godfried T. Toussaint; Terry Winograd; David R. Wood (Comput. Geom., 2009)

A Generalized Carpenter's Rule Theorem for Self-Touching Linkages - Timothy G. Abbott; Erik D. Demaine; Blaise Gassend (CoRR, 2009)

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves - Greg Aloupis; Sébastien Collette; Erik D. Demaine; Stefan Langerman; Vera Sacristán; Stefanie Wuhrer (CoRR, 2009)

Minimum feature size preserving decompositions - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (CoRR, 2009)

A Universal Crease Pattern for Folding Orthogonal Shapes - Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Aviv Ovadya (CoRR, 2009)

Refolding Planar Polygons. - Hayley N. Iben; James F. O'Brien; Erik D. Demaine (Discret. Comput. Geom., 2009)

The price of anarchy in cooperative network creation games. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Hamid Mahini; Morteza Zadimoghaddam (SIGecom Exch., 2009)

Minimizing movement. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Hamid Mahini; Amin S. Sayedi-Roshkhar; Shayan Oveis Gharan; Morteza Zadimoghaddam (ACM Trans. Algorithms, 2009)

An optimal decomposition algorithm for tree edit distance. - Erik D. Demaine; Shay Mozes; Benjamin Rossman; Oren Weimann (ACM Trans. Algorithms, 2009)

Any monotone boolean function can be realized by interlocked polygons. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (CCCG, 2010)

Open problem session. - Erik D. Demaine; Joseph O'Rourke (CCCG, 2010)

Zipper unfoldings of polyhedral complexes. - Anna Lubiw; Erik D. Demaine; Martin L. Demaine; Arlo Shallit; Jonah Shallit (CCCG, 2010)

Common Unfoldings of Polyominoes and Polycubes. - Greg Aloupis; Prosenjit Bose; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Karim Douïeb; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (CGGA, 2010)

Making Polygons by Simple Folds and One Straight Cut. - Erik D. Demaine; Martin L. Demaine; Andrea Hawksley; Hiro Ito; Po-Ru Loh; Shelly Manber; Omari Stephens (CGGA, 2010)

Coverage with k-Transmitters in the Presence of Obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (COCOA (2), 2010)

10091 Abstracts Collection - Data Structures. - Lars Arge; Erik D. Demaine; Raimund Seidel (Data Structures, 2010)

Kaboozle Is NP-complete, Even in a Strip. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (FUN, 2010)

UNO Is Hard, Even for a Single Player. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (FUN, 2010)

Matching Points with Things. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (LATIN, 2010)

Reconfigurable asynchronous logic automata: (RALA). - Neil Gershenfeld; David Dalrymple; Kailiang Chen; Ara N. Knaian; Forrest Green; Erik D. Demaine; Scott Greenwald; Peter Schmidt-Nielsen (POPL, 2010)

Shape Replication through Self-Assembly and RNase Enzymes. - Zachary Abel; Nadia M. Benbernou; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Scott Duke Kominers; Robert T. Schweller (SODA, 2010)

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. - Gerth Stølting Brodal; Erik D. Demaine; Jeremy T. Fineman; John Iacono; Stefan Langerman; J. Ian Munro (SODA, 2010)

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (SODA, 2010)

Scheduling to minimize power consumption using submodular functions. - Erik D. Demaine; Morteza Zadimoghaddam (SPAA, 2010)

Minimizing the Diameter of a Network Using Shortcut Edges. - Erik D. Demaine; Morteza Zadimoghaddam (SWAT, 2010)

Algorithmic Graph Minors and Bidimensionality. - Erik D. Demaine (WG, 2010)

Confluently Persistent Tries for Efficient Version Control. - Erik D. Demaine; Stefan Langerman; Eric Price 001 (Algorithmica, 2010)

Approximation algorithms via contraction decomposition. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Bojan Mohar (Comb., 2010)

The complexity of UNO - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2010)

Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract) - Erik D. Demaine; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers (CoRR, 2010)

Circle Packing for Origami Design Is Hard - Erik D. Demaine; Sándor P. Fekete; Robert J. Lang (CoRR, 2010)

Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (CoRR, 2010)

Locked and Unlocked Chains of Planar Shapes. - Robert Connelly; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Stefan Langerman; Joseph S. B. Mitchell; Ares Ribó; Günter Rote (Discret. Comput. Geom., 2010)

Generalized D-Forms Have No Spurious Creases. - Erik D. Demaine; Gregory N. Price (Discret. Comput. Geom., 2010)

Grid Vertex-Unfolding Orthostacks. - Erik D. Demaine; John Iacono; Stefan Langerman (Int. J. Comput. Geom. Appl., 2010)

Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. - Alan Brunton; Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose; Erik D. Demaine (Int. J. Shape Model., 2010)

Deploying sensor networks with guaranteed fault tolerance. - Jonathan Bredin; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Daniela Rus (IEEE/ACM Trans. Netw., 2010)

O(1)-Approximations for Maximum Movement Problems. - Piotr Berman; Erik D. Demaine; Morteza Zadimoghaddam (APPROX-RANDOM, 2011)

Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. - Zachary Abel; Erik D. Demaine (CCCG, 2011)

A Topologically Convex Vertex-Ununfoldable Polyhedron. - Zachary Abel; Erik D. Demaine; Martin L. Demaine (CCCG, 2011)

Common Developments of Several Different Orthogonal Boxes. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiroaki Matsui; Günter Rote; Ryuhei Uehara (CCCG, 2011)

Convexifying Polygons Without Losing Visibilities. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Ferran Hurtado; Anna Lubiw; Günter Rote; André Schulz 001; Diane L. Souvaine; Andrew Winslow (CCCG, 2011)

Expansive Motions for d-Dimensional Open Chains. - Sarah Eisenstat; Erik D. Demaine (CCCG, 2011)

Edge-guarding Orthogonal Polyhedra. - Giovanni Viglietta; Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Anastasia Kurdia; Joseph O'Rourke; Godfried T. Toussaint; Jorge Urrutia (CCCG, 2011)

Remarks on Separating Words. - Erik D. Demaine; Sarah Eisenstat; Jeffrey O. Shallit; David A. Wilson (DCFS, 2011)

Algorithms for Solving Rubik's Cubes. - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; Andrew Winslow (ESA, 2011)

Meshes Preserving Minimum Feature Size. - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (EGC, 2011)

A Generalization of the Source Unfolding of Convex Polyhedra. - Erik D. Demaine; Anna Lubiw (EGC, 2011)

Constructing Strings at the Nano Scale via Staged Self-assembly. - Erik D. Demaine (SPIRE, 2011)

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). - Erik D. Demaine; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers (STACS, 2011)

Contraction decomposition in h-minor-free graphs and algorithmic applications. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (STOC, 2011)

Lossless Fault-Tolerant Data Structures with Additive Overhead. - Paul F. Christiano; Erik D. Demaine; Shaunak Kishore (WADS, 2011)

Flattening Fixed-Angle Chains Is Strongly NP-Hard. - Erik D. Demaine; Sarah Eisenstat (WADS, 2011)

The Stackelberg Minimum Spanning Tree Game. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Stefan Langerman; Ilan Newman; Oren Weimann (Algorithmica, 2011)

Covering points by disjoint boxes with outliers. - Hee-Kap Ahn; Sang Won Bae 001; Erik D. Demaine; Martin L. Demaine; Sang-Sub Kim 001; Matias Korman; Iris Reinbacher; Wanbin Son (Comput. Geom., 2011)

Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (Comput. Geom., 2011)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Tsuyoshi Ito; Masashi Kiyomi; Stefan Langerman; Ryuhei Uehara; Takeaki Uno (Graphs Comb., 2011)

Continuous Blooming of Convex Polyhedra. - Erik D. Demaine; Martin L. Demaine; Vi Hart; John Iacono; Stefan Langerman; Joseph O'Rourke (Graphs Comb., 2011)

(Non)Existence of Pleated Folds: How Paper Folds Between Creases. - Erik D. Demaine; Martin L. Demaine; Vi Hart; Gregory N. Price; Tomohiro Tachi (Graphs Comb., 2011)

Computing Signed Permutations of Polygons. - Greg Aloupis; Prosenjit Bose; Erik D. Demaine; Stefan Langerman; Henk Meijer; Mark H. Overmars; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 2011)

The Voronoi game on graphs and its complexity. - Sachio Teramoto; Erik D. Demaine; Ryuhei Uehara (J. Graph Algorithms Appl., 2011)

Efficient constant-velocity reconfiguration of crystalline robots. - Greg Aloupis; Sébastien Collette; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; Stefan Langerman; Joseph O'Rourke; Val Pinciu; Suneeta Ramaswami; Vera Sacristán; Stefanie Wuhrer (Robotica, 2011)

Planning to fold multiple objects from a single self-folding sheet. - Byoungkwon An; Nadia M. Benbernou; Erik D. Demaine; Daniela Rus (Robotica, 2011)

On the complexity of reconfiguration problems. - Takehiro Ito; Erik D. Demaine; Nicholas J. A. Harvey; Christos H. Papadimitriou; Martha Sideri; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2011)

Programmable Assembly With Universally Foldable Strings (Moteins). - Kenneth C. Cheung; Erik D. Demaine; Jonathan Bachrach; Saul Griffith (IEEE Trans. Robotics, 2011)

Origami Robots and Star Trek Replicators. - Erik D. Demaine (ISAAC, 2012)

Any Monotone Function Is Realized by Interlocked Polygons. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (Algorithms, 2012)

On k-convex polygons. - Oswin Aichholzer; Franz Aurenhammer; Erik D. Demaine; Ferran Hurtado; Pedro Ramos 001; Jorge Urrutia (Comput. Geom., 2012)

Two Hands Are Better Than One (up to constant factors) - Sarah Cannon; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers; Andrew Winslow (CoRR, 2012)

Classic Nintendo Games are (NP-)Hard - Greg Aloupis; Erik D. Demaine; Alan Guo (CoRR, 2012)

One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Matthew J. Patitz; Robert T. Schweller; Andrew Winslow; Damien Woods (CoRR, 2012)

Reconfiguration of list edge-colorings in a graph. - Takehiro Ito; Marcin Kaminski 001; Erik D. Demaine (Discret. Appl. Math., 2012)

Hinged Dissections Exist. - Timothy G. Abbott; Zachary Abel; David Charlton; Erik D. Demaine; Martin L. Demaine; Scott Duke Kominers (Discret. Comput. Geom., 2012)

Ghost chimneys. - David Charlton; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Pat Morin; Ryuhei Uehara (Int. J. Comput. Geom. Appl., 2012)

Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. - Erik D. Demaine; Morteza Zadimoghaddam (Internet Math., 2012)

NP-completeness of generalized Kaboozle. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (J. Inf. Process., 2012)

The price of anarchy in network creation games. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Hamid Mahini; Morteza Zadimoghaddam (ACM Trans. Algorithms, 2012)

Reconfiguring Massive Particle Swarms with Limited, Global Control. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Golnaz Habibi; James McLurkin (ALGOSENSORS, 2013)

Variations on Instant Insanity. - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Thomas D. Morgan; Ryuhei Uehara (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Zipper Unfoldability of Domes and Prismoids. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (CCCG, 2013)

Combining Binary Search Trees. - Erik D. Demaine; John Iacono; Stefan Langerman; Özgür Özkan (ICALP (1), 2013)

On Wrapping Spheres and Cubes with Rectangular Paper. - Alex Cole; Erik D. Demaine; Eli Fox-Epstein (JCDCGG, 2013)

Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". - Erik D. Demaine; Morteza Zadimoghaddam (SODA, 2013)

Algorithms for Designing Pop-Up Cards. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Giovanni Viglietta; Andrew Winslow (STACS, 2013)

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. - Sarah Cannon; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers; Andrew Winslow (STACS, 2013)

Blame Trees. - Erik D. Demaine; Pavel Panchekha; David A. Wilson; Edward Z. Yang (WADS, 2013)

Efficient reconfiguration of lattice-based modular robots. - Greg Aloupis; Nadia M. Benbernou; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; John Iacono; Stefanie Wuhrer (Comput. Geom., 2013)

Non-crossing matchings of points with geometric objects. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (Comput. Geom., 2013)

Bounded-degree polyhedronization of point sets. - Gill Barequet; Nadia M. Benbernou; David Charlton; Erik D. Demaine; Martin L. Demaine; Mashhood Ishaque; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Godfried T. Toussaint; Andrew Winslow (Comput. Geom., 2013)

Refold rigidity of convex polyhedra. - Erik D. Demaine; Martin L. Demaine; Jin-ichi Itoh; Anna Lubiw; Chie Nara; Joseph O'Rourke (Comput. Geom., 2013)

Unfolding Orthogrids with Constant Refinement. - Mirela Damian; Erik D. Demaine; Robin Y. Flatland (CoRR, 2013)

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). - Erik D. Demaine; Fedor V. Fomin; MohammadTaghi Hajiaghayi; Dimitrios M. Thilikos (Dagstuhl Reports, 2013)

A Few Lessons I've Learned. - Erik D. Demaine (Bull. EATCS, 2013)

Folding Equilateral Plane graphs. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Jayson Lynch; Tao B. Schardl; Isaac Shapiro-Ellowitz (Int. J. Comput. Geom. Appl., 2013)

Constructing Points through Folding and Intersection. - Steve Butler; Erik D. Demaine; Ronald L. Graham; Tomohiro Tachi (Int. J. Comput. Geom. Appl., 2013)

Coverage with k-transmitters in the presence of obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (J. Comb. Optim., 2013)

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Ilan Newman; Oren Weimann (J. Comb. Optim., 2013)

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Jayson Lynch; Tao B. Schardl (J. Inf. Process., 2013)

One-dimensional staged self-assembly. - Erik D. Demaine; Sarah Eisenstat; Mashhood Ishaque; Andrew Winslow (Nat. Comput., 2013)

Scheduling to minimize gaps and power consumption. - Erik D. Demaine; Mohammad Ghodsi; MohammadTaghi Hajiaghayi; Amin S. Sayedi-Roshkhar; Morteza Zadimoghaddam (J. Sched., 2013)

Basic Network Creation Games. - Noga Alon; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Tom Leighton (SIAM J. Discret. Math., 2013)

Continuously Flattening Polyhedra Using Straight Skeletons. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Jin-ichi Itoh; Anna Lubiw; Chie Nara; Joseph O'Rourke (SoCG, 2014)

Playing Dominoes Is Hard, Except by Yourself. - Erik D. Demaine; Fermi Ma; Erik Waingarten (FUN, 2014)

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Matthew J. Patitz; Robert T. Schweller; Andrew Winslow; Damien Woods (ICALP (1), 2014)

Canadians Should Travel Randomly. - Erik D. Demaine; Yamming Huang; Chung-Shou Liao; Kunihiko Sadakane (ICALP (1), 2014)

An end-to-end approach to making self-folded 3D surface shapes by uniform heating. - Byoungkwon An; Shuhei Miyashita; Michael Thomas Tolley; Daniel M. Aukes; Laura Meeker; Erik D. Demaine; Martin L. Demaine; Robert J. Wood; Daniela Rus (ICRA, 2014)

Particle computation: Designing worlds to control robot swarms with only global signals. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; James McLurkin (ICRA, 2014)

Polynomial-Time Algorithm for Sliding Tokens on Trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (ISAAC, 2014)

On Streaming and Communication Complexity of the Set Cover Problem. - Erik D. Demaine; Piotr Indyk; Sepideh Mahabadi; Ali Vakilian (DISC, 2014)

How to influence people with partial incentives. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Hamid Mahini; David L. Malec; S. Raghavan 001; Anshul Sawant; Morteza Zadimoghaddam (WWW, 2014)

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. - Glencora Borradaile; Erik D. Demaine; Siamak Tazari (Algorithmica, 2014)

Necklaces, Convolutions, and X+Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Patrascu; Perouz Taslakian (Algorithmica, 2014)

On Cartesian Trees and Range Minimum Queries. - Erik D. Demaine; Gad M. Landau; Oren Weimann (Algorithmica, 2014)

Reprint of: Refold rigidity of convex polyhedra. - Erik D. Demaine; Martin L. Demaine; Jin-ichi Itoh; Anna Lubiw; Chie Nara; Joseph O'Rourke (Comput. Geom., 2014)

Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding. - Erik D. Demaine; Jason S. Ku (CoRR, 2014)

Fast Dynamic Pointer Following via Link-Cut Trees. - Erik D. Demaine; Nathan Pinsker; Jon Schneider (CoRR, 2014)

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (CoRR, 2014)

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. - Mirela Damian; Erik D. Demaine; Robin Y. Flatland (Graphs Comb., 2014)

Computational Complexity of Piano-Hinged Dissections. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Takashi Horiyama; Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Computational Complexity and an Integer Programming Model of Shakashaka. - Erik D. Demaine; Yoshio Okamoto; Ryuhei Uehara; Yushi Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Approximability of the subset sum reconfiguration problem. - Takehiro Ito; Erik D. Demaine (J. Comb. Optim., 2014)

Covering Folded Shapes. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Michael Hoffmann 001; Anna Lubiw; Jack Snoeyink; Andrew Winslow (J. Comput. Geom., 2014)

Picture-Hanging Puzzles. - Erik D. Demaine; Martin L. Demaine; Yair N. Minsky; Joseph S. B. Mitchell; Ronald L. Rivest; Mihai Patrascu (Theory Comput. Syst., 2014)

Correction: Basic Network Creation Games. - Noga Alon; Erik D. Demaine; MohammadTaghi Hajiaghayi; Panagiotis Kanellopoulos; Tom Leighton (SIAM J. Discret. Math., 2014)

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Philip N. Klein (ACM Trans. Algorithms, 2014)

Minimizing Movement: Fixed-Parameter Tractability. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Dániel Marx (ACM Trans. Algorithms, 2014)

UNO is hard, even for a single player. - Erik D. Demaine; Martin L. Demaine; Nicholas J. A. Harvey; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

Computational complexity of numberless Shakashaka. - Aviv Adler; Michael Biro; Erik D. Demaine; Mikhail Rudoy; Christiane Schmidt 001 (CCCG, 2015)

Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Hamed Mohtasham Shad; Rose Morris-Wright (SoCG, 2015)

A Dissimilarity Measure for Comparing Origami Crease Patterns. - Seung Man Oh; Godfried T. Toussaint; Erik D. Demaine; Martin L. Demaine (ICPRAM (1), 2015)

Particle computation: Device fan-out and binary memory. - Hamed Mohtasham Shad; Rose Morris-Wright; Erik D. Demaine; Sándor P. Fekete; Aaron T. Becker (ICRA, 2015)

Box Pleating is Hard. - Hugo A. Akitaya; Kenneth C. Cheung; Erik D. Demaine; Takashi Horiyama; Thomas C. Hull; Jason S. Ku; Tomohiro Tachi; Ryuhei Uehara (JCDCGG, 2015)

Dissection with the Fewest Pieces is Hard, Even to Approximate. - Jeffrey Bosboom; Erik D. Demaine; Martin L. Demaine; Jayson Lynch; Pasin Manurangsi; Mikhail Rudoy; Anak Yodpinyanee (JCDCGG, 2015)

Mario Kart Is Hard. - Jeffrey Bosboom; Erik D. Demaine; Adam Hesterberg; Jayson Lynch; Erik Waingarten (JCDCGG, 2015)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Continuous Flattening of Orthogonal Polyhedra. - Erik D. Demaine; Martin L. Demaine; Jin-ichi Itoh; Chie Nara (JCDCGG, 2015)

Bust-a-Move/Puzzle Bobble Is NP-complete. - Erik D. Demaine; Stefan Langerman (JCDCGG, 2015)

Cache-Oblivious Iterated Predecessor Queries via Range Coalescing. - Erik D. Demaine; Vineet Gopal; William Hasenplaugh (WADS, 2015)

Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. - Erik D. Demaine; Tim Kaler; Quanquan C. Liu; Aaron Sidford; Adam Yedidia (WADS, 2015)

Worst-Case Optimal Tree Layout in External Memory. - Erik D. Demaine; John Iacono; Stefan Langerman (Algorithmica, 2015)

Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations. - Erik D. Demaine; Martin L. Demaine; David A. Huffman; Duks Koschitz; Tomohiro Tachi (CoRR, 2015)

Zig-Zag Numberlink is NP-Complete. - Aaron B. Adcock; Erik D. Demaine; Martin L. Demaine; Michael P. O'Brien; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (J. Inf. Process., 2015)

You Should Be Scared of German Ghost. - Erik D. Demaine; Fermi Ma; Matthew Susskind; Erik Waingarten (J. Inf. Process., 2015)

Classic Nintendo games are (computationally) hard. - Greg Aloupis; Erik D. Demaine; Alan Guo; Giovanni Viglietta (Theor. Comput. Sci., 2015)

Fun with fonts: Algorithmic typography. - Erik D. Demaine; Martin L. Demaine (Theor. Comput. Sci., 2015)

Linear-time algorithm for sliding tokens on trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (Theor. Comput. Sci., 2015)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

Who Needs Crossings? Hardness of Plane Graph Rigidity. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Jayson Lynch; Tao B. Schardl (SoCG, 2016)

Super Mario Bros. is Harder/Easier Than We Thought. - Erik D. Demaine; Giovanni Viglietta; Aaron Williams 001 (FUN, 2016)

The Complexity of Hex and the Jordan Curve Theorem. - Aviv Adler; Constantinos Daskalakis; Erik D. Demaine (ICALP, 2016)

Energy-Efficient Algorithms. - Erik D. Demaine; Jayson Lynch; Geronimo J. Mirano; Nirvan Tyagi (ITCS, 2016)

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. - Nirvan Tyagi; Jayson Lynch; Erik D. Demaine (RC, 2016)

Cache-Adaptive Analysis. - Michael A. Bender; Erik D. Demaine; Roozbeh Ebrahimi; Jeremy T. Fineman; Rob Johnson 001; Andrea Lincoln; Jayson Lynch; Samuel McCauley (SPAA, 2016)

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. - MohammadHossein Bateni; Erik D. Demaine; MohammadTaghi Hajiaghayi; Dániel Marx (STOC, 2016)

The Two-Handed Tile Assembly Model is not Intrinsically Universal. - Erik D. Demaine; Matthew J. Patitz; Trent A. Rogers; Robert T. Schweller; Scott M. Summers; Damien Woods (Algorithmica, 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Folding Flat Crease Patterns with Thick Materials. - Jason S. Ku; Erik D. Demaine (CoRR, 2016)

Computational Complexity of Arranging Music. - William S. Moses; Erik D. Demaine (CoRR, 2016)

Folding a paper strip to minimize thickness. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Hiro Ito; Anna Lubiw; Ryuhei Uehara; Yushi Uno (J. Discrete Algorithms, 2016)

Rigid origami vertices: conditions and forcing sets. - Zachary Abel; Jason H. Cantarella; Erik D. Demaine; David Eppstein; Thomas C. Hull; Jason S. Ku; Robert J. Lang; Tomohiro Tachi (J. Comput. Geom., 2016)

Network Creation Games. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Hamid Mahini; Morteza Zadimoghaddam (Encyclopedia of Algorithms, 2016)

Bidimensionality. - Fedor V. Fomin; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Dimitrios M. Thilikos (Encyclopedia of Algorithms, 2016)

Approximation Schemes for Planar Graph Problems. - Mohammad Taghi Hajiaghayi; Erik D. Demaine (Encyclopedia of Algorithms, 2016)

Computing 3SAT on a Fold-and-Cut Machine. - Byoungkwon An; Erik D. Demaine; Martin L. Demaine; Jason S. Ku (CCCG, 2017)

Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges. - Amartya Shankha Biswas; Erik D. Demaine (CCCG, 2017)

Snipperclips: Cutting Tools into Desired Polygons using Themselves. - Erik D. Demaine; Matias Korman; André van Renssen; Marcel Roeloffzen (CCCG, 2017)

Push-Pull Block Puzzles are Hard. - Erik D. Demaine; Isaac Grosof; Jayson Lynch (CIAC, 2017)

Origamizer: A Practical Algorithm for Folding Any Polyhedron. - Erik D. Demaine; Tomohiro Tachi (SoCG, 2017)

Upward Partitioned Book Embeddings. - Hugo A. Akitaya; Erik D. Demaine; Adam Hesterberg; Quanquan C. Liu (GD, 2017)

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SODA, 2017)

Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. - Cameron T. Chalk; Erik D. Demaine; Martin L. Demaine; Eric Martinez; Robert T. Schweller; Luis Vega; Tim Wylie (SODA, 2017)

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. - Erik D. Demaine; Quanquan C. Liu (WADS, 2017)

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. - Jeffrey Bosboom; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Pasin Manurangsi; Anak Yodpinyanee (CoRR, 2017)

Minimal forcing sets for 1D origami. - Mirela Damian; Erik D. Demaine; Muriel Dulieu; Robin Y. Flatland; Hella Hoffman; Thomas C. Hull; Jayson Lynch; Suneeta Ramaswami (CoRR, 2017)

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs. - Erik D. Demaine; Mikhail Rudoy (CoRR, 2017)

A simple proof that the $(n^2-1)$-puzzle is hard. - Erik D. Demaine; Mikhail Rudoy (CoRR, 2017)

Embedding Stacked Polytopes on a Polynomial-Size Grid. - Erik D. Demaine; André Schulz 001 (Discret. Comput. Geom., 2017)

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. - Mirela Damian; Erik D. Demaine; Robin Y. Flatland; Joseph O'Rourke (Graphs Comb., 2017)

Arboral satisfaction: Recognition and LP approximation. - Erik D. Demaine; Varun Ganesan; Vladislav Kontsevoi; Qipeng Liu 001; Quanquan C. Liu; Fermi Ma; Ofir Nachum; Aaron Sidford; Erik Waingarten; Daniel Ziegler 002 (Inf. Process. Lett., 2017)

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. - Zachary Abel; Brad Ballinger; Erik D. Demaine; Martin L. Demaine; Jeff Erickson 001; Adam Hesterberg; Hiro Ito; Irina Kostitsyna; Jayson Lynch; Ryuhei Uehara (J. Inf. Process., 2017)

Simple Folding is Really Hard. - Hugo A. Akitaya; Erik D. Demaine; Jason S. Ku (J. Inf. Process., 2017)

Folding and Punching Paper. - Yasuhiko Asao; Erik D. Demaine; Martin L. Demaine; Hideaki Hosaka; Akitoshi Kawamura; Tomohiro Tachi; Kazune Takahashi (J. Inf. Process., 2017)

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard. - Jeffrey Bosboom; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Pasin Manurangsi; Anak Yodpinyanee (J. Inf. Process., 2017)

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Adam Hesterberg; Andrea Lincoln; Jayson Lynch; Yun William Yu (J. Inf. Process., 2017)

Folded Structures Satisfying Multiple Conditions. - Erik D. Demaine; Jason S. Ku (J. Inf. Process., 2017)

New geometric algorithms for fully connected staged self-assembly. - Erik D. Demaine; Sándor P. Fekete; Christian Scheffer; Arne Schmidt 001 (Theor. Comput. Sci., 2017)

Know When to Fold 'Em: Self-assembly of Shapes by Folding in Oritatami. - Erik D. Demaine; Jacob Hendricks; Meagan Olsen; Matthew J. Patitz; Trent A. Rogers; Nicolas Schabanel; Shinnosuke Seki 001; Hadley Thomas (DNA, 2018)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. - Zachary Abel; Jeffrey Bosboom; Erik D. Demaine; Linus Hamilton; Adam Hesterberg; Justin Kopinsky; Jayson Lynch; Mikhail Rudoy (FUN, 2018)

Computational Complexity of Generalized Push Fight. - Jeffrey Bosboom; Erik D. Demaine; Mikhail Rudoy (FUN, 2018)

Computational Complexity of Motion Planning of a Robot through Simple Gadgets. - Erik D. Demaine; Isaac Grosof; Jayson Lynch; Mikhail Rudoy (FUN, 2018)

The Computational Complexity of Portal and Other 3D Video Games. - Erik D. Demaine; Joshua Lockhart; Jayson Lynch (FUN, 2018)

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. - Erik D. Demaine; Andrea Lincoln; Quanquan C. Liu; Jayson Lynch; Virginia Vassilevska Williams (ITCS, 2018)

Negative Instance for the Edge Patrolling Beacon Problem. - Zachary Abel; Hugo A. Akitaya; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Matias Korman; Jason S. Ku; Jayson Lynch (JCDCGGG, 2018)

Toward Unfolding Doubly Covered n-Stars. - Hugo A. Akitaya; Brad Ballinger; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Irina Kostitsyna; Jason S. Ku; Stefan Langerman; Joseph O'Rourke; Ryuhei Uehara (JCDCGGG, 2018)

Packing Cube Nets into Rectangles with O(1) Holes. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Yushi Uno; Andrew Winslow (JCDCGGG, 2018)

Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. - Erik D. Demaine; Quanquan C. Liu (SPAA, 2018)

Solving the Rubik's Cube Optimally is NP-complete. - Erik D. Demaine; Sarah Eisenstat; Mikhail Rudoy (STACS, 2018)

Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. - Lijie Chen 001; Erik D. Demaine; Yuzhou Gu; Virginia Vassilevska Williams; Yinzhan Xu; Yuancheng Yu (SWAT, 2018)

Tree-Residue Vertex-Breaking: a new tool for proving hardness. - Erik D. Demaine; Mikhail Rudoy (SWAT, 2018)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Boris Aronov; Prosenjit Bose; Erik D. Demaine; Joachim Gudmundsson; John Iacono; Stefan Langerman; Michiel H. M. Smid (Algorithmica, 2018)

Bumpy pyramid folding. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiro Ito; Jack Snoeyink; Ryuhei Uehara (Comput. Geom., 2018)

Pachinko. - Hugo A. Akitaya; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Ferran Hurtado; Jason S. Ku; Jayson Lynch (Comput. Geom., 2018)

Losing at Checkers is Hard. - Jeffrey Bosboom; Spencer Congero; Erik D. Demaine; Martin L. Demaine; Jayson Lynch (CoRR, 2018)

Conic Crease Patterns with Reflecting Rule Lines. - Erik D. Demaine; Martin L. Demaine; David A. Huffman; Duks Koschitz; Tomohiro Tachi (CoRR, 2018)

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. - Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (CoRR, 2018)

Folding Polyominoes into (Poly)Cubes. - Oswin Aichholzer; Michael Biro; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Adam Hesterberg; Irina Kostitsyna; Christiane Schmidt 001 (Int. J. Comput. Geom. Appl., 2018)

Flat foldings of plane graphs with prescribed angles and edge lengths. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; David Eppstein; Anna Lubiw; Ryuhei Uehara (J. Comput. Geom., 2018)

Conflict-Free Coloring of Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SIAM J. Discret. Math., 2018)

Editorial fun. - Erik D. Demaine; Fabrizio Grandoni 001 (Theor. Comput. Sci., 2018)

The fewest clues problem. - Erik D. Demaine; Fermi Ma; Ariel Schvartzman; Erik Waingarten; Scott Aaronson (Theor. Comput. Sci., 2018)

A simple proof that the (n2 - 1)-puzzle is hard. - Erik D. Demaine; Mikhail Rudoy (Theor. Comput. Sci., 2018)

An End-to-End Approach to Self-Folding Origami Structures. - Byoungkwon An; Shuhei Miyashita; Aaron C. Ong; Michael Thomas Tolley; Martin L. Demaine; Erik D. Demaine; Robert J. Wood; Daniela Rus (IEEE Trans. Robotics, 2018)

Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly. - John Calvin Alumbaugh; Joshua J. Daymude; Erik D. Demaine; Matthew J. Patitz; Andréa W. Richa (DNA, 2019)

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. - Erik D. Demaine; Timothy D. Goodrich; Kyle Kloster; Brian Lavallee; Quanquan C. Liu; Blair D. Sullivan; Ali Vakilian; Andrew van der Poel (ESA, 2019)

Reconfiguring Undirected Paths. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Kshitij Jain 001; Anna Lubiw; Ryuhei Uehara; Yushi Uno (WADS, 2019)

Some Polycubes Have No Edge-Unzipping. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Joseph O'Rourke (CoRR, 2019)

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (J. Comput. Syst. Sci., 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Particle computation: complexity, algorithms, and logic. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Jarrett Lonsford; Rose Morris-Wright (Nat. Comput., 2019)

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Henk Meijer; Christian Scheffer (SIAM J. Comput., 2019)

2048 Without Merging. - Hugo A. Akitaya; Erik D. Demaine; Jason S. Ku; Jayson Lynch; Csaba D. Tóth (CCCG, 2020)

New Results in Sona Drawing: Hardness and TSP Separation. - Man-Kwun Chiu; Erik D. Demaine; Yevhenii Diomidov; David Eppstein; Robert A. Hearn; Adam Hesterberg; Matias Korman; Irene Parada; Mikhail Rudoy (CCCG, 2020)

Folding Small Polyominoes into a Unit Cube. - Kingston Yao Czajkowski; Erik D. Demaine; Martin L. Demaine; Kim Eppling; Robby Kraft; Klara Mundilova; Levi Smith (CCCG, 2020)

Tribute to Godfried Toussaint. - Erik D. Demaine (CCCG, 2020)

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. - Erik D. Demaine; Martin L. Demaine; David Eppstein (CCCG, 2020)

Some Polycubes Have No Edge Zipper Unfolding. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Joseph O'Rourke (CCCG, 2020)

Finding Closed Quasigeodesics on Convex Polyhedra. - Erik D. Demaine; Adam Hesterberg; Jason S. Ku (SoCG, 2020)

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. - Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (ITCS, 2020)

Arithmetic Expression Construction. - Leo Alcock; Sualeh Asif; Jeffrey Bosboom; Josh Brunner; Charlotte Chen; Erik D. Demaine; Rogers Epstein; Adam Hesterberg; Lior Hirschfeld; William Hu; Jayson Lynch; Sarah Scheffler; et al. (ISAAC, 2020)

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. - Josh Brunner; Erik D. Demaine; Dylan H. Hendrickson; Julian Wellman (ISAAC, 2020)

Recursed Is Not Recursive: A Jarring Result. - Erik D. Demaine; Justin Kopinsky; Jayson Lynch (ISAAC, 2020)

Existence and Hardness of Conveyor Belts. - Molly Baird; Sara C. Billey; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Graham Gordon; Sean Griffin; Joseph S. B. Mitchell; Joshua P. Swanson (Electron. J. Comb., 2020)

Universal hinge patterns for folding strips efficiently into any grid polyhedron. - Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Anna Lubiw (Comput. Geom., 2020)

Symmetric assembly puzzles are hard, beyond a few pieces. - Erik D. Demaine; Matias Korman; Jason S. Ku; Joseph S. B. Mitchell; Yota Otachi; André van Renssen; Marcel Roeloffzen; Ryuhei Uehara; Yushi Uno (Comput. Geom., 2020)

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (CoRR, 2020)

Escaping a Polygon. - Zachary Abel; Hugo A. Akitaya; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Jason S. Ku; Jayson Lynch (CoRR, 2020)

Tetris is NP-hard even with $O(1)$ rows or columns. - Sualeh Asif; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Jayson Lynch; Mihir Singhal (CoRR, 2020)

Infinite All-Layers Simple Foldability. - Hugo A. Akitaya; Cordelia Avery; Joseph Bergeron; Erik D. Demaine; Justin Kopinsky; Jason S. Ku (Graphs Comb., 2020)

Polyhedral Characterization of Reversible Hinged Dissections. - Jin Akiyama; Erik D. Demaine; Stefan Langerman (Graphs Comb., 2020)

Path Puzzles: Discrete Tomography with a Path Constraint is Hard. - Jeffrey Bosboom; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Roderick Kimball; Justin Kopinsky (Graphs Comb., 2020)

Cookie Clicker. - Erik D. Demaine; Hiro Ito; Stefan Langerman; Jayson Lynch; Mikhail Rudoy; Kai Xiao (Graphs Comb., 2020)

PSPACE-completeness of Pulling Blocks to Reach a Goal. - Joshua Ani; Sualeh Asif; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch; Sarah Scheffler; Adam Suhl (J. Inf. Process., 2020)

Tetris is NP-hard even with O(1) Rows or Columns. - Sualeh Asif; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Jayson Lynch; Mihir Singhal (J. Inf. Process., 2020)

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. - Jeffrey Bosboom; Charlotte Chen; Lily Chung; Spencer Compton; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Ivan Tadeu Ferreira Antunes Filho; Dylan H. Hendrickson; Adam Hesterberg; Calvin Hsu; William Hu; et al. (J. Inf. Process., 2020)

Adventures in Maze Folding Art. - Erik D. Demaine; Martin L. Demaine (J. Inf. Process., 2020)

Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. - Erik D. Demaine; Martin L. Demaine; Hiro Ito; Chie Nara; Izumi Shirahama; Tomohiro Tachi; Mizuho Tomura (J. Inf. Process., 2020)

Rigid foldability is NP-hard. - Hugo A. Akitaya; Erik D. Demaine; Takashi Horiyama; Thomas C. Hull; Jason S. Ku; Tomohiro Tachi (J. Comput. Geom., 2020)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. - Zachary Abel; Jeffrey Bosboom; Michael J. Coulombe; Erik D. Demaine; Linus Hamilton; Adam Hesterberg; Justin Kopinsky; Jayson Lynch; Mikhail Rudoy; Clemens Thielen (Theor. Comput. Sci., 2020)

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. - Jean Cardinal; Erik D. Demaine; David Eppstein; Robert A. Hearn; Andrew Winslow (Theor. Comput. Sci., 2020)

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. - Fotini Christia; Michael J. Curry; Constantinos Daskalakis; Erik D. Demaine; John P. Dickerson; MohammadTaghi Hajiaghayi; Adam Hesterberg; Marina Knittel; Aidan Milliff (AAAI, 2021)

Folding Points to a Point and Lines to a Line. - Hugo A. Akitaya; Brad Ballinger; Erik D. Demaine; Thomas C. Hull; Christiane Schmidt 001 (CCCG, 2021)

Edge-Unfolding Prismatoids: Tall or Rectangular Base. - Vincent Bian; Erik D. Demaine; Rachana Madhukara (CCCG, 2021)

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (CCCG, 2021)

Yin-Yang Puzzles are NP-complete. - Erik D. Demaine; Jayson Lynch; Mikhail Rudoy; Yushi Uno (CCCG, 2021)

Characterizing Universal Reconfigurability of Modular Pivoting Robots. - Hugo A. Akitaya; Erik D. Demaine; Andrei Gonczi; Dylan H. Hendrickson; Adam Hesterberg; Matias Korman; Oliver Korten; Jayson Lynch; Irene Parada; Vera Sacristán (SoCG, 2021)

Tatamibari Is NP-Complete. - Aviv Adler; Jeffrey Bosboom; Erik D. Demaine; Martin L. Demaine; Quanquan C. Liu; Jayson Lynch (FUN, 2021)

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. - Joshua Ani; Jeffrey Bosboom; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (FUN, 2021)

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. - Josh Brunner; Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Adam Hesterberg; Adam Suhl; Avi Zeff (FUN, 2021)

Multidimensional Scaling: Approximation and Complexity. - Erik D. Demaine; Adam Hesterberg; Frederic Koehler; Jayson Lynch; John C. Urschel (ICML, 2021)

An Efficient Reversible Algorithm for Linear Regression. - Erik D. Demaine; Jayson Lynch; Jiaying Sun (ICRC, 2021)

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. - Hugo A. Akitaya; Esther M. Arkin; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Matias Korman; Belén Palop; Irene Parada; André van Renssen; Vera Sacristán (Algorithmica, 2021)

Approximating the Canadian Traveller Problem with Online Randomization. - Erik D. Demaine; Yamming Huang; Chung-Shou Liao; Kunihiko Sadakane (Algorithmica, 2021)

Snipperclips: Cutting tools into desired polygons using themselves. - Zachary Abel; Hugo A. Akitaya; Man-Kwun Chiu; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Matias Korman; Jayson Lynch; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Continuous flattening of all polyhedral manifolds using countably infinite creases. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Jason S. Ku; Jayson Lynch; Jin-ichi Itoh; Chie Nara (Comput. Geom., 2021)

Folding polyominoes with holes into a cube. - Oswin Aichholzer; Hugo A. Akitaya; Kenneth C. Cheung; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Maarten Löffler; Zuzana Masárová; Klara Mundilova; Christiane Schmidt 001 (Comput. Geom., 2021)

Strings-and-Coins and Nimstring are PSPACE-complete. - Erik D. Demaine; Yevhenii Diomidov (CoRR, 2021)

Belga B-Trees. - Erik D. Demaine; John Iacono; Grigorios Koumoutsos; Stefan Langerman (Theory Comput. Syst., 2021)

On the effects of hierarchical self-assembly for reducing program-size complexity. - Sarah Cannon; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; David Furcy; Matthew J. Patitz; Robert T. Schweller; Scott M. Summers; Andrew Winslow (Theor. Comput. Sci., 2021)

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. - Elena Arseneva; Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CCCG, 2022)

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. - Erik D. Demaine; Hiro Ito; Jayson Lynch; Ryuhei Uehara (CCCG, 2022)

ZHED is NP-complete. - Sagnik Saha; Erik D. Demaine (CCCG, 2022)

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. - Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Victor Luo (SoCG, 2022)

Hardness of Token Swapping on Trees. - Oswin Aichholzer; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Zuzana Masárová; Mikhail Rudoy; Virginia Vassilevska Williams; Nicole Wein (ESA, 2022)

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. - Joshua Ani; Lily Chung; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (FUN, 2022)

Rolling Polyhedra on Tessellations. - Akira Baes; Erik D. Demaine; Martin L. Demaine; Elizabeth J. Hartung; Stefan Langerman; Joseph O'Rourke; Ryuhei Uehara; Yushi Uno; Aaron Williams 001 (FUN, 2022)

Lower Bounds on Retroactive Data Structures. - Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (ISAAC, 2022)

This Game Is Not Going To Analyze Itself. - Aviv Adler; Hayashi Layers; Lily Chung; Michael J. Coulombe; Erik D. Demaine; Jenny Diomidova; Della Hendrickson; Jayson Lynch (JCDCGGG, 2022)

Complexity of Solo Chess with Unlimited Moves. - Josh Brunner; Lily Chung; Michael J. Coulombe; Erik D. Demaine; Timothy Gomez; Jayson Lynch (JCDCGGG, 2022)

Geodesic Paths Passing Through All Faces on A Polyhedron. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Hiro Ito; Yuta Katayama; Wataru Maruyama; Yushi Uno (JCDCGGG, 2022)

PSPACE-Completeness of Reversible Deterministic Systems. - Erik D. Demaine; Robert A. Hearn; Dylan H. Hendrickson; Jayson Lynch (MCU, 2022)

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. - Hugo A. Akitaya; Erik D. Demaine; Matias Korman; Irina Kostitsyna; Irene Parada; Willem Sonke; Bettina Speckmann; Ryuhei Uehara; Jules Wulms (SWAT, 2022)

Ununfoldable polyhedra with 6 vertices or 6 faces. - Hugo A. Akitaya; Erik D. Demaine; David Eppstein; Tomohiro Tachi; Ryuhei Uehara (Comput. Geom., 2022)

Unfolding Orthotubes with a Dual Hamiltonian Path. - Erik D. Demaine; Kritkorn Karntikoon (CoRR, 2022)

Orthogonal Fold & Cut. - Joshua Ani; Josh Brunner; Erik D. Demaine; Martin L. Demaine; Dylan H. Hendrickson; Victor Luo; Rachana Madhukara (CoRR, 2022)

The Legend of Zelda: The Complexity of Mechanics. - Jeffrey Bosboom; Josh Brunner; Michael J. Coulombe; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch; Elle Najt (CoRR, 2022)

Reconfiguration of Non-crossing Spanning Trees. - Oswin Aichholzer; Brad Ballinger; Therese Biedl; Mirela Damian; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Josef Tkadlec; Yushi Uno (CoRR, 2022)

Celeste is PSPACE-hard. - Lily Chung; Erik D. Demaine (CoRR, 2022)

Area-Optimal Simple Polygonalizations: The CG Challenge 2019. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (ACM J. Exp. Algorithmics, 2022)

Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change. - Robert M. Alaniz; Michael J. Coulombe; Erik D. Demaine; Bin Fu; Ryan Knobel; Timothy Gomez; Elise Grizzell; Andrew Rodriguez; Robert T. Schweller; Tim Wylie (CCCG, 2023)

Super Guarding and Dark Rays in Art Galleries. - Joseph O'Rourke; Hugo A. Akitaya; Erik D. Demaine; Adam Hesterberg; Anna Lubiw; Jayson Lynch; Frederick Stock (CCCG, 2023)

Complexity of Reconfiguration in Surface Chemical Reaction Networks. - Robert M. Alaniz; Josh Brunner; Michael J. Coulombe; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Elise Grizzell; Ryan Knobel; Jayson Lynch; Andrew Rodriguez; Robert T. Schweller; Tim Wylie (DNA, 2023)

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. - Joshua Ani; Michael J. Coulombe; Erik D. Demaine; Yevhenii Diomidov; Timothy Gomez; Dylan H. Hendrickson; Jayson Lynch (SAND, 2023)

Developing a tetramonohedron with minimum cut length. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (Comput. Geom., 2023)

Rectangular Spiral Galaxies are still hard. - Erik D. Demaine; Maarten Löffler; Christiane Schmidt 001 (Comput. Geom., 2023)

This Game Is Not Going To Analyze Itself. - Aviv Adler; Joshua Ani; Lily Chung; Michael J. Coulombe; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (CoRR, 2023)

Complexity of Reconfiguration in Surface Chemical Reaction Networks. - Robert M. Alaniz; Josh Brunner; Michael J. Coulombe; Erik D. Demaine; Yevhenii Diomidov; Ryan Knobel; Timothy Gomez; Elise Grizzell; Jayson Lynch; Andrew Rodriguez; Robert T. Schweller; Tim Wylie (CoRR, 2023)

Every Author as First Author. - Erik D. Demaine; Martin L. Demaine (CoRR, 2023)

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns. - Hugo A. Akitaya; Josh Brunner; Erik D. Demaine; Dylan H. Hendrickson; Victor Luo; Andy Tockman (CoRR, 2023)

When Can You Tile an Integer Rectangle with Integer Squares? - MIT CompGeom Group; Zachary Abel; Hugo A. Akitaya; Erik D. Demaine; Adam C. Hesterberg; Jayson Lynch (CoRR, 2023)

Any platonic solid can transform to another by O(1) refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (Comput. Geom., 2023)

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. - Joshua Ani; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (Theor. Comput. Sci., 2023)

Traversability, Reconfiguration, and Reachability in the Gadget Framework. - Joshua Ani; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (Algorithmica, 2023)

Complexity of 2D Snake Cube Puzzles. - Pitchayut Saengrungkongka; Erik D. Demaine; Nithid Anchaleenukoon; Kaylee Ji; Alex Dang (CCCG, 2024)

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. - Erik D. Demaine; Timothy Gomez; Elise Grizzell; Markus Hecher; Jayson Lynch; Robert T. Schweller; Ahmed Shalaby 005; Damien Woods (DNA, 2024)

PSPACE-Hard 2D Super Mario Games: Thirteen Doors. - MIT Hardness Group; Hayashi Ani; Erik D. Demaine; Holden Hall; Matias Korman (FUN, 2024)

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games. - MIT Hardness Group; Hayashi Ani; Erik D. Demaine; Holden Hall; Ricardo Ruiz; Naveen Venkat (FUN, 2024)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. - MIT Hardness Group; Josh Brunner; Lily Chung; Erik D. Demaine; Della H. Hendrickson; Andy Tockman (FUN, 2024)

Tetris with Few Piece Types. - MIT Hardness Group; Erik D. Demaine; Holden Hall; Jeffery Li (FUN, 2024)

Graph Threading. - Erik D. Demaine; Yael Kirkpatrick; Rebecca Lin (ITCS, 2024)

Minimum Plane Bichromatic Spanning Trees. - Hugo A. Akitaya; Ahmad Biniaz; Erik D. Demaine; Linda Kleist; Frederick Stock; Csaba D. Tóth (ISAAC, 2024)

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. - MIT Hardness Group; Josh Brunner; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Markus Hecher; Frederick Stock; Zixiang Zhou (ISAAC, 2024)

Routing Reconfigurations. - Rebecca Lin; Wenzhong Yan; Ankur Mehta; Erik D. Demaine (SCF Adjunct, 2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. - MIT-NASA Space Robots Team; Josh Brunner; Kenneth C. Cheung; Erik D. Demaine; Jenny Diomidova; Christine Gregg; Della H. Hendrickson; Irina Kostitsyna (SWAT, 2024)

Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. - Hayashi Ani; Josh Brunner; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Della H. Hendrickson; Yael Kirkpatrick; Jeffery Li; Jayson Lynch; Ritam Nag; Frederick Stock (UCNC, 2024)

Super Guarding and Dark Rays in Art Galleries. - MIT CompGeom Group; Hugo A. Akitaya; Erik D. Demaine; Adam Hesterberg; Anna Lubiw; Jayson Lynch; Joseph O'Rourke; Frederick Stock (CoRR, 2024)

Graph Threading with Turn Costs. - Erik D. Demaine; Yael Kirkpatrick; Rebecca Lin (CoRR, 2024)

Complexity of 2D Snake Cube Puzzles. - MIT Hardness Group; Nithid Anchaleenukoon; Alex Dang; Erik D. Demaine; Kaylee Ji; Pitchayut Saengrungkongka (CoRR, 2024)

All Polyhedral Manifolds are Connected by a 2-Step Refolding. - Lily Chung; Erik D. Demaine; Jenny Diomidova; Tonan Kamata; Jayson Lynch; Ryuhei Uehara; Hanyu Alice Zhang (CoRR, 2024)

Dudeney's Dissection is Optimal. - Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CoRR, 2024)

Folding One Polyhedral Metric Graph into Another. - Lily Chung; Erik D. Demaine; Martin L. Demaine; Markus Hecher; Rebecca Lin; Jayson Lynch; Chie Nara (CoRR, 2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages. - Erik D. Demaine; Martin L. Demaine; Markus Hecher; Rebecca Lin; Victor Luo; Chie Nara (CoRR, 2024)

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude. - Hayashi Ani; Lily Chung; Erik D. Demaine; Jenny Diomidova; Della H. Hendrickson; Jayson Lynch (CoRR, 2024)

Tiling with Three Polygons Is Undecidable. - Erik D. Demaine; Stefan Langerman (SoCG, 2025)

ETH Lower Bounds for n-Queens: Time Waits for Nobody. - Josh Brunner; Erik D. Demaine; Timothy Gomez; Markus Hecher; Meryl Zhang (IWOCA, 2025)

Hardness of Traversing Gadget Systems with Small Bandwidth. - MIT Gadgets Group; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Markus Hecher; Jayson Lynch (SAND, 2025)

edemaine/three-tiles. - Erik D. Demaine; Stefan Langerman (DROPS Artifacts, 2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? - Max Bannach; Erik D. Demaine; Timothy Gomez; Markus Hecher (CoRR, 2025)

2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. - Erik D. Demaine; Kritkorn Karntikoon; Nipun Pitimanaaree (Theory Comput. Syst., 2025)