Erik D. Demaine

803 papers A* 61A 37B 72C 12Misc 28Journal 421Unranked 160

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Novel Reduction from #SAT to #2SAT Based on Symmetry: SOSA Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2026	A	`conf`	Dudeney's Dissection Is Optimal. ITCS Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2026	J	`jnl`	Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling. CoRR Zachary Abel, Erik D. Demaine, Jenny Diomidova, Jeffery Li, Zixiang Zhou
2026	J	`jnl`	Tetris is Hard with Just One Piece Type. CoRR Josh Brunner, Erik D. Demaine, Della H. Hendrickson, Jeffery Li
2026	J	`jnl`	Tetris with few piece types. Theor. Comput. Sci. MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li
2026	J	`jnl`	You can't solve these Super Mario Bros. levels: Undecidable Mario games. Theor. Comput. Sci. Erik D. Demaine, Holden Hall, Hayashi Layers, Ricardo Ruiz, Naveen Venkat
2025	A*	`conf`	#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? LICS Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025	J	`jnl`	#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? CoRR Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025	J	`jnl`	2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. Theory Comput. Syst. Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree
2025	J	`jnl`	A Brush With Words. J. Inf. Process. Mariel Bass, Erik D. Demaine, Martin L. Demaine
2025	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. J. Inf. Process. Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2025	J	`jnl`	Continuous Flattening and Reversing of Convex Polyhedral Linkages. J. Inf. Process. Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Victor Luo, Chie Nara
2025	C	`conf`	ETH Lower Bounds for n-Queens: Time Waits for Nobody. IWOCA Josh Brunner, Erik D. Demaine, Timothy Gomez, Markus Hecher, Meryl Zhang
2025	J	`jnl`	Euclidea is APX-hard: Complexity of Optimizing Euclidean Constructions. J. Inf. Process. Erik D. Demaine, Victor Luo
2025	J	`jnl`	Folding One Polyhedral Metric Graph into Another. J. Inf. Process. Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2025	—	`conf`	Hardness of Traversing Gadget Systems with Small Bandwidth. SAND MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch
2025	J	`jnl`	Minimum Plane Bichromatic Spanning Trees. ACM Trans. Algorithms Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2025	J	`jnl`	PSPACE-Completeness of Reversible Deterministic Systems. Int. J. Found. Comput. Sci. Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2025	J	`jnl`	Pushing Blocks without Fixed Blocks via Checkable Gizmos: Push-1 is PSPACE-Complete. CoRR Josh Brunner, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2025	—	`conf`	Quasigeodesics on the Cube. CCCG MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Thomas C. Hull, Anna Lubiw, Jayson Lynch, Klara Mundilova, Chie Nara, Joseph O'Rourke, Frederick Stock, Josef Tkadlec, Ryuhei Uehara
2025	—	`conf`	Self-Folding Modular Chain Robot for Shape-Changing Objects. SCF Adjunct Sergio Mutis, Alexander Htet Kyaw, Rodrigo Gallardo, Diana Mykhaylychenko, Erik D. Demaine
2025	J	`jnl`	Simulation of programmable matter systems using active tile-based self-assembly. Nat. Comput. John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa
2025	A	`conf`	The Price of Connectivity Augmentation on Planar Graphs. GD Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025	J	`jnl`	The Price of Connectivity Augmentation on Planar Graphs. CoRR Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025	A*	`conf`	Tiling with Three Polygons Is Undecidable. SoCG Erik D. Demaine, Stefan Langerman
2025	J	`jnl`	Undecidability of Tiling with a Tromino. CoRR Zachary Abel, Hugo A. Akitaya, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Stefan Langerman, Jayson Lynch
2025	J	`jnl`	Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2025	J	`jnl`	Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard. J. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2024	Misc	`conf`	ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. FUN MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman
2024	J	`jnl`	ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. CoRR MIT Hardness Group, Josh Brunner, Della H. Hendrickson, Lily Chung, Erik D. Demaine, Andy Tockman
2024	—	`conf`	Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. UCNC Hayashi Ani, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Della H. Hendrickson, Yael Kirkpatrick, Jeffery Li, Jayson Lynch, Ritam Nag, Frederick Stock
2024	J	`jnl`	All Polyhedral Manifolds are Connected by a 2-Step Refolding. CoRR Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2024	—	`conf`	Complexity of 2D Snake Cube Puzzles. CCCG Pitchayut Saengrungkongka, Erik D. Demaine, Nithid Anchaleenukoon, Kaylee Ji, Alex Dang
2024	J	`jnl`	Complexity of 2D Snake Cube Puzzles. CoRR MIT Hardness Group, Nithid Anchaleenukoon, Alex Dang, Erik D. Demaine, Kaylee Ji, Pitchayut Saengrungkongka
2024	J	`jnl`	Continuous Flattening and Reversing of Convex Polyhedral Linkages. CoRR Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Victor Luo, Chie Nara
2024	B	`conf`	Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. DNA Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods
2024	J	`jnl`	Dudeney's Dissection is Optimal. CoRR Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2024	B	`conf`	Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. ISAAC MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou
2024	J	`jnl`	Folding One Polyhedral Metric Graph into Another. CoRR Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2024	J	`jnl`	Graph Threading with Turn Costs. CoRR Erik D. Demaine, Yael Kirkpatrick, Rebecca Lin
2024	A	`conf`	Graph Threading. ITCS Erik D. Demaine, Yael Kirkpatrick, Rebecca Lin
2024	B	`conf`	Minimum Plane Bichromatic Spanning Trees. ISAAC Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2024	J	`jnl`	Minimum Plane Bichromatic Spanning Trees. CoRR Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2024	Misc	`conf`	PSPACE-Hard 2D Super Mario Games: Thirteen Doors. FUN MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman
2024	J	`jnl`	PSPACE-Hard 2D Super Mario Games: Thirteen Doors. CoRR MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman
2024	J	`jnl`	Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude. CoRR Hayashi Ani, Lily Chung, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2024	—	`conf`	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. SWAT MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna
2024	J	`jnl`	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. CoRR MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna
2024	J	`jnl`	Reconfiguration of non-crossing spanning trees. J. Comput. Geom. Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Adam Hesterberg, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2024	—	`conf`	Routing Reconfigurations. SCF Adjunct Rebecca Lin, Wenzhong Yan, Ankur Mehta, Erik D. Demaine
2024	J	`jnl`	Super Guarding and Dark Rays in Art Galleries. CoRR MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke, Frederick Stock
2024	Misc	`conf`	Tetris with Few Piece Types. FUN MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li
2024	J	`jnl`	Tetris with Few Piece Types. CoRR MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li
2024	J	`jnl`	Tiling with Three Polygons is Undecidable. CoRR Erik D. Demaine, Stefan Langerman
2024	Misc	`conf`	You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games. FUN MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat
2024	J	`jnl`	You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games. CoRR MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat
2023	J	`jnl`	2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. CoRR Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree
2023	J	`jnl`	Any platonic solid can transform to another by Comput. Geom. Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2023	—	`conf`	Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. SAND Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. CoRR Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023	B	`conf`	Complexity of Reconfiguration in Surface Chemical Reaction Networks. DNA Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Elise Grizzell, Ryan Knobel, Jayson Lynch, Andrew Rodriguez, Robert Schweller, Tim Wylie
2023	J	`jnl`	Complexity of Reconfiguration in Surface Chemical Reaction Networks. CoRR Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert Schweller, Tim Wylie
2023	J	`jnl`	Complexity of Simple Folding of Mixed Orthogonal Crease Patterns. CoRR Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman
2023	J	`jnl`	Complexity of Solo Chess with Unlimited Moves. CoRR Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch
2023	J	`jnl`	Developing a tetramonohedron with minimum cut length. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2023	J	`jnl`	Every Author as First Author. CoRR Erik D. Demaine, Martin L. Demaine
2023	J	`jnl`	Graph Threading. CoRR Erik D. Demaine, Yael Kirkpatrick, Rebecca Lin
2023	—	`conf`	Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change. CCCG Robert M. Alaniz, Michael J. Coulombe, Erik D. Demaine, Bin Fu, Ryan Knobel, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller, Tim Wylie
2023	J	`jnl`	Rectangular Spiral Galaxies are still hard. Comput. Geom. Erik D. Demaine, Maarten Löffler, Christiane Schmidt
2023	—	`conf`	Super Guarding and Dark Rays in Art Galleries. CCCG Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock
2023	J	`jnl`	This Game Is Not Going To Analyze Itself. CoRR Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. Theor. Comput. Sci. Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. Algorithmica Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2023	J	`jnl`	When Can You Tile an Integer Rectangle with Integer Squares? CoRR MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Adam C. Hesterberg, Jayson Lynch
2022	J	`jnl`	Area-Optimal Simple Polygonalizations: The CG Challenge 2019. ACM J. Exp. Algorithmics Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell
2022	J	`jnl`	Celeste is PSPACE-hard. CoRR Lily Chung, Erik D. Demaine
2022	—	`conf`	Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. SWAT Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
2022	—	`conf`	Complexity of Solo Chess with Unlimited Moves. JCDCGGG Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch
2022	—	`conf`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	J	`jnl`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	—	`conf`	Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2022	A*	`conf`	Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. SoCG Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
2022	J	`jnl`	Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without Flat Angles. CoRR Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
2022	—	`conf`	Geodesic Paths Passing Through All Faces on A Polyhedron. JCDCGGG Erik D. Demaine, Martin L. Demaine, David Eppstein, Hiro Ito, Yuta Katayama, Wataru Maruyama, Yushi Uno
2022	A	`conf`	Hardness of Token Swapping on Trees. ESA Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2022	B	`conf`	Lower Bounds on Retroactive Data Structures. ISAAC Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Lower Bounds on Retroactive Data Structures. CoRR Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Orthogonal Fold & Cut. CoRR Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara
2022	C	`conf`	PSPACE-Completeness of Reversible Deterministic Systems. MCU Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	PSPACE-Completeness of Reversible Deterministic Systems. CoRR Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022	Misc	`conf`	Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. FUN Joshua Ani, Lily Chung, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Reconfiguration of Non-crossing Spanning Trees. CoRR Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2022	Misc	`conf`	Rolling Polyhedra on Tessellations. FUN Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth J. Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
2022	J	`jnl`	The Legend of Zelda: The Complexity of Mechanics. CoRR Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt
2022	—	`conf`	This Game Is Not Going To Analyze Itself. JCDCGGG Aviv Adler, Hayashi Layers, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Della H. Hendrickson, Jayson Lynch
2022	B	`conf`	Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022	B	`conf`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022	J	`jnl`	Unfolding Orthotubes with a Dual Hamiltonian Path. CoRR Erik D. Demaine, Kritkorn Karntikoon
2022	J	`jnl`	Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
2022	—	`conf`	ZHED is NP-complete. CCCG Sagnik Saha, Erik D. Demaine
2021	Misc	`conf`	1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. FUN Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
2021	—	`conf`	An Efficient Reversible Algorithm for Linear Regression. ICRC Erik D. Demaine, Jayson Lynch, Jiaying Sun
2021	—	`conf`	Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CCCG Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021	J	`jnl`	Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CoRR Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021	J	`jnl`	Approximating the Canadian Traveller Problem with Online Randomization. Algorithmica Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
2021	J	`jnl`	Area-Optimal Simple Polygonalizations: The CG Challenge 2019. CoRR Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell
2021	J	`jnl`	Belga B-Trees. Theory Comput. Syst. Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2021	A*	`conf`	Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2021	J	`jnl`	Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
2021	J	`jnl`	Continuous flattening of all polyhedral manifolds using countably infinite creases. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara
2021	—	`conf`	Edge-Unfolding Prismatoids: Tall or Rectangular Base. CCCG Vincent Bian, Erik D. Demaine, Rachana Madhukara
2021	J	`jnl`	Edge-Unfolding Prismatoids: Tall or Rectangular Base. CoRR Vincent Bian, Erik D. Demaine, Rachana Madhukara
2021	—	`conf`	Folding Points to a Point and Lines to a Line. CCCG Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt
2021	J	`jnl`	Folding polyominoes with holes into a cube. Comput. Geom. 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
2021	J	`jnl`	Hardness of Token Swapping on Trees. CoRR Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2021	A*	`conf`	Multidimensional Scaling: Approximation and Complexity. ICML Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John Urschel
2021	J	`jnl`	Multidimensional Scaling: Approximation and Complexity. CoRR Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John Urschel
2021	J	`jnl`	On the effects of hierarchical self-assembly for reducing program-size complexity. Theor. Comput. Sci. Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert Schweller, Scott M. Summers, Andrew Winslow
2021	J	`jnl`	Rectangular Spiral Galaxies are Still Hard. CoRR Erik D. Demaine, Maarten Löffler, Christiane Schmidt
2021	A*	`conf`	Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff
2021	J	`jnl`	Snipperclips: Cutting Tools into Desired Polygons using Themselves. CoRR 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
2021	J	`jnl`	Snipperclips: Cutting tools into desired polygons using themselves. Comput. Geom. 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
2021	J	`jnl`	Strings-and-Coins and Nimstring are PSPACE-complete. CoRR Erik D. Demaine, Jenny Diomidova
2021	Misc	`conf`	Tatamibari Is NP-Complete. FUN Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
2021	J	`jnl`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 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
2021	Misc	`conf`	Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2021	—	`conf`	Yin-Yang Puzzles are NP-complete. CCCG Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021	J	`jnl`	Yin-Yang Puzzles are NP-complete. CoRR Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021	J	`jnl`	ZHED is NP-complete. CoRR Sagnik Saha, Erik D. Demaine
2020	J	`jnl`	1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete. CoRR Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
2020	—	`conf`	2048 Without Merging. CCCG Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth
2020	—	`conf`	Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein
2020	J	`jnl`	Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein
2020	J	`jnl`	Adventures in Maze Folding Art. J. Inf. Process. Erik D. Demaine, Martin L. Demaine
2020	B	`conf`	Arithmetic Expression Construction. ISAAC 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, Lillian Zhang
2020	J	`jnl`	Arithmetic Expression Construction. CoRR 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, Lillian Zhang
2020	J	`jnl`	Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2020	B	`conf`	Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ISAAC Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
2020	J	`jnl`	Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard. CoRR Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
2020	J	`jnl`	Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. CoRR Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell
2020	J	`jnl`	Cookie Clicker. Graphs Comb. Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2020	J	`jnl`	Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. CoRR 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, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020	J	`jnl`	Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. J. Inf. Process. 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, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020	J	`jnl`	Escaping a Polygon. CoRR Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch
2020	J	`jnl`	Existence and Hardness of Conveyor Belts. Electron. J. Comb. 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
2020	A*	`conf`	Finding Closed Quasigeodesics on Convex Polyhedra. SoCG Erik D. Demaine, Adam Hesterberg, Jason S. Ku
2020	J	`jnl`	Finding Closed Quasigeodesics on Convex Polyhedra. CoRR Erik D. Demaine, Adam C. Hesterberg, Jason S. Ku
2020	J	`jnl`	Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. Erik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura
2020	—	`conf`	Folding Small Polyominoes into a Unit Cube. CCCG Kingston Yao Czajkowski, Erik D. Demaine, Martin L. Demaine, Kim Eppling, Robby Kraft, Klara Mundilova, Levi Smith
2020	J	`jnl`	Infinite All-Layers Simple Foldability. Graphs Comb. Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku
2020	J	`jnl`	Negative Instance for the Edge Patrolling Beacon Problem. CoRR Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
2020	—	`conf`	New Results in Sona Drawing: Hardness and TSP Separation. CCCG Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020	J	`jnl`	New Results in Sona Drawing: Hardness and TSP Separation. CoRR Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020	J	`jnl`	PSPACE-completeness of Pulling Blocks to Reach a Goal. CoRR Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020	J	`jnl`	PSPACE-completeness of Pulling Blocks to Reach a Goal. J. Inf. Process. Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020	J	`jnl`	Path Puzzles: Discrete Tomography with a Path Constraint is Hard. Graphs Comb. Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky
2020	J	`jnl`	Polyhedral Characterization of Reversible Hinged Dissections. Graphs Comb. Jin Akiyama, Erik D. Demaine, Stefan Langerman
2020	J	`jnl`	Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2020	B	`conf`	Recursed Is Not Recursive: A Jarring Result. ISAAC Erik D. Demaine, Justin Kopinsky, Jayson Lynch
2020	J	`jnl`	Recursed is not Recursive: A Jarring Result. CoRR Erik D. Demaine, Justin Kopinsky, Jayson Lynch
2020	J	`jnl`	Rigid foldability is NP-hard. J. Comput. Geom. Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi
2020	—	`conf`	Some Polycubes Have No Edge Zipper Unfolding. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke
2020	J	`jnl`	Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2020	J	`jnl`	Tatamibari is NP-complete. CoRR Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
2020	J	`jnl`	Tetris is NP-hard even with J. Inf. Process. Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
2020	J	`jnl`	Tetris is NP-hard even with $O(1)$ rows or columns. CoRR Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal
2020	A	`conf`	Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020	J	`jnl`	Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets. CoRR Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020	—	`conf`	Tribute to Godfried Toussaint. CCCG Erik D. Demaine
2020	J	`jnl`	Universal hinge patterns for folding strips efficiently into any grid polyhedron. Comput. Geom. Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2020	J	`jnl`	Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2020	J	`jnl`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
2019	Misc	`conf`	Belga B-Trees. CSR Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019	J	`jnl`	Belga B-trees. CoRR Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019	J	`jnl`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
2019	J	`jnl`	Existence and hardness of conveyor belts. CoRR 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
2019	—	`conf`	Folding Polyominoes with Holes into a Cube. CCCG 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
2019	J	`jnl`	Folding Polyominoes with Holes into a Cube. CoRR 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
2019	J	`jnl`	Infinite All-Layers Simple Foldability. CoRR Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku
2019	J	`jnl`	Particle computation: complexity, algorithms, and logic. Nat. Comput. Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright
2019	B	`conf`	Reconfiguring Undirected Paths. WADS Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	Reconfiguring Undirected Paths. CoRR Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019	B	`conf`	Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly. DNA John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa
2019	J	`jnl`	Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly. CoRR John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa
2019	J	`jnl`	Some Polycubes Have No Edge-Unzipping. CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke
2019	A	`conf`	Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
2019	J	`jnl`	Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2019	A	`conf`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 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
2019	J	`jnl`	Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR 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
2018	J	`jnl`	A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. CoRR Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2018	J	`jnl`	A simple proof that the ( Theor. Comput. Sci. Erik D. Demaine, Mikhail Rudoy
2018	J	`jnl`	An End-to-End Approach to Self-Folding Origami Structures. IEEE Trans. Robotics Byoungkwon An, Shuhei Miyashita, Aaron C. Ong, Michael Thomas Tolley, Martin L. Demaine, Erik D. Demaine, Robert J. Wood, Daniela Rus
2018	J	`jnl`	Bumpy pyramid folding. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2018	Misc	`conf`	Computational Complexity of Generalized Push Fight. FUN Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy
2018	J	`jnl`	Computational Complexity of Generalized Push Fight. CoRR Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy
2018	Misc	`conf`	Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Computational Complexity of Motion Planning of a Robot through Simple Gadgets. CoRR Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Conflict-Free Coloring of Graphs. SIAM J. Discret. Math. Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer
2018	J	`jnl`	Conic Crease Patterns with Reflecting Rule Lines. CoRR Erik D. Demaine, Martin L. Demaine, David A. Huffman, Duks Koschitz, Tomohiro Tachi
2018	J	`jnl`	Cookie Clicker. CoRR Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2018	A*	`conf`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SoCG Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer
2018	J	`jnl`	Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. CoRR Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer
2018	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2018	J	`jnl`	Editorial fun. Theor. Comput. Sci. Erik D. Demaine, Fabrizio Grandoni
2018	A	`conf`	Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
2018	J	`jnl`	Flat foldings of plane graphs with prescribed angles and edge lengths. J. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2018	J	`jnl`	Folding Polyominoes into (Poly)Cubes. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2018	J	`jnl`	Know When to Fold 'Em: Self-Assembly of Shapes by Folding in Oritatami. CoRR Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, Hadley Thomas
2018	B	`conf`	Know When to Fold 'Em: Self-assembly of Shapes by Folding in Oritatami. DNA Erik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, Hadley Thomas
2018	J	`jnl`	Losing at Checkers is Hard. CoRR Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine, Jayson Lynch
2018	J	`jnl`	Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
2018	—	`conf`	Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
2018	—	`conf`	Negative Instance for the Edge Patrolling Beacon Problem. JCDCGGG Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch
2018	J	`jnl`	Pachinko. Comput. Geom. Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch
2018	—	`conf`	Packing Cube Nets into Rectangles with O(1) Holes. JCDCGGG Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow
2018	J	`jnl`	Path Puzzles: Discrete Tomography with a Path Constraint is Hard. CoRR Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky
2018	J	`jnl`	Polyhedral Characterization of Reversible Hinged Dissections. CoRR Jin Akiyama, Erik D. Demaine, Stefan Langerman
2018	Misc	`conf`	Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. COCOON Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018	J	`jnl`	Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. CoRR Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018	B	`conf`	Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. SPAA Erik D. Demaine, Quanquan C. Liu
2018	J	`jnl`	Rigid Foldability is NP-Hard. CoRR Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi
2018	A	`conf`	Solving the Rubik's Cube Optimally is NP-complete. STACS Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2018	J	`jnl`	Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
2018	Misc	`conf`	The Computational Complexity of Portal and Other 3D Video Games. FUN Erik D. Demaine, Joshua Lockhart, Jayson Lynch
2018	J	`jnl`	The fewest clues problem. Theor. Comput. Sci. Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson
2018	—	`conf`	Toward Unfolding Doubly Covered n-Stars. JCDCGGG 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
2018	—	`conf`	Tree-Residue Vertex-Breaking: a new tool for proving hardness. SWAT Erik D. Demaine, Mikhail Rudoy
2018	Misc	`conf`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2018	J	`jnl`	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. CoRR Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2017	J	`jnl`	A simple proof that the $(n^2-1)$-puzzle is hard. CoRR Erik D. Demaine, Mikhail Rudoy
2017	J	`jnl`	Arboral satisfaction: Recognition and LP approximation. Inf. Process. Lett. Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler
2017	—	`conf`	Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges. CCCG Amartya Shankha Biswas, Erik D. Demaine
2017	—	`conf`	Computing 3SAT on a Fold-and-Cut Machine. CCCG Byoungkwon An, Erik D. Demaine, Martin L. Demaine, Jason S. Ku
2017	J	`jnl`	Embedding Stacked Polytopes on a Polynomial-Size Grid. Discret. Comput. Geom. Erik D. Demaine, André Schulz
2017	J	`jnl`	Even 1 × J. Inf. Process. Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee
2017	J	`jnl`	Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. CoRR Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee
2017	J	`jnl`	Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
2017	J	`jnl`	Folded Structures Satisfying Multiple Conditions. J. Inf. Process. Erik D. Demaine, Jason S. Ku
2017	J	`jnl`	Folding Polyominoes into (Poly)Cubes. CoRR Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2017	J	`jnl`	Folding and Punching Paper. J. Inf. Process. Yasuhiko Asao, Erik D. Demaine, Martin L. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, Kazune Takahashi
2017	J	`jnl`	Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs. CoRR Erik D. Demaine, Mikhail Rudoy
2017	B	`conf`	Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. WADS Erik D. Demaine, Quanquan C. Liu
2017	J	`jnl`	Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. CoRR Erik D. Demaine, Quanquan C. Liu
2017	J	`jnl`	Minimal forcing sets for 1D origami. CoRR Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami
2017	J	`jnl`	New geometric algorithms for fully connected staged self-assembly. Theor. Comput. Sci. Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt
2017	A*	`conf`	Origamizer: A Practical Algorithm for Folding Any Polyhedron. SoCG Erik D. Demaine, Tomohiro Tachi
2017	J	`jnl`	Particle Computation: Complexity, Algorithms, and Logic. CoRR Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright
2017	C	`conf`	Push-Pull Block Puzzles are Hard. CIAC Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017	J	`jnl`	Push-Pull Block Puzzles are Hard. CoRR Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017	B	`conf`	Sequentially Swapping Colored Tokens on Graphs. WALCOM Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2017	J	`jnl`	Simple Folding is Really Hard. J. Inf. Process. Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku
2017	—	`conf`	Snipperclips: Cutting Tools into Desired Polygons using Themselves. CCCG Erik D. Demaine, Matias Korman, André van Renssen, Marcel Roeloffzen
2017	J	`jnl`	Solving the Rubik's Cube Optimally is NP-complete. CoRR Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2017	J	`jnl`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2017	A*	`conf`	Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. SODA Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer
2017	J	`jnl`	Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. CoRR Zachary Abel, Victor Alvarez, Aman Gour, Adam Hesterberg, Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer
2017	J	`jnl`	Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... J. Inf. Process. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu
2017	J	`jnl`	Tree-Residue Vertex-Breaking: a new tool for proving hardness. CoRR Erik D. Demaine, Mikhail Rudoy
2017	J	`jnl`	Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. Graphs Comb. Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke
2017	J	`jnl`	Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
2017	B	`conf`	Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. WADS Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2017	A*	`conf`	Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. SODA Cameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert Schweller, Luis Vega, Tim Wylie
2017	A	`conf`	Upward Partitioned Book Embeddings. GD Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu
2017	J	`jnl`	Upward Partitioned Book Embeddings. CoRR Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu
2016	Misc	`ed.`	8th International Conference on Fun with Algorithms, FUN 2016, La Maddalena, Italy, June 8-10, 2016 FUN Erik D. Demaine, Fabrizio Grandoni
2016	A*	`conf`	A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2016	—	`ch.`	Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms Mohammad Taghi Hajiaghayi, Erik D. Demaine
2016	—	`ch.`	Bidimensionality. Encyclopedia of Algorithms Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2016	B	`conf`	Cache-Adaptive Analysis. SPAA Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley
2016	J	`jnl`	Computational Complexity of Arranging Music. CoRR William S. Moses, Erik D. Demaine
2016	A	`conf`	Energy-Efficient Algorithms. ITCS Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016	J	`jnl`	Energy-Efficient Algorithms. CoRR Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi
2016	J	`jnl`	Folding Flat Crease Patterns with Thick Materials. CoRR Jason S. Ku, Erik D. Demaine
2016	J	`jnl`	Folding a paper strip to minimize thickness. J. Discrete Algorithms Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2016	—	`ch.`	Network Creation Games. Encyclopedia of Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2016	J	`jnl`	Pachinko. CoRR Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch
2016	J	`jnl`	Rigid origami vertices: conditions and forcing sets. J. Comput. Geom. Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi
2016	J	`jnl`	Single-Player and Two-Player Buttons & Scissors Games. CoRR Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2016	Misc	`conf`	Super Mario Bros. is Harder/Easier Than We Thought. FUN Erik D. Demaine, Giovanni Viglietta, Aaron Williams
2016	A*	`conf`	The Complexity of Hex and the Jordan Curve Theorem. ICALP Aviv Adler, Constantinos Daskalakis, Erik D. Demaine
2016	J	`jnl`	The Computational Complexity of Portal and Other 3D Video Games. CoRR Erik D. Demaine, Joshua Lockhart, Jayson Lynch
2016	Misc	`conf`	The Fewest Clues Problem. FUN Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson
2016	J	`jnl`	The Two-Handed Tile Assembly Model is not Intrinsically Universal. Algorithmica Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2016	C	`conf`	Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. RC Nirvan Tyagi, Jayson Lynch, Erik D. Demaine
2016	J	`jnl`	Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms. CoRR Nirvan Tyagi, Jayson Lynch, Erik D. Demaine
2016	J	`jnl`	Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. CoRR Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke
2016	J	`jnl`	Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. CoRR Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2016	J	`jnl`	Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. CoRR Cameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert Schweller, Luis Vega, Tim Wylie
2016	A*	`conf`	Who Needs Crossings? Hardness of Plane Graph Rigidity. SoCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2015	—	`conf`	A Dissimilarity Measure for Comparing Origami Crease Patterns. ICPRAM (1) Seung Man Oh, Godfried T. Toussaint, Erik D. Demaine, Martin L. Demaine
2015	—	`conf`	Box Pleating is Hard. JCDCGG Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
2015	—	`conf`	Bust-a-Move/Puzzle Bobble Is NP-complete. JCDCGG Erik D. Demaine, Stefan Langerman
2015	J	`jnl`	Bust-a-Move/Puzzle Bobble is NP-Complete. CoRR Erik D. Demaine, Stefan Langerman
2015	B	`conf`	Cache-Oblivious Iterated Predecessor Queries via Range Coalescing. WADS Erik D. Demaine, Vineet Gopal, William Hasenplaugh
2015	J	`jnl`	Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations. CoRR Erik D. Demaine, Martin L. Demaine, David A. Huffman, Duks Koschitz, Tomohiro Tachi
2015	J	`jnl`	Classic Nintendo games are (computationally) hard. Theor. Comput. Sci. Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
2015	—	`conf`	Computational complexity of numberless Shakashaka. CCCG Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt
2015	—	`conf`	Continuous Flattening of Orthogonal Polyhedra. JCDCGG Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Chie Nara
2015	—	`conf`	Dissection with the Fewest Pieces is Hard, Even to Approximate. JCDCGG Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee
2015	J	`jnl`	Dissection with the Fewest Pieces is Hard, Even to Approximate. CoRR Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee
2015	—	`conf`	Folding Polyominoes into (Poly)Cubes. CCCG Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2015	B	`conf`	Folding a Paper Strip to Minimize Thickness. WALCOM Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2015	J	`jnl`	Fun with fonts: Algorithmic typography. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine
2015	J	`jnl`	Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2015	—	`conf`	Mario Kart Is Hard. JCDCGG Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten
2015	B	`conf`	New Geometric Algorithms for Fully Connected Staged Self-Assembly. DNA Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt
2015	J	`jnl`	New Geometric Algorithms for Fully Connected Staged Self-Assembly. CoRR Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt
2015	A*	`conf`	Particle computation: Device fan-out and binary memory. ICRA Hamed Mohtasham Shad, Rose Morris-Wright, Erik D. Demaine, Sándor P. Fekete, Aaron T. Becker
2015	B	`conf`	Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. WADS Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia
2015	—	`conf`	Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2015	J	`jnl`	Swapping labeled tokens on graphs. Theor. Comput. Sci. Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2015	—	`conf`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2015	A*	`conf`	Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. SoCG Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, Rose Morris-Wright
2015	J	`jnl`	Worst-Case Optimal Tree Layout in External Memory. Algorithmica Erik D. Demaine, John Iacono, Stefan Langerman
2015	J	`jnl`	You Should Be Scared of German Ghost. J. Inf. Process. Erik D. Demaine, Fermi Ma, Matthew Susskind, Erik Waingarten
2015	J	`jnl`	Zig-Zag Numberlink is NP-Complete. J. Inf. Process. Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2014	A*	`conf`	An end-to-end approach to making self-folded 3D surface shapes by uniform heating. ICRA Byoungkwon An, Shuhei Miyashita, Michael Thomas Tolley, Daniel M. Aukes, Laura Meeker, Erik D. Demaine, Martin L. Demaine, Robert J. Wood, Daniela Rus
2014	J	`jnl`	Approximability of the subset sum reconfiguration problem. J. Comb. Optim. Takehiro Ito, Erik D. Demaine
2014	—	`conf`	Bumpy Pyramid Folding. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2014	—	`conf`	Canadians Should Travel Randomly. ICALP (1) Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
2014	Misc	`conf`	Classic Nintendo Games Are (Computationally) Hard. FUN Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
2014	J	`jnl`	Computational Complexity and an Integer Programming Model of Shakashaka. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2014	J	`jnl`	Computational Complexity of Piano-Hinged Dissections. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara
2014	A*	`conf`	Continuously Flattening Polyhedra Using Straight Skeletons. SoCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke
2014	J	`jnl`	Correction: Basic Network Creation Games. SIAM J. Discret. Math. Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton
2014	J	`jnl`	Covering Folded Shapes. CoRR Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014	J	`jnl`	Covering Folded Shapes. J. Comput. Geom. Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014	J	`jnl`	Embedding Stacked Polytopes on a Polynomial-Size Grid. CoRR Erik D. Demaine, André Schulz
2014	J	`jnl`	Fast Dynamic Pointer Following via Link-Cut Trees. CoRR Erik D. Demaine, Nathan Pinsker, Jon Schneider
2014	J	`jnl`	Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding. CoRR Erik D. Demaine, Jason S. Ku
2014	A	`conf`	Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. GD Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014	J	`jnl`	Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014	J	`jnl`	Folding a Paper Strip to Minimize Thickness. CoRR Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2014	Misc	`conf`	Fun with Fonts: Algorithmic Typography. FUN Erik D. Demaine, Martin L. Demaine
2014	J	`jnl`	Fun with Fonts: Algorithmic Typography. CoRR Erik D. Demaine, Martin L. Demaine
2014	J	`jnl`	How to Influence People with Partial Incentives. CoRR Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
2014	A*	`conf`	How to influence people with partial incentives. WWW Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
2014	J	`jnl`	Minimizing Movement: Fixed-Parameter Tractability. ACM Trans. Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dániel Marx
2014	J	`jnl`	Necklaces, Convolutions, and X+Y. Algorithmica David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2014	J	`jnl`	Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ACM Trans. Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Philip N. Klein
2014	J	`jnl`	On Cartesian Trees and Range Minimum Queries. Algorithmica Erik D. Demaine, Gad M. Landau, Oren Weimann
2014	A	`conf`	On Streaming and Communication Complexity of the Set Cover Problem. DISC Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2014	—	`conf`	One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. ICALP (1) Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
2014	J	`jnl`	Particle Computation: Designing Worlds to Control Robot Swarms with only Global Signals. CoRR Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin
2014	A*	`conf`	Particle computation: Designing worlds to control robot swarms with only global signals. ICRA Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin
2014	J	`jnl`	Picture-Hanging Puzzles. Theory Comput. Syst. Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
2014	Misc	`conf`	Playing Dominoes Is Hard, Except by Yourself. FUN Erik D. Demaine, Fermi Ma, Erik Waingarten
2014	B	`conf`	Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	J	`jnl`	Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	J	`jnl`	Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Algorithmica Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2014	J	`jnl`	Reprint of: Refold rigidity of convex polyhedra. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke
2014	J	`jnl`	Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2014	Misc	`conf`	Swapping Labeled Tokens on Graphs. FUN Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014	J	`jnl`	UNO is hard, even for a single player. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014	J	`jnl`	Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. Graphs Comb. Mirela Damian, Erik D. Demaine, Robin Y. Flatland
2014	J	`jnl`	Zig-Zag Numberlink is NP-Complete. CoRR Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2013	J	`jnl`	A Few Lessons I've Learned. Bull. EATCS Erik D. Demaine
2013	A	`conf`	Algorithms for Designing Pop-Up Cards. STACS Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow
2013	J	`jnl`	Basic Network Creation Games. SIAM J. Discret. Math. Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton
2013	J	`jnl`	Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
2013	B	`conf`	Blame Trees. WADS Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang
2013	J	`jnl`	Bounded-degree polyhedronization of point sets. Comput. Geom. Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
2013	J	`jnl`	Combining Binary Search Trees CoRR Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
2013	—	`conf`	Combining Binary Search Trees. ICALP (1) Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
2013	—	`conf`	Computational complexity and an integer programming model of Shakashaka. CCCG Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2013	J	`jnl`	Constructing Points through Folding and Intersection. Int. J. Comput. Geom. Appl. Steve Butler, Erik D. Demaine, Ronald L. Graham, Tomohiro Tachi
2013	J	`jnl`	Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 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, Diane L. Souvaine, Ryuhei Uehara
2013	—	`conf`	Covering Folded Shapes. CCCG Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2013	J	`jnl`	Efficient reconfiguration of lattice-based modular robots. Comput. Geom. Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer
2013	J	`jnl`	Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. Inf. Media Technol. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013	J	`jnl`	Finding a Hamiltonian Path in a Cube with Specified Turns is Hard. J. Inf. Process. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013	J	`jnl`	Folding Equilateral Plane graphs. Int. J. Comput. Geom. Appl. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2013	A*	`conf`	Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". SODA Erik D. Demaine, Morteza Zadimoghaddam
2013	J	`jnl`	Non-crossing matchings of points with geometric objects. Comput. Geom. 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, Perouz Taslakian
2013	—	`conf`	On Wrapping Spheres and Cubes with Rectangular Paper. JCDCGG Alex Cole, Erik D. Demaine, Eli Fox-Epstein
2013	J	`jnl`	One-dimensional staged self-assembly. Nat. Comput. Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow
2013	C	`conf`	Reconfiguring Massive Particle Swarms with Limited, Global Control. ALGOSENSORS Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Golnaz Habibi, James McLurkin
2013	J	`jnl`	Refold rigidity of convex polyhedra. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke
2013	J	`jnl`	Scheduling to minimize gaps and power consumption. J. Sched. Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
2013	J	`jnl`	The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2013	—	`conf`	The Two-Handed Tile Assembly Model Is Not Intrinsically Universal. ICALP (1) Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2013	J	`jnl`	The two-handed tile assembly model is not intrinsically universal. CoRR Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
2013	A	`conf`	Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. STACS Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow
2013	J	`jnl`	Unfolding Orthogrids with Constant Refinement. CoRR Mirela Damian, Erik D. Demaine, Robin Y. Flatland
2013	—	`conf`	Variations on Instant Insanity. Space-Efficient Data Structures, Streams, and Algorithms Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
2013	—	`conf`	Zipper Unfoldability of Domes and Prismoids. CCCG Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	J	`jnl`	Any Monotone Function Is Realized by Interlocked Polygons. Algorithms Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	J	`jnl`	Classic Nintendo Games are (NP-)Hard CoRR Greg Aloupis, Erik D. Demaine, Alan Guo
2012	J	`jnl`	Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. Internet Math. Erik D. Demaine, Morteza Zadimoghaddam
2012	J	`jnl`	Ghost chimneys. Int. J. Comput. Geom. Appl. David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
2012	J	`jnl`	Hinged Dissections Exist. Discret. Comput. Geom. Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers
2012	J	`jnl`	Minimizing Movement: Fixed-Parameter Tractability CoRR Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2012	J	`jnl`	NP-completeness of generalized Kaboozle. Inf. Media Technol. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	J	`jnl`	NP-completeness of generalized Kaboozle. J. Inf. Process. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	J	`jnl`	Necklaces, Convolutions, and X+Y CoRR David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2012	J	`jnl`	On k-convex polygons. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
2012	J	`jnl`	One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece CoRR Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
2012	B	`conf`	Origami Robots and Star Trek Replicators. ISAAC Erik D. Demaine
2012	J	`jnl`	Picture-Hanging Puzzles CoRR Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
2012	Misc	`conf`	Picture-Hanging Puzzles. FUN Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
2012	J	`jnl`	Reconfiguration of list edge-colorings in a graph. Discret. Appl. Math. Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2012	J	`jnl`	The price of anarchy in network creation games. ACM Trans. Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2012	J	`jnl`	Two Hands Are Better Than One (up to constant factors) CoRR Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert Schweller, Scott M. Summers, Andrew Winslow
2011	J	`jnl`	(Non)Existence of Pleated Folds: How Paper Folds Between Creases. Graphs Comb. Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi
2011	—	`conf`	A Generalization of the Source Unfolding of Convex Polyhedra. EGC Erik D. Demaine, Anna Lubiw
2011	—	`conf`	A Topologically Convex Vertex-Ununfoldable Polyhedron. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine
2011	J	`jnl`	Algorithmic Folding Complexity. Graphs Comb. Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	Algorithms for Solving Rubik's Cubes CoRR Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow
2011	A	`conf`	Algorithms for Solving Rubik's Cubes. ESA Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow
2011	C	`conf`	Approximability of the Subset Sum Reconfiguration Problem. TAMC Takehiro Ito, Erik D. Demaine
2011	—	`conf`	Common Developments of Several Different Orthogonal Boxes. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara
2011	J	`jnl`	Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2011	C	`conf`	Constructing Strings at the Nano Scale via Staged Self-assembly. SPIRE Erik D. Demaine
2011	J	`jnl`	Continuous Blooming of Convex Polyhedra. Graphs Comb. Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke
2011	A*	`conf`	Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2011	—	`conf`	Convexifying Polygons Without Losing Visibilities. CCCG Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow
2011	J	`jnl`	Covering points by disjoint boxes with outliers. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
2011	—	`conf`	Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete. CCCG Zachary Abel, Erik D. Demaine
2011	—	`conf`	Edge-guarding Orthogonal Polyhedra. CCCG Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia
2011	J	`jnl`	Efficient constant-velocity reconfiguration of crystalline robots. Robotica 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
2011	A*	`conf`	Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA Erik D. Demaine, André Schulz
2011	—	`conf`	Expansive Motions for d-Dimensional Open Chains. CCCG Sarah Eisenstat, Erik D. Demaine
2011	B	`conf`	Flattening Fixed-Angle Chains Is Strongly NP-Hard. WADS Erik D. Demaine, Sarah Eisenstat
2011	B	`conf`	Folding Equilateral Plane Graphs. ISAAC Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2011	J	`jnl`	Integer point sets minimizing average pairwise L Comput. Geom. Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2011	B	`conf`	Lossless Fault-Tolerant Data Structures with Additive Overhead. WADS Paul F. Christiano, Erik D. Demaine, Shaunak Kishore
2011	—	`conf`	Meshes Preserving Minimum Feature Size. EGC Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono
2011	—	`conf`	O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
2011	J	`jnl`	On the complexity of reconfiguration problems. Theor. Comput. Sci. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2011	B	`conf`	One-Dimensional Staged Self-assembly. DNA Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow
2011	J	`jnl`	Planning to fold multiple objects from a single self-folding sheet. Robotica Byoungkwon An, Nadia M. Benbernou, Erik D. Demaine, Daniela Rus
2011	J	`jnl`	Programmable Assembly With Universally Foldable Strings (Moteins). IEEE Trans. Robotics Kenneth C. Cheung, Erik D. Demaine, Jonathan Bachrach, Saul Griffith
2011	—	`conf`	Remarks on Separating Words. DCFS Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson
2011	J	`jnl`	Remarks on separating words CoRR Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson
2011	A	`conf`	Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). STACS Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers
2011	J	`jnl`	The Stackelberg Minimum Spanning Tree Game. Algorithmica Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2011	J	`jnl`	The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
2011	J	`jnl`	Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm CoRR Mirela Damian, Erik D. Demaine, Robin Y. Flatland
2010	—	`conf`	10091 Abstracts Collection - Data Structures. Data Structures Lars Arge, Erik D. Demaine, Raimund Seidel
2010	B	`conf`	Algorithmic Graph Minors and Bidimensionality. WG Erik D. Demaine
2010	—	`conf`	Any monotone boolean function can be realized by interlocked polygons. CCCG Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2010	J	`jnl`	Approximation algorithms via contraction decomposition. Comb. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar
2010	B	`conf`	Basic network creation games. SPAA Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton
2010	—	`conf`	Bounded-degree polyhedronization of point sets. CCCG Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
2010	A*	`conf`	Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
2010	J	`jnl`	Circle Packing for Origami Design Is Hard CoRR Erik D. Demaine, Sándor P. Fekete, Robert J. Lang
2010	—	`conf`	Common Unfoldings of Polyominoes and Polycubes. CGGA Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
2010	J	`jnl`	Confluently Persistent Tries for Efficient Version Control. Algorithmica Erik D. Demaine, Stefan Langerman, Eric Price
2010	C	`conf`	Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW Erik D. Demaine, Morteza Zadimoghaddam
2010	—	`conf`	Coverage with COCOA (2) 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, Diane L. Souvaine, Ryuhei Uehara
2010	—	`ed.`	Data Structures, 28.02. - 05.03.2010 Data Structures Lars Arge, Erik D. Demaine, Raimund Seidel
2010	A*	`conf`	Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2010	J	`jnl`	Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Trans. Netw. Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
2010	J	`jnl`	Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. Int. J. Shape Model. Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine
2010	J	`jnl`	Generalized D-Forms Have No Spurious Creases. Discret. Comput. Geom. Erik D. Demaine, Gregory N. Price
2010	—	`conf`	Ghost chimneys. CCCG David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
2010	J	`jnl`	Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geom. Appl. Erik D. Demaine, John Iacono, Stefan Langerman
2010	J	`jnl`	Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? CoRR Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2010	Misc	`conf`	Kaboozle Is NP-complete, Even in a Strip. FUN Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2010	J	`jnl`	Locked and Unlocked Chains of Planar Shapes. Discret. Comput. Geom. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2010	—	`conf`	Making Polygons by Simple Folds and One Straight Cut. CGGA Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens
2010	B	`conf`	Matching Points with Things. LATIN 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, Perouz Taslakian
2010	—	`conf`	Minimizing the Diameter of a Network Using Shortcut Edges. SWAT Erik D. Demaine, Morteza Zadimoghaddam
2010	J	`jnl`	On k-Convex Polygons CoRR Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
2010	—	`conf`	Open problem session. CCCG Erik D. Demaine, Joseph O'Rourke
2010	A*	`conf`	Reconfigurable asynchronous logic automata: (RALA). POPL Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara N. Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, Peter Schmidt-Nielsen
2010	B	`conf`	Scheduling to minimize power consumption using submodular functions. SPAA Erik D. Demaine, Morteza Zadimoghaddam
2010	J	`jnl`	Self-Assembly of Arbitrary Shapes with RNA and DNA tiles (extended abstract) CoRR Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers
2010	A*	`conf`	Shape Replication through Self-Assembly and RNase Enzymes. SODA Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert Schweller
2010	J	`jnl`	The complexity of UNO CoRR Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2010	Misc	`conf`	UNO Is Hard, Even for a Single Player. FUN Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2010	—	`conf`	Zipper unfoldings of polyhedral complexes. CCCG Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit
2009	J	`jnl`	(Non)existence of Pleated Folds: How Paper Folds Between Creases CoRR Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi
2009	—	`conf`	09511 Abstracts Collection - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	—	`conf`	09511 Executive Summary - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	—	`conf`	09511 Open Problems - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	A	`conf`	A Distributed boundary detection algorithm for multi-robot systems. IROS James McLurkin, Erik D. Demaine
2009	J	`jnl`	A Generalized Carpenter's Rule Theorem for Self-Touching Linkages CoRR Timothy G. Abbott, Erik D. Demaine, Blaise Gassend
2009	A*	`conf`	A Pseudopolynomial Algorithm for Alexandrov's Theorem. Computational Geometry Daniel Kane, Gregory Nathan Price, Erik D. Demaine
2009	B	`conf`	A Pseudopolynomial Algorithm for Alexandrov's Theorem. WADS Daniel Kane, Gregory N. Price, Erik D. Demaine
2009	J	`jnl`	A Universal Crease Pattern for Folding Orthogonal Shapes CoRR Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Aviv Ovadya
2009	A*	`conf`	Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi
2009	B	`conf`	Algorithmic Folding Complexity. ISAAC Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
2009	J	`jnl`	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2009	A	`conf`	Algorithms Meet Art, Puzzles, and Magic. ESA Erik D. Demaine
2009	B	`conf`	Algorithms Meet Art, Puzzles, and Magic. WADS Erik D. Demaine
2009	J	`jnl`	An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2009	—	`conf`	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2009	J	`jnl`	Continuous Blooming of Convex Polyhedra CoRR Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke
2009	J	`jnl`	Covering Points by Disjoint Boxes with Outliers CoRR Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
2009	J	`jnl`	Dynamic ham-sandwich cuts in the plane. Comput. Geom. Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung
2009	—	`conf`	Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer
2009	—	`conf`	Filling holes in triangular meshes by curve unfolding. Shape Modeling International Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine
2009	B	`conf`	Folding a Better Checkerboard. ISAAC Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang
2009	—	`book`	Games, puzzles and computation. Robert A. Hearn, Erik D. Demaine
2009	—	`conf`	Integer Point Sets Minimizing Average Pairwise l CCCG Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2009	C	`conf`	Invited Talk I Actuator Nets: Folding, Reconfiguring and Deploying Sensors. ALGOSENSORS Erik D. Demaine
2009	J	`jnl`	Linear reconfiguration of cube-style modular robots. Comput. Geom. 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
2009	B	`conf`	Minimal Locked Trees. WADS Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon
2009	A	`conf`	Minimizing Movement: Fixed-Parameter Tractability. ESA Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	Minimizing movement. ACM Trans. Algorithms Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
2009	J	`jnl`	Minimum feature size preserving decompositions CoRR Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono
2009	—	`conf`	Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein
2009	—	`conf`	On Cartesian Trees and Range Minimum Queries. ICALP (1) Erik D. Demaine, Gad M. Landau, Oren Weimann
2009	—	`conf`	Open Problems from CCCG 2008. CCCG Erik D. Demaine, Joseph O'Rourke
2009	—	`ed.`	Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009 Parameterized complexity and approximation algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
2009	J	`jnl`	Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs CoRR Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2009	A	`conf`	Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2009	J	`jnl`	Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves CoRR Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán, Stefanie Wuhrer
2009	B	`conf`	Reconfiguration of List Edge-Colorings in a Graph. WADS Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2009	J	`jnl`	Refolding Planar Polygons. Discret. Comput. Geom. Hayley N. Iben, James F. O'Brien, Erik D. Demaine
2009	—	`conf`	Relaxed Gabriel Graphs. CCCG Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh
2009	J	`jnl`	The Price of Anarchy in Cooperative Network Creation Games CoRR Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2009	A	`conf`	The Price of Anarchy in Cooperative Network Creation Games. STACS Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2009	J	`jnl`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009	—	`conf`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009	J	`jnl`	The distance geometry of music. Comput. Geom. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2009	A*	`conf`	The geometry of binary search trees. SODA Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu
2009	J	`jnl`	The price of anarchy in cooperative network creation games. SIGecom Exch. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2009	J	`jnl`	Wrapping spheres with flat paper. Comput. Geom. Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman
2008	J	`jnl`	A Locked Orthogonal Tree CoRR David Charlton, Erik D. Demaine, Martin L. Demaine, Gregory N. Price, Yaa-Lirng Tu
2008	J	`jnl`	A Pseudopolynomial Algorithm for Alexandrov's Theorem CoRR Daniel Kane, Gregory N. Price, Erik D. Demaine
2008	—	`conf`	Algorithmic Graph Minors and Bidimensionality. IWPEC Erik D. Demaine
2008	J	`jnl`	Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2008	—	`ch.`	Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi
2008	—	`ch.`	Bidimensionality. Encyclopedia of Algorithms Erik D. Demaine, MohammadTaghi Hajiaghayi
2008	J	`jnl`	Cauchy's Arm Lemma on a Growing Sphere CoRR Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint
2008	J	`jnl`	Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour
2008	J	`jnl`	Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Algorithmica Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2008	—	`conf`	Computational Balloon Twisting: The Theory of Balloon Polyhedra. CCCG Erik D. Demaine, Martin L. Demaine, Vi Hart
2008	—	`conf`	Confluently Persistent Tries for Efficient Version Control. SWAT Erik D. Demaine, Stefan Langerman, Eric Price
2008	A	`conf`	Constraint Logic: A Uniform Framework for Modeling Computation as Games. CCC Erik D. Demaine, Robert A. Hearn
2008	J	`jnl`	Edge-unfolding nested polyhedral bands. Comput. Geom. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2008	—	`conf`	Hinged dissections exist. SCG Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers
2008	J	`jnl`	Linearity of grid minors in treewidth with applications through bidimensionality. Comb. Erik D. Demaine, MohammadTaghi Hajiaghayi
2008	—	`conf`	Moving-Baseline Localization. IPSN Jun-geun Park, Erik D. Demaine, Seth J. Teller
2008	B	`conf`	On the Complexity of Reconfiguration Problems. ISAAC Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2008	J	`jnl`	Optimally Adaptive Integration of Univariate Lipschitz Functions. Algorithmica Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
2008	—	`conf`	Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam
2008	J	`jnl`	Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
2008	C	`conf`	Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 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
2008	J	`jnl`	Realizing partitions respecting full and partial order information. J. Discrete Algorithms Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
2008	B	`conf`	Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. ISAAC Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán Adinolfi, Stefanie Wuhrer
2008	J	`jnl`	Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues CoRR Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine
2008	J	`jnl`	Staged self-assembly: nanomanufacture of arbitrary shapes with Nat. Comput. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine
2008	J	`jnl`	Subquadratic Algorithms for 3SUM. Algorithmica Ilya Baran, Erik D. Demaine, Mihai Patrascu
2008	J	`jnl`	The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. Erik D. Demaine, MohammadTaghi Hajiaghayi
2007	—	`conf`	07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	—	`conf`	07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	B	`conf`	A Pseudopolynomial Time WADS Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma
2007	J	`jnl`	A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
2007	J	`jnl`	An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2007	A*	`conf`	An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2007	A*	`conf`	Approximation algorithms via contraction decomposition. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
2007	—	`conf`	Deflating the Pentagon. KyotoCGGT Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint
2007	—	`conf`	Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2007	J	`jnl`	Dynamic Optimality - Almost. SIAM J. Comput. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
2007	J	`jnl`	Generalized D-Forms Have No Spurious Creases CoRR Gregory N. Price, Erik D. Demaine
2007	J	`jnl`	Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
2007	—	`book`	Geometric folding algorithms - linkages, origami, polyhedra. Erik D. Demaine, Joseph O'Rourke
2007	J	`jnl`	Hinged Dissections Exist CoRR Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers
2007	J	`jnl`	Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity. Graphs Comb. Erik D. Demaine, Martin L. Demaine
2007	B	`conf`	Linear Reconfiguration of Cube-Style Modular Robots. ISAAC 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
2007	A*	`conf`	Minimizing movement. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
2007	—	`conf`	On Rolling Cube Puzzles. CCCG Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian
2007	—	`conf`	Open Problems from CCCG 2006. CCCG Erik D. Demaine, Joseph O'Rourke
2007	J	`jnl`	Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. Sergio Cabello, Erik D. Demaine, Günter Rote
2007	J	`jnl`	Plane Embeddings of Planar Graph Metrics. Discret. Comput. Geom. MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami
2007	J	`jnl`	Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. Erik D. Demaine, Mohammad Taghi Hajiaghayi
2007	J	`jnl`	Retroactive data structures. ACM Trans. Algorithms Erik D. Demaine, John Iacono, Stefan Langerman
2007	B	`conf`	Scheduling to minimize gaps and power consumption. SPAA Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
2007	B	`conf`	Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with DNA Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine
2007	—	`ed.`	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	J	`jnl`	The Distance Geometry of Music CoRR Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2007	J	`jnl`	The Stackelberg Minimum Spanning Tree Game CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007	B	`conf`	The Stackelberg Minimum Spanning Tree Game. WADS Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007	A*	`conf`	The price of anarchy in network creation games. PODC Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2007	—	`conf`	Tight bounds for dynamic convex hull queries (again). SCG Erik D. Demaine, Mihai Patrascu
2007	—	`conf`	Vertex Pops and Popturns. CCCG 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
2006	B	`conf`	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
2006	J	`jnl`	An O(n^3)-Time Algorithm for Tree Edit Distance CoRR Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2006	B	`conf`	Approximability of Partitioning Graphs with Supply and Demand. ISAAC Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2006	A*	`conf`	Combination can be hard: approximability of the unique coverage problem. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour
2006	J	`jnl`	Correlation clustering in general weighted graphs. Theor. Comput. Sci. Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica
2006	—	`conf`	Curves in the Sand: Algorithmic Drawing. CCCG Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint
2006	B	`conf`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2006	B	`conf`	De Dictionariis Dynamicis Pauco Spatio Utentibus ( LATIN Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
2006	J	`jnl`	EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management. Comput. Commun. Ben Leong, Barbara Liskov, Erik D. Demaine
2006	J	`jnl`	Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
2006	J	`jnl`	Locked and Unlocked Chains of Planar Shapes CoRR Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2006	—	`conf`	Locked and unlocked chains of planar shapes. SCG Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2006	J	`jnl`	Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. Mihai Patrascu, Erik D. Demaine
2006	J	`jnl`	Low-Dimensional Embedding with Extra Information. Discret. Comput. Geom. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
2006	A*	`conf`	Lower bounds for asymmetric communication channels and distributed source coding. SODA Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
2006	J	`jnl`	Morpion Solitaire. Theory Comput. Syst. Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman
2006	A	`conf`	Necklaces, Convolutions, and ESA David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
2006	J	`jnl`	Online searching with turn cost. Theor. Comput. Sci. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
2006	—	`conf`	Open Problems: Open Problems from CCCG 2005. CCCG Erik D. Demaine, Joseph O'Rourke
2006	B	`conf`	Optimally Adaptive Integration of Univariate Lipschitz Functions. LATIN Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
2006	A	`conf`	Origami, Linkages, and Polyhedra: Folding with Algorithms. ESA Erik D. Demaine
2006	—	`conf`	Paul Erdos Memorial Lecture: Linkage Folding: From Erdos to Proteins. CCCG Erik D. Demaine
2006	—	`conf`	Plane embeddings of planar graph metrics. SCG MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami
2006	—	`conf`	Polygons Flip Finitely: Flaws and a Fix. CCCG Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint
2006	J	`jnl`	Puzzles, Art, and Magic with Algorithms. Theory Comput. Syst. Erik D. Demaine, Martin L. Demaine
2006	—	`conf`	Refolding planar polygons. SCG Hayley N. Iben, James F. O'Brien, Erik D. Demaine
2006	J	`jnl`	The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discret. Math. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
2006	—	`conf`	Voronoi game on graphs and its complexity. CIG Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
2005	A*	`conf`	Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
2005	J	`jnl`	Bidimensionality, Map Graphs, and Grid Minors CoRR Erik D. Demaine, MohammadTaghi Hajiaghayi
2005	A*	`conf`	Bidimensionality: new connections between FPT algorithms and PTASs. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi
2005	J	`jnl`	Cache-Oblivious B-Trees. SIAM J. Comput. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
2005	—	`ed.`	Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2005	B	`conf`	Communication-Aware Processor Allocation for Supercomputers. WADS Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2005	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2005	J	`jnl`	De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
2005	B	`conf`	Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
2005	—	`conf`	Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. CCCG Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung
2005	J	`jnl`	Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Algorithmica Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Fast allocation and deallocation with an improved buddy system. Acta Informatica Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
2005	J	`jnl`	Fixed-parameter algorithms for ( ACM Trans. Algorithms Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Games on triangulations. Theor. Comput. Sci. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
2005	A*	`conf`	Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi
2005	B	`conf`	Hinged Dissection of Polypolyhedra. WADS Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
2005	J	`jnl`	Hinged dissection of polyominoes and polyforms. Comput. Geom. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
2005	J	`jnl`	Logarithmic Lower Bounds in the Cell-Probe Model CoRR Mihai Patrascu, Erik D. Demaine
2005	A*	`conf`	Mobile-assisted localization in wireless sensor networks. INFOCOM Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller
2005	J	`jnl`	Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve. Int. J. Comput. Geom. Appl. Ilya Baran, Erik D. Demaine
2005	J	`jnl`	Optimal Covering Tours with Turn Costs. SIAM J. Comput. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
2005	A	`conf`	Optimizing a 2D Function Satisfying Unimodality Properties. ESA Erik D. Demaine, Stefan Langerman
2005	A*	`conf`	Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
2005	J	`jnl`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2005	J	`jnl`	PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. Robert A. Hearn, Erik D. Demaine
2005	A*	`conf`	PersiFS: a versioned file system with an efficient representation. SOSP Dan R. K. Ports, Austin T. Clements, Erik D. Demaine
2005	J	`jnl`	Representing Trees of Higher Degree. Algorithmica David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2005	J	`jnl`	Subexponential parameterized algorithms on bounded-genus graphs and J. ACM Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	B	`conf`	Subquadratic Algorithms for 3SUM. WADS Ilya Baran, Erik D. Demaine, Mihai Patrascu
2005	—	`conf`	The Distance Geometry of Deep Rhythms and Scales. CCCG Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2004	—	`conf`	04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2004	B	`conf`	A Simplified, Dynamic Unified Structure. LATIN Mihai Badoiu, Erik D. Demaine
2004	—	`conf`	An energy-driven approach to linkage unfolding. SCG Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien
2004	J	`jnl`	Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
2004	J	`jnl`	Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2004	B	`conf`	Bidimensional Parameters and Local Treewidth. LATIN Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Bidimensional Parameters and Local Treewidth. SIAM J. Discret. Math. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Communication-Aware Processor Allocation for Supercomputers CoRR Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2004	—	`conf`	Continuous foldability of polygonal paper. CCCG Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke
2004	J	`jnl`	Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica Erik D. Demaine, Mohammad Taghi Hajiaghayi
2004	A*	`conf`	Dynamic Optimality - Almost. FOCS Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
2004	—	`conf`	EpiChord: parallelizing the chord lookup algorithm with reactive routing state management. ICON Ben Leong, Barbara Liskov, Erik D. Demaine
2004	A*	`conf`	Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi
2004	A	`conf`	Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. GD Erik D. Demaine, Mohammad Taghi Hajiaghayi
2004	B	`conf`	Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. SSDBM Lukasz Golab, David DeHaan, Alejandro López-Ortiz, Erik D. Demaine
2004	J	`jnl`	Finding hidden independent sets in interval graphs. Theor. Comput. Sci. Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
2004	J	`jnl`	Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004	—	`conf`	Geodesic ham-sandwich cuts. SCG Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
2004	—	`ch.`	Geometry and Topology of Polygonal Linkages. Handbook of Discrete and Computational Geometry, 2nd Ed. Robert Connelly, Erik D. Demaine
2004	—	`conf`	Grid Vertex-Unfolding Orthostacks. JCDCG Erik D. Demaine, John Iacono, Stefan Langerman
2004	A*	`conf`	Interpolation search for non-independent data. SODA Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
2004	—	`conf`	Low-dimensional embedding with extra information. SCG Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
2004	A*	`conf`	Lower bounds for dynamic connectivity. STOC Mihai Patrascu, Erik D. Demaine
2004	J	`jnl`	Online Searching with Turn Cost CoRR Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
2004	—	`conf`	Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. SCG Ilya Baran, Erik D. Demaine
2004	J	`jnl`	Proximate point searching. Comput. Geom. Erik D. Demaine, John Iacono, Stefan Langerman
2004	B	`conf`	Puzzles, Art, and Magic with Algorithms. ISAAC Erik D. Demaine
2004	—	`conf`	Refolding planar polygons. SIGGRAPH Sketches Hayley N. Iben, James F. O'Brien, Erik D. Demaine
2004	A*	`conf`	Retroactive data structures. SODA Erik D. Demaine, John Iacono, Stefan Langerman
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	J	`jnl`	Solitaire Clobber. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2004	A*	`conf`	Subexponential parameterized algorithms on graphs of bounded-genus and SODA Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Tetris is hard, even to approximate. Int. J. Comput. Geom. Appl. Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
2004	B	`conf`	The Bidimensional Theory of Bounded-Genus Graphs. MFCS Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	A*	`conf`	Tight bounds for the partial-sums problem. SODA Mihai Patrascu, Erik D. Demaine
2004	J	`jnl`	Tight bounds on maximal and maximum matchings. Discret. Math. Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2004	—	`conf`	Unfolding polyhedral bands. CCCG Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2004	J	`jnl`	When can you fold a map? Comput. Geom. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
2004	J	`jnl`	Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR Erik D. Demaine, John Iacono, Stefan Langerman
2003	J	`jnl`	A linear lower bound on index size for text retrieval. J. Algorithms Erik D. Demaine, Alejandro López-Ortiz
2003	Misc	`conf`	Anchor-free distributed localization in sensor networks. SenSys Nissanka Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller
2003	—	`conf`	Correlation Clustering with Partial Information. RANDOM-APPROX Erik D. Demaine, Nicole Immorlica
2003	Misc	`conf`	Finding Hidden Independent Sets in Interval Graphs. COCOON Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
2003	A*	`conf`	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2003	B	`conf`	Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
2003	—	`conf`	Hinged Dissection of Polygons is Hard. CCCG Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson
2003	A	`conf`	Identifying frequent items in sliding windows over on-line packet streams. Internet Measurement Conference Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2003	J	`jnl`	Interlocked open and closed linkages with few joints. Comput. Geom. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
2003	J	`jnl`	K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. Bioinform. Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi S. Jaakkola
2003	J	`jnl`	Long proteins with unique optimal foldings in the H-P model. Comput. Geom. Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2003	—	`conf`	On the Complexity of Halfspace Volume Queries. CCCG Erik D. Demaine, Jeff Erickson, Stefan Langerman
2003	J	`jnl`	On universally easy classes for NP-complete problems. Theor. Comput. Sci. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2003	A	`conf`	Open Problems from ALENEX 2003. ALENEX Erik D. Demaine
2003	J	`jnl`	Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve CoRR Ilya Baran, Erik D. Demaine
2003	J	`jnl`	Optimal Covering Tours with Turn Costs CoRR Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
2003	A	`conf`	Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
2003	B	`conf`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2003	J	`jnl`	Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
2003	A	`conf`	Planar Embeddings of Graphs with Specified Edge Lengths. GD Sergio Cabello, Erik D. Demaine, Günter Rote
2003	J	`jnl`	Pushing blocks is hard. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
2003	J	`jnl`	Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Discret. Comput. Geom. Robert Connelly, Erik D. Demaine, Günter Rote
2003	Misc	`conf`	Tetris is Hard, Even to Approximate. COCOON Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
2003	J	`jnl`	Ununfoldable polyhedra with convex faces. Comput. Geom. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
2002	—	`conf`	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2002	J	`jnl`	A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
2002	J	`jnl`	Balanced Discret. Math. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2002	A*	`conf`	Cache-oblivious priority queue and graph algorithm applications. STOC Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2002	J	`jnl`	Coin-Moving Puzzles CoRR Erik D. Demaine, Martin L. Demaine, Helena A. Verrill
2002	—	`conf`	Computing signed permutations of polygons. CCCG Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2002	J	`jnl`	Efficient Tree Layout in a Multilevel Memory Hierarchy CoRR Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup
2002	A	`conf`	Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
2002	J	`jnl`	Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs Comb. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
2002	B	`conf`	Exponential Speedup of Fixed-Parameter Algorithms on K ISAAC Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2002	B	`conf`	Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint
2002	J	`jnl`	Flipturning Polygons. Discret. Comput. Geom. Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
2002	A	`conf`	Frequency Estimation of Internet Packet Streams with Limited Space. ESA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2002	—	`conf`	Interlocked open linkages with few joints. SCG Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
2002	C	`conf`	K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. WABI Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi S. Jaakkola, Nathan Srebro
2002	J	`jnl`	Long Proteins with Unique Optimal Foldings in the H-P Model CoRR Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2002	—	`conf`	On flat-state connectivity of chains with fixed acute angles. CCCG Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2002	J	`jnl`	Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
2002	J	`jnl`	Open Problems from CCCG 2002 CoRR Erik D. Demaine, Joseph O'Rourke
2002	—	`conf`	Open problems from cccg 2001. CCCG Erik D. Demaine, Joseph O'Rourke
2002	J	`jnl`	PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation CoRR Robert A. Hearn, Erik D. Demaine
2002	—	`conf`	Playing with Triangulations. JCDCG Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
2002	—	`conf`	Proximate point searching. CCCG Erik D. Demaine, John Iacono, Stefan Langerman
2002	—	`conf`	Push-2-f is pspace-complete. CCCG Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
2002	—	`conf`	Robot Localization without Depth Perception. SWAT Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2002	A	`conf`	Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
2002	J	`jnl`	Solitaire Clobber CoRR Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2002	—	`conf`	Solitaire Clobber. Computers and Games Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer
2002	J	`jnl`	Tetris is Hard, Even to Approximate CoRR Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
2002	A*	`conf`	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP Robert A. Hearn, Erik D. Demaine
2002	—	`conf`	Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang
2002	A	`conf`	Two Simplified Algorithms for Maintaining Order in a List. ESA Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
2002	—	`conf`	Vertex-unfoldings of simplicial manifolds. SCG Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	A*	`conf`	A linear lower bound on index size for text retrieval. SODA Erik D. Demaine, Alejandro López-Ortiz
2001	J	`jnl`	Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
2001	J	`jnl`	Enumerating Foldings and Unfoldings between Polygons and Polytopes CoRR Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
2001	A	`conf`	Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2001	J	`jnl`	Generalized Communicators in the Message Passing Interface. IEEE Trans. Parallel Distributed Syst. Erik D. Demaine, Ian T. Foster, Carl Kesselman, Marc Snir
2001	J	`jnl`	Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 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
2001	A*	`conf`	On universally easy classes for NP-complete problems. SODA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2001	—	`conf`	Open problems from cccg 2000. CCCG Erik D. Demaine, Joseph O'Rourke
2001	A*	`conf`	Optimal covering tours with turn costs. SODA Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
2001	J	`jnl`	Playing Games with Algorithms: Algorithmic Combinatorial Game Theory CoRR Erik D. Demaine
2001	B	`conf`	Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. MFCS Erik D. Demaine
2001	J	`jnl`	Polygons cuttable by a circular saw. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
2001	—	`conf`	Pushing blocks is np-complete for noncrossing solution paths. CCCG Erik D. Demaine, Michael Hoffmann
2001	—	`conf`	Reaching folded states of a rectangular piece of paper. CCCG Erik D. Demaine, Joseph S. B. Mitchell
2001	J	`jnl`	Reconfiguring convex polygons. Comput. Geom. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2001	—	`conf`	Short interlocked linkages. CCCG Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
2001	J	`jnl`	The Complexity of Clickomania CoRR Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
2001	—	`conf`	The cccg 2001 logo. CCCG Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2001	B	`conf`	Tight Bounds on Maximal and Maximum Matchings. ISAAC Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Manifolds CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Polyhedra CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	B	`conf`	When Can You Fold a Map? WADS Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
2000	A*	`conf`	Adaptive set intersections, unions, and differences. SODA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2000	B	`conf`	Balanced MFCS Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
2000	A*	`conf`	Cache-Oblivious B-Trees. FOCS Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
2000	J	`jnl`	Computational Geometry Column 37. Int. J. Comput. Geom. Appl. Erik D. Demaine, Joseph O'Rourke
2000	C	`conf`	Every Polygon Can Be Untangled. EuroCG Robert Connelly, Erik D. Demaine, Günter Rote
2000	J	`jnl`	Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes CoRR Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
2000	J	`jnl`	Flipturning polygons CoRR Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
2000	—	`conf`	Folding and Unfolding Linkages, Paper, and Polyhedra. JCDCG Erik D. Demaine
2000	J	`jnl`	Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
2000	B	`conf`	Online Routing in Convex Subdivisions. ISAAC Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
2000	J	`jnl`	Phutball Endgames are Hard CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein
2000	—	`conf`	Polygons Cuttable by a Circular Saw. CCCG Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
2000	J	`jnl`	PushPush and Push-1 are NP-hard in 2D CoRR Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
2000	—	`conf`	PushPush and Push-1 are NP-hard in 2D. CCCG Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
2000	J	`jnl`	PushPush is NP-hard in 2D CoRR Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
2000	—	`conf`	Reconfiguring Convex Polygons. CCCG Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2000	—	`conf`	Session O1: Open Problems and Planning. CCCG Erik D. Demaine, Joseph O'Rourke
2000	A*	`conf`	Straighting Polygonal Arcs and Convexifying Polygonal Cycles. FOCS Robert Connelly, Erik D. Demaine, Günter Rote
2000	J	`jnl`	When Can You Fold a Map? CoRR Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
1999	J	`jnl`	Computational Geometry Column 37 CoRR Erik D. Demaine, Joseph O'Rourke
1999	J	`jnl`	Computational geometry column 37. SIGACT News Erik D. Demaine, Joseph O'Rourke
1999	B	`conf`	Convexifying Monotone Polygons. ISAAC Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
1999	A*	`conf`	Efficient Algorithms for Petersen's Matching Theorem. SODA Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
1999	—	`conf`	Fast Allocation and Deallocation with an Improved Buddy System. FSTTCS Erik D. Demaine, J. Ian Munro
1999	—	`conf`	Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. SCG Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
1999	A*	`conf`	Folding and One Straight Cut Suffice. SODA Erik D. Demaine, Martin L. Demaine, Anna Lubiw
1999	J	`jnl`	Hinged Dissection of Polyominoes and Polyforms CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
1999	—	`conf`	Hinged dissections of polyominoes and polyforms. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
1999	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1999	A*	`conf`	Locked and Unlocked Polygonal Chains in 3D. SODA 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
1999	—	`conf`	Metamorphosis of the Cube. SCG Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
1999	J	`jnl`	On Reconfiguring Tree Linkages: Trees can Lock CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1999	B	`conf`	Representing Trees of Higer Degree. WADS David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
1999	B	`conf`	Resizable Arrays in Optimal Time and Space. WADS Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
1999	J	`jnl`	Ununfoldable Polyhedra with Convex Faces CoRR Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
1999	—	`conf`	Ununfoldable polyhedra. CCCG Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo
1998	J	`jnl`	C to Java: Converting Pointers into References. Concurr. Pract. Exp. Erik D. Demaine
1998	—	`conf`	Folding and Cutting Paper. JCDCG Erik D. Demaine, Martin L. Demaine, Anna Lubiw
1998	—	`conf`	Hiding disks in folded polygons. CCCG Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
1998	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1998	—	`conf`	On reconfiguring tree linkages: Trees can lock. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	A	`conf`	Planar Drawings of Origami Polyhedra. GD Erik D. Demaine, Martin L. Demaine
1998	—	`conf`	Protocols for Non-Deterministic Communication over Synchronous Channels. IPPS/SPDP Erik D. Demaine
1998	—	`conf`	Unfolding some classes of orthogonal polyhedra. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
1996	J	`jnl`	A Novel Routing Algorithm for k-Ary n-Cube Interconnection Networks. Int. J. High Speed Comput. Erik D. Demaine, Sampalli Srinivas