・ 2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs , Demaine, E.D.| Karntikoon, K.| Pitimanaaree, N. , Theory of Computing Systems
・ Tiling with Three Polygons Is Undecidable , Demaine, E.D.| Langerman, S. , Leibniz International Proceedings in Informatics, LIPIcs
・ WHO NEEDS CROSSINGS?: NONCROSSING LINKAGES ARE UNIVERSAL, AND DECIDING (GLOBAL) RIGIDITY IS HARD* , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B. , Journal of Computational Geometry
・ Simulation of programmable matter systems using active tile-based self-assembly , Alumbaugh, J.C.| Daymude, J.J.| Demaine, E.D.| Patitz, M.J.| Richa, A.W. , Natural Computing
・ Hardness of Traversing Gadget Systems with Small Bandwidth , Demaine, E.D.| Diomidova, J.| Gomez, T.| Hecher, M.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More , Ani, H.| Brunner, J.| Demaine, E.D.| Diomidova, J.| Gomez, T.| Hendrickson, D.| Kirkpatrick, Y.| Li, J.| Lynch, J.| Nag, R.| Stock, F. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ You Can’t Solve These Super Mario Bros. Levels: Undecidable Mario Games , Hardness, M.| Ani, H.| Demaine, E.D.| Hall, H.| Ruiz, R.| Venkat, N. , Leibniz International Proceedings in Informatics, LIPIcs
・ ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles , Hardness, M.| Brunner, J.| Chung, L.| Demaine, E.D.| Hendrickson, D.| Tockman, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Graph threading , Demaine, E.D.| Kirkpatrick, Y.| Lin, R. , Leibniz International Proceedings in Informatics, LIPIcs
・ PSPACE-Hard 2D Super Mario Games: Thirteen Doors , Hardness, M.| Ani, H.| Demaine, E.D.| Hall, H.| Korman, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds , Demaine, E.D.| Gomez, T.| Grizzell, E.| Hecher, M.| Lynch, J.| Schweller, R.| Shalaby, A.| Woods, D. , Leibniz International Proceedings in Informatics, LIPIcs
・ RECONFIGURATION OF NON-CROSSING SPANNING TREES , Aichholzer, O.| Ballinger, B.| Biedl, T.| Damian, M.| Demaine, E.D.| Hesterberg, A.| Korman, M.| Lubiw, A.| Lynch, J.| Tkadlec, J.| Uno, Y. , Journal of Computational Geometry
・ Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints , Brunner, J.| Cheung, K.C.| Demaine, E.D.| Diomidova, J.| Gregg, C.| Hendrickson, D.H.| Kostitsyna, I. , Leibniz International Proceedings in Informatics, LIPIcs
・ Minimum Plane Bichromatic Spanning Trees , Akitaya, H.A.| Biniaz, A.| Demaine, E.D.| Kleist, L.| Stock, F.| Tóth, C.D. , Leibniz International Proceedings in Informatics, LIPIcs
・ Routing Reconfigurations , Lin, R.| Yan, W.| Mehta, A.| Demaine, E.D. , Adjunct Proceedings - SCF 2024: 9th ACM Symposium on Computational Fabrication
・ Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs , Demaine, E.D.| Gomez, T.| Stock, F.| Brunner, J.| Diomidova, J.| Hecher, M.| Zhou, Z. , Leibniz International Proceedings in Informatics, LIPIcs
・ Tetris with Few Piece Types , Hardness, M.| Demaine, E.D.| Hall, H.| Li, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Complexity of Reconfiguration in Surface Chemical Reaction Networks , Alaniz, R.M.| Brunner, J.| Coulombe, M.| Demaine, E.D.| Diomidova, J.| Gomez, T.| Grizzell, E.| Knobel, R.| Lynch, J.| Rodriguez, A.| Schweller, R.| Wylie, T. , Leibniz International Proceedings in Informatics, LIPIcs
・ Locally Flat and Rigidly Foldable Discretizations of Conic Crease Patterns with Reflecting Rule Lines , Demaine, E.D.| Mundilova, K.| Tachi, T. , Lecture Notes on Data Engineering and Communications Technologies
・ The Legend of Zelda: The Complexity of Mechanics , Bosboom, J.| Brunner, J.| Coulombe, M.| Demaine, E.D.| Hendrickson, D.H.| Lynch, J.| Najt, E. , Thai Journal of Mathematics
・ Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets , Ani, J.| Demaine, E.D.| Hendrickson, D.H.| Lynch, J. , Theoretical Computer Science
・ Celeste is PSPACE-hard , Chung, L.| Demaine, E.D. , Thai Journal of Mathematics
・ Traversability, Reconfiguration, and Reachability in the Gadget Framework , Ani, J.| Demaine, E.D.| Diomidov, Y.| Hendrickson, D.| Lynch, J. , Algorithmica
・ Unfolding Orthotubes with a Dual Hamiltonian Path , Demaine, E.D.| Karntikoon, K. , Thai Journal of Mathematics
・ Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines , Ani, J.| Coulombe, M.| Demaine, E.D.| Diomidov, Y.| Gomez, T.| Hendrickson, D.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Developing a tetramonohedron with minimum cut length , Demaine, E.D.| Demaine, M.L.| Uehara, R. , Computational Geometry: Theory and Applications
・ Multifold Tiles of Polyominoes and Convex Lattice Polygons , Chida, K.| Demaine, E.D.| Demaine, M.L.| Eppstein, D.| Hesterberg, A.| Horiyama, T.| Iacono, J.| Ito, H.| Langerman, S.| Uehara, R.| Uno, Y. , Thai Journal of Mathematics
・ Complexity of Simple Folding of Mixed Orthogonal Crease Patterns , Akitaya, H.| Brunner, J.| Demaine, E.D.| Hendrickson, D.| Luo, V.| Tockman, A. , Thai Journal of Mathematics
・ Chess Equilibrium Puzzles , Demaine, E.D.| Liu, Q.C. , Mathematics Magazine
・ KIRIGAMI CORRUGATIONS: STRONG, MODULAR, AND PROGRAMMABLE PLATE LATTICES , Rubio, A.P.| Mundilova, K.| Preiss, D.| Demaine, E.D.| Gershenfeld, N. , Proceedings of the ASME Design Engineering Technical Conference
・ Any platonic solid can transform to another by O(1) refoldings , Demaine, E.D.| Demaine, M.L.| Diomidov, Y.| Kamata, T.| Uehara, R.| Zhang, H.A. , Computational Geometry: Theory and Applications
・ Rectangular Spiral Galaxies are still hard , Demaine, E.D.| Löffler, M.| Schmidt, C. , Computational Geometry: Theory and Applications
・ 2.5D SIGNAGE FROM SHEET MATERIAL WITH ORTHOGONAL CUTS AND FOLDS , Demaine, E.D.| Demaine, M.L.| Devadoss, S.L.| Myers, P.| Rubio, A.P. , Proceedings of the ASME Design Engineering Technical Conference
・ Orthogonal Fold & Cut , Ani, J.| Brunner, J.| Demaine, E.D.| Demaine, M.L.| Hendrickson, D.| Luo, V.| Madhukara, R. , Thai Journal of Mathematics
・ Hardness of Token Swapping on Trees , Aichholzer, O.| Demaine, E.D.| Korman, M.| Lubiw, A.| Lynch, J.| Masárová, Z.| Rudoy, M.| Williams, V.V.| Wein, N. , Leibniz International Proceedings in Informatics, LIPIcs
・ Pushing Blocks via Checkable Gadgets: PSPACECompleteness of Push-1F and Block/Box Dude , Ani, J.| Chung, L.| Demaine, E.D.| Diomidov, Y.| Hendrickson, D.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares , Akitaya, H.A.| Demaine, E.D.| Korman, M.| Kostitsyna, I.| Parada, I.| Sonke, W.| Speckmann, B.| Uehara, R.| Wulms, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 , Demaine, E.D.| Fekete, S.P.| Keldenich, P.| Krupke, D.| Mitchell, J.S.B. , ACM Journal of Experimental Algorithmics
・ Traversability, Reconfiguration, and Reachability in the Gadget Framework , Ani, J.| Demaine, E.D.| Diomidov, Y.| Hendrickson, D.| Lynch, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ PSPACE-Completeness of Reversible Deterministic Systems , Demaine, E.D.| Hearn, R.A.| Hendrickson, D.| Lynch, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets , Ani, J.| Demaine, E.D.| Hendrickson, D.| Lynch, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ ZHED is NP-complete , Saha, S.| Demaine, E.D. , Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022
・ Strings-and-coins and nimstring are PSPACE-complete , Demaine, E.D.| Diomidov, Y. , Combinatorial Game Theory: A Special Collection in Honor of Elwyn Berlekamp, John H. Conway and Richard K. Guy
・ Rolling Polyhedra on Tessellations , Baes, A.| Demaine, E.D.| Demaine, M.L.| Hartung, E.| Langerman, S.| O'Rourke, J.| Uehara, R.| Uno, Y.| Williams, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Strings-And-Coins and Nimstring are PSPACE-complete , Demaine, E.D.| Diomidov, Y. , De Gruyter Proceedings in Mathematics
・ Discretization to Prove the Nonexistence of “Small” Common Unfoldings Between Polyhedra , Arseneva, E.| Demaine, E.D.| Kamata, T.| Uehara, R. , Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022
・ Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles , Chung, L.| Demaine, E.D.| Hendrickson, D.| Luo, V. , Leibniz International Proceedings in Informatics, LIPIcs
・ Computational Complexity of Flattening Fixed-Angle Orthogonal Chains , Demaine, E.D.| Ito, H.| Lynch, J.| Uehara, R. , Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022
・ Lower Bounds on Retroactive Data Structures , Chung, L.| Demaine, E.D.| Hendrickson, D.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Ununfoldable polyhedra with 6 vertices or 6 faces , Akitaya, H.A.| Demaine, E.D.| Eppstein, D.| Tachi, T.| Uehara, R. , Computational Geometry: Theory and Applications
・ Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers , Akitaya, H.A.| Arkin, E.M.| Damian, M.| Demaine, E.D.| Dujmović, V.| Flatland, R.| Korman, M.| Palop, B.| Parada, I.| Renssen, A.| Sacristán, V. , Algorithmica
・ Unlocking history through automated virtual unfolding of sealed documents imaged by X-ray microtomography , Dambrogio, J.| Ghassaei, A.| Smith, D.S.| Jackson, H.| Demaine, M.L.| Davis, G.| Mills, D.| Ahrendt, R.| Akkerman, N.| van der Linden, D.| Demaine, E.D. , Nature Communications
・ Characterizing universal reconfigurability of modular pivoting robots , Akitaya, H.A.| Demaine, E.D.| Gonczi, A.| Hendrickson, D.H.| Hesterberg, A.| Korman, M.| Korten, O.| Lynch, J.| Parada, I.| Sacristán, V. , Leibniz International Proceedings in Informatics, LIPIcs
・ Multidimensional Scaling: Approximation and Complexity , Demaine, E.| Hesterberg, A.| Koehler, F.| Lynch, J.| Urschel, J. , Proceedings of Machine Learning Research
・ On the effects of hierarchical self-assembly for reducing program-size complexity , Cannon, S.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Furcy, D.| Patitz, M.J.| Schweller, R.| Summers, S.M.| Winslow, A. , Theoretical Computer Science
・ Approximating the Canadian Traveller Problem with Online Randomization , Demaine, E.D.| Huang, Y.| Liao, C.-S.| Sadakane, K. , Algorithmica
・ An Efficient Reversible Algorithm for Linear Regression , Demaine, E.D.| Lynch, J.| Sun, J. , Proceedings - 2021 International Conference on Rebooting Computing, ICRC 2021
・ Yin-Yang Puzzles are NP-complete , Demaine, E.D.| Lynch, J.| Rudoy, M.| Uno, Y. , Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021
・ Folding polyominoes with holes into a cube , Aichholzer, O.| Akitaya, H.A.| Cheung, K.C.| Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Kleist, L.| Kostitsyna, I.| Löffler, M.| Masárová, Z.| Mundilova, K.| Schmidt, C. , Computational Geometry: Theory and Applications
・ Scalable Equilibrium Computation in Multi-agent Influence Games on Networks , Christia, F.| Curry, M.| Daskalakis, C.| Demaine, E.| Dickerson, J.P.| Hajiaghayi, M.| Hesterberg, A.| Knittel, M.| Milliff, A. , 35th AAAI Conference on Artificial Intelligence, AAAI 2021
・ Any Regular Polyhedron Can Transform to Another by O(1) Refoldings , Demaine, E.D.| Demaine, M.L.| Diomidov, Y.| Kamata, T.| Uehara, R.| Zhang, H.A. , Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021
・ Continuous flattening of all polyhedral manifolds using countably infinite creases , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Ku, J.S.| Lynch, J.| Itoh, J.-I.| Nara, C. , Computational Geometry: Theory and Applications
・ Folding Points to a Point and Lines to a Line , Akitaya, H.A.| Ballinger, B.| Demaine, E.D.| Hull, T.C.| Schmidt, C. , Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021
・ Lotus: A curved folding design tool for Grasshopper , Mundilova, K.| Demaine, E.| Foschi, R.| Kraft, R.| Maleczek, R.| Tachi, T. , Association for Computer Aided Design in Architecture Annual Conference, ACADIA 2021
・ Packing Cube Nets into Rectangles with O(1) Holes , Demaine, E.D.| Demaine, M.L.| Uehara, R.| Uno, Y.| Winslow, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Snipperclips: Cutting tools into desired polygons using themselves , Abel, Z.| Akitaya, H.| Chiu, M.-K.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Korman, M.| Lynch, J.| van Renssen, A.| Roeloffzen, M. , Computational Geometry: Theory and Applications
・ Toward Unfolding Doubly Covered n-Stars , Akitaya, H.A.| Ballinger, B.| Damian, M.| Demaine, E.D.| Demaine, M.L.| Flatland, R.| Kostitsyna, I.| Ku, J.S.| Langerman, S.| O’Rourke, J.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ STRINGS-AND-COINS AND NIMSTRING ARE PSPACE-COMPLETE , Demaine, E.D.| Diomidov, Y. , Integers
・ Edge-Unfolding Prismatoids: Tall or Rectangular Base , Bian, V.| Demaine, E.D.| Madhukara, R. , Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021
・ Belga B-Trees , Demaine, E.D.| Iacono, J.| Koumoutsos, G.| Langerman, S. , Theory of Computing Systems
・ Negative Instance for the Edge Patrolling Beacon Problem , Abel, Z.| Akitaya, H.A.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Korman, M.| Ku, J.S.| Lynch, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets , Ani, J.| Bosboom, J.| Demaine, E.D.| Diomidov, Y.| Hendrickson, D.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Tatamibari is NP-complete , Adler, A.| Bosboom, J.| Demaine, E.D.| Demaine, M.L.| Liu, Q.C.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard , Demaine, E.D.| Hendrickson, D.H.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Pspace-completeness of pulling blocks to reach a goal , Ani, J.| Asif, S.| Demaine, E.D.| Diomidov, Y.| Hendrickson, D.| Lynch, J.| Scheffler, S.| Suhl, A. , Journal of Information Processing
・ Tetris is np-hard even with o(1) rows or columns , Asif, S.| Coulombe, M.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Lynch, J.| Singhal, M. , Journal of Information Processing
・ Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect , Cardinal, J.| Demaine, E.D.| Eppstein, D.| Hearn, R.A.| Winslow, A. , Theoretical Computer Science
・ Symmetric assembly puzzles are hard, beyond a few pieces , Demaine, E.D.| Korman, M.| Ku, J.S.| Mitchell, J.S.B.| Otachi, Y.| van Renssen, A.| Roeloffzen, M.| Uehara, R.| Uno, Y. , Computational Geometry: Theory and Applications
・ Rigid foldability is NP-hard , Akitaya, H.A.| Demaine, E.D.| Horiyama, T.| Hull, T.C.| Ku, J.S.| Tachi, T. , Journal of Computational Geometry
・ 1 × 1 rush hour with fixed blocks is PSPACE-complete , Brunner, J.| Chung, L.| Demaine, E.D.| Hendrickson, D.| Hesterberg, A.| Suhl, A.| Zeff, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Edge matching with inequalities, triangles, unknown shape, and two players , Bosboom, J.| Chen, C.| Chung, L.| Compton, S.| Coulombe, M.| Demaine, E.D.| Demaine, M.L.| Filho, I.T.F.A.| Hendrickson, D.| Hesterberg, A.| Hsu, C.| Hu, W.| Korten, O.| Luo, Z.| Zhang, L. , Journal of Information Processing
・ Universal hinge patterns for folding strips efficiently into any grid polyhedron , Benbernou, N.M.| Demaine, E.D.| Demaine, M.L.| Lubiw, A. , Computational Geometry: Theory and Applications
・ Path Puzzles: Discrete Tomography with a Path Constraint is Hard , Bosboom, J.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Kimball, R.| Kopinsky, J. , Graphs and Combinatorics
・ Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible , Abel, Z.| Bosboom, J.| Coulombe, M.| Demaine, E.D.| Hamilton, L.| Hesterberg, A.| Kopinsky, J.| Lynch, J.| Rudoy, M.| Thielen, C. , Theoretical Computer Science
・ Folding Small Polyominoes into a Unit Cube , Czajkowski, K.Y.| Demaine, E.D.| Demaine, M.L.| Eppling, K.| Kraft, R.| Mundilova, K.| Smith, L. , Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020
・ Polyhedral Characterization of Reversible Hinged Dissections , Akiyama, J.| Demaine, E.D.| Langerman, S. , Graphs and Combinatorics
・ Recursed is not recursive: A jarring result , Demaine, E.D.| Kopinsky, J.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Infinite All-Layers Simple Foldability , Akitaya, H.A.| Avery, C.| Bergeron, J.| Demaine, E.D.| Kopinsky, J.| Ku, J.S. , Graphs and Combinatorics
・ Complexity of retrograde and helpmate chess problems: Even cooperative chess is hard , Brunner, J.| Demaine, E.D.| Hendrickson, D.| Wellman, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Finding closed quasigeodesics on convex polyhedra , Demaine, E.D.| Hesterberg, A.C.| Ku, J.S. , Leibniz International Proceedings in Informatics, LIPIcs
・ 2048 Without Merging , Akitaya, H.A.| Demaine, E.D.| Ku, J.S.| Lynch, J.| Paterson, M.| Tóth, C.D. , Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020
・ Some Polycubes Have No Edge Zipper Unfolding , Demaine, E.D.| Demaine, M.L.| Eppstein, D.| O’Rourke, J. , Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020
・ Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra , Demaine, E.D.| Demaine, M.L.| Eppstein, D. , Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020
・ Cookie Clicker , Demaine, E.D.| Ito, H.| Langerman, S.| Lynch, J.| Rudoy, M.| Xiao, K. , Graphs and Combinatorics
・ Flat folding a strip with parallel or nonacute zigzag creases with mountain–valley assignment , Demaine, E.D.| Demaine, M.L.| Ito, H.| Nara, C.| Shirahama, I.| Tachi, T.| Tomura, M. , Journal of Information Processing
・ Adventures in maze folding art , Demaine, E.D.| Demaine, M.L. , Journal of Information Processing
・ Arithmetic expression construction , Alcock, L.| Bosboom, J.| Chen, C.| Epstein, R.| Hirschfeld, L.| Lynch, J.| Zhang, L.| Asif, S.| Brunner, J.| Demaine, E.D.| Hesterberg, A.| Hu, W.| Scheffler, S. , Leibniz International Proceedings in Informatics, LIPIcs
・ New Results in Sona Drawing: Hardness and TSP Separation , Chiu, M.-K.| Demaine, E.D.| Diomidov, Y.| Eppstein, D.| Hearn, R.A.| Hesterberg, A.| Korman, M.| Parada, I.| Rudoy, M. , Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020
・ Existence and hardness of conveyor belts , Baird, M.| Billey, S.C.| Demaine, E.D.| Demaine, M.L.| Eppstein, D.| Fekete, S.| Gordon, G.| Griffin, S.| Mitchell, J.S.B.| Swanson, J.P. , Electronic Journal of Combinatorics
・ Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch , Demaine, E.D.| Fekete, S.P.| Keldenich, P.| Meijer, H.| Scheffer, C. , SIAM Journal on Computing
・ Particle computation: complexity, algorithms, and logic , Becker, A.T.| Demaine, E.D.| Fekete, S.P.| Lonsford, J.| Morris-Wright, R. , Natural Computing
・ Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs , Demaine, E.D.| Reidl, F.| Rossmanith, P.| Sánchez Villaamil, F.| Sikdar, S.| Sullivan, B.D. , Journal of Computer and System Sciences
・ Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly , Alumbaugh, J.C.| Daymude, J.J.| Demaine, E.D.| Patitz, M.J.| Richa, A.W. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Reconfiguring undirected paths , Demaine, E.D.| Eppstein, D.| Hesterberg, A.| Jain, K.| Lubiw, A.| Uehara, R.| Uno, Y. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class , Demaine, E.D.| Goodrich, T.D.| Kloster, K.| Lavallee, B.| Liu, Q.C.| Sullivan, B.D.| Vakilian, A.| van der Poel, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Sequentially swapping colored tokens on graphs , Yamanaka, K.| Demaine, E.D.| Horiyama, T.| Kawamura, A.| Nakano, S.-I.| Okamoto, Y.| Saitoh, T.| Suzuki, A.| Uehara, R.| Uno, T. , Journal of Graph Algorithms and Applications
・ SPIRAL GALAXIES FONT , Anderson, W.| Demaine, E.D.| Demaine, M.L. , The Mathematics of Various Entertaining Subjects: The Magic of Mathematics: Volume 3
・ Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers , Akitaya, H.A.| Arkin, E.M.| Damian, M.| Demaine, E.D.| Dujmović, V.| Flatland, R.| Korman, M.| Palop, B.| Parada, I.| van Renssen, A.| Sacristán, V. , Leibniz International Proceedings in Informatics, LIPIcs
・ Folding polyominoes with holes into a cube , Aichholzer, O.| Akitaya, H.A.| Cheung, K.C.| Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Kleist, L.| Kostitsyna, I.| Löffler, M.| Masárová, Z.| Mundilova, K.| Schmidt, C. , Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019
・ Belga B-trees , Demaine, E.D.| Iacono, J.| Koumoutsos, G.| Langerman, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ LOSING AT CHECKERS IS HARD , Bosboom, J.| Congero, S.| Demaine, E.D.| Demaine, M.L.| Lynch, J. , The Mathematics of Various Entertaining Subjects: The Magic of Mathematics: Volume 3
・ An End-to-End Approach to Self-Folding Origami Structures , An, B.| Miyashita, S.| Ong, A.| Tolley, M.T.| Demaine, M.L.| Demaine, E.D.| Wood, R.J.| Rus, D. , IEEE Transactions on Robotics
・ A simple proof that the (n2 − 1)-puzzle is hard , Demaine, E.D.| Rudoy, M. , Theoretical Computer Science
・ Computational complexity of motion planning of a robot through simple gadgets , Demaine, E.D.| Grosof, I.| Lynch, J.| Rudoy, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Conflict-free coloring of graphs , Abel, Z.| Alvarez, V.| Demaine, E.D.| Fekete, S.P.| Gour, A.| Hesterberg, A.| Keldenich, P.| Scheffer, C. , SIAM Journal on Discrete Mathematics
・ Know when to fold ’Em: Self-assembly of shapes by folding in Oritatami , Demaine, E.D.| Hendricks, J.| Olsen, M.| Patitz, M.J.| Rogers, T.A.| Schabanel, N.| Seki, S.| Thomas, H. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch , Demaine, E.D.| Fekete, S.P.| Keldenich, P.| Scheffer, C.| Meijer, H. , Leibniz International Proceedings in Informatics, LIPIcs
・ Red-blue pebble game: Complexity of computing the trade-off between cache size and memory transfers , Demaine, E.D.| Liu, Q.C. , Annual ACM Symposium on Parallelism in Algorithms and Architectures
・ Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams , Aronov, B.| Bose, P.| Demaine, E.D.| Gudmundsson, J.| Iacono, J.| Langerman, S.| Smid, M. , Algorithmica
・ Upward partitioned book embeddings , Akitaya, H.A.| Demaine, E.D.| Hesterberg, A.| Liu, Q.C. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Nearly optimal separation between partially and fully retroactive data structures , Chen, L.| Demaine, E.D.| Gu, Y.| Williams, V.V.| Xu, Y.| Yu, Y. , Leibniz International Proceedings in Informatics, LIPIcs
・ Solving the Rubik’s Cube optimally is NP-complete , Demaine, E.D.| Eisenstat, S.| Rudoy, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy , Demaine, E.D.| Lincoln, A.| Liu, Q.C.| Lynch, J.| Williams, V.V. , Leibniz International Proceedings in Informatics, LIPIcs
・ Bumpy pyramid folding , Abel, Z.R.| Demaine, E.D.| Demaine, M.L.| Ito, H.| Snoeyink, J.| Uehara, R. , Computational Geometry: Theory and Applications
・ The fewest clues problem , Demaine, E.D.| Ma, F.| Schvartzman, A.| Waingarten, E.| Aaronson, S. , Theoretical Computer Science
・ Folding polyominoes into (poly)cubes , Aichholzer, O.| Biro, M.| Demaine, E.D.| Demaine, M.L.| Eppstein, D.| Fekete, S.P.| Hesterberg, A.| Kostitsyna, I.| Schmidt, C. , International Journal of Computational Geometry and Applications
・ Tree-residue vertex-breaking: A new tool for proving hardness , Demaine, E.D.| Rudoy, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ The computational complexity of portal and other 3D video games , Demaine, E.D.| Lockhart, J.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs
・ Pachinko , Akitaya, H.A.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Hurtado, F.| Ku, J.S.| Lynch, J. , Computational Geometry: Theory and Applications
・ Who witnesses the witness? Finding witnesses in the witness is hard and sometimes impossible , Abel, Z.| Bosboom, J.| Demaine, E.D.| Hamilton, L.| Hesterberg, A.| Kopinsky, J.| Lynch, J.| Rudoy, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Computational complexity of generalized push fight , Bosboom, J.| Demaine, E.D.| Rudoy, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Tangled Tangles , Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Liu, Q.| Taylor, R.| Uehara, R. , The Best Writing on Mathematics: 2018
・ Juggling and Card Shuffling Meet Mathematical Fonts , Demaine, E.D.| Demaine, M.L. , Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham
・ Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect , Cardinal, J.| Demaine, E.D.| Eppstein, D.| Hearn, R.A.| Winslow, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Origamizer: A practical algorithm for folding any polyhedron , Demaine, E.D.| Tachi, T. , Leibniz International Proceedings in Informatics, LIPIcs
・ New geometric algorithms for fully connected staged self-assembly , Demaine, E.D.| Fekete, S.P.| Scheffer, C.| Schmidt, A. , Theoretical Computer Science
・ Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement , Damian, M.| Demaine, E.| Flatland, R.| O’Rourke, J. , Graphs and Combinatorics
・ Simple folding is really hard , Akitaya, H.A.| Demaine, E.D.| Ku, J.S. , Journal of Information Processing
・ Three colors suffice: Conflict-free coloring of planar graphs , Abel, Z.| Alvarez, V.| Demaine, E.D.| Feketey, S.P.| Gour, A.| Hesterberg, A.| Keldenich, P.| Scheffery, C. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Inapproximability of the standard pebble game and hard to pebble graphs , Demaine, E.D.| Liu, Q.C. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Universal shape replicators via self-assembly with attractive and repulsive forces , Chalk, C.| Demaine, E.D.| Demaine, M.L.| Martinez, E.| Schweller, R.| Vega, L.| Wylie, T. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Geometry and topology of polygonal linkages , Connelly, R.| Demaine, E.D. , Handbook of Discrete and Computational Geometry, Third Edition
・ Sequentially swapping colored tokens on graphs , Yamanaka, K.| Demaine, E.D.| Horiyama, T.| Kawamura, A.| Nakano, S.-I.| Okamoto, Y.| Saitoh, T.| Suzuki, A.| Uehara, R.| Uno, T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Even 1 × n edge-matching and jigsaw puzzles are really hard , Bosboom, J.| Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Manurangsi, P.| Yodpinyanee, A. , Journal of Information Processing
・ Push-pull block puzzles are hard , Demaine, E.D.| Grosof, I.| Lynch, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares , Abel, Z.| Ballinger, B.| Demaine, E.D.| Demaine, M.L.| Erickson, J.| Hesterberg, A.| Ito, H.| Kostitsyna, I.| Lynch, J.| Uehara, R. , Journal of Information Processing
・ Total tetris: Tetris with monominoes, dominoes, trominoes, pentominoes, … , Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Hesterberg, A.| Lincoln, A.| Lynch, J.| William Yu, Y. , Journal of Information Processing
・ CLICKOMANIA IS HARD, EVEN WITH TWO COLORS AND COLUMNS , Adler, A.| Demaine, E.D.| Hesterberg, A.| Liu, Q.| Rudoy, M. , The Mathematics of Various Entertaining Subjects: Volume 2: Research in Games, Graphs, Counting, and Complexity
・ Embedding Stacked Polytopes on a Polynomial-Size Grid , Demaine, E.D.| Schulz, A. , Discrete and Computational Geometry
・ Folding and punching paper , Asao, Y.| Demaine, E.D.| Demaine, M.L.| Hosaka, H.| Kawamura, A.| Tachi, T.| Takahashi, K. , Journal of Information Processing
・ Common development of prisms, anti-prisms, tetrahedra, and wedges , Biswas, A.S.| Demaine, E.D. , CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings
・ Folded structures satisfying multiple conditions , Demaine, E.D.| Ku, J.S. , Journal of Information Processing
・ TANGLED TANGLES , Demaine, E.D.| Demaine, M.L.| Hesterberg, A.| Liu, Q.| Taylor, R.| Uehara, R. , The Mathematics of Various Entertaining Subjects: Volume 2: Research in Games, Graphs, Counting, and Complexity
・ COMPUTATIONAL COMPLEXITY OF ARRANGING MUSIC , Demaine, E.D.| Moses, W.S. , The Mathematics of Various Entertaining Subjects: Volume 2: Research in Games, Graphs, Counting, and Complexity
・ Universal hinge patterns for folding strips efficiently into any grid polyhedron , Benbernou, N.M.| Demaine, E.D.| Demaine, M.L.| Lubiw, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Snipperclips: Cutting Tools into Desired Polygons using Themselves , Demaine, E.D.| Korman, M.| Van Renssen, A.| Roeloffzen, M. , CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings
・ Arboral satisfaction: Recognition and LP approximation , Demaine, E.D.| Ganesan, V.| Kontsevoi, V.| Liu, Q.| Liu, Q.| Ma, F.| Nachum, O.| Sidford, A.| Waingarten, E.| Ziegler, D. , Information Processing Letters
・ Computing 3SAT on a fold-and-cut machine , An, B.| Demaine, E.D.| Demaine, M.L.| Ku, J.S. , CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings
・ Folding flat crease patterns with thick materials , Ku, J.S.| Demaine, E.D. , Journal of Mechanisms and Robotics
・ Who needs crossings? Hardness of plane graph rigidity , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B. , Leibniz International Proceedings in Informatics, LIPIcs
・ Circle packing for origami design is hard , Demaine, E.D.| Fekete, S.P.| Lang, R.J. , Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education
・ Reconstructing david huffman's legacy in curved-crease folding , Demaine, E.D.| Demaine, M.L.| Koschitz, D. , Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education
・ Energy-efficient algorithms , Demaine, E.D.| Lynch, J.| Mirano, G.J.| Tyagi, N. , ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
・ A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting , Bateni, M.| Hajiaghayi, M.| Demaine, E.D.| Marx, D. , Proceedings of the Annual ACM Symposium on Theory of Computing
・ Box pleating is hard , Akitaya, H.A.| Cheung, K.C.| Demaine, E.D.| Horiyama, T.| Hull, T.C.| Ku, J.S.| Tachi, T.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Super Mario Bros. is harder/easier than we thought , Demaine, E.D.| Viglietta, G.| Williams, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Cache-adaptive analysis , Bender, M.A.| Demaine, E.D.| Ebrahimi, R.| Fineman, J.T.| Johnson, R.| Lincoln, A.| Lynch, J.| McCauley, S. , Annual ACM Symposium on Parallelism in Algorithms and Architectures
・ The Two-Handed Tile Assembly Model is not Intrinsically Universal , Demaine, E.D.| Patitz, M.J.| Rogers, T.A.| Schweller, R.T.| Summers, S.M.| Woods, D. , Algorithmica
・ Bidimensionality , Fomin, F.V.| Demaine, E.D.| Hajiaghayi, M.T.| Thilikos, D. , Encyclopedia of Algorithms, Second Edition
・ Universal hinge patterns for folding orthogonal shapes , Benbernou, N.M.| Demaine, E.D.| Demaine, M.L.| Ovadya, A. , Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education
・ Continuous flattening of orthogonal polyhedra , Demaine, E.D.| Demaine, M.L.| Itoh, J.-I.| Nara, C. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Single-player and two-player buttons & scissors games , Burke, K.| Demaine, E.D.| Gregg, H.| Hearn, R.A.| Hesterberg, A.| Hoffmann, M.| Ito, H.| Kostitsyna, I.| Leonard, J.| Löffler, M.| Santiago, A.| Schmidt, C.| Uehara, R.| Uno, Y.| Williams, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ The fewest clues problem , Demaine, E.D.| Ma, F.| Schvartzman, A.| Waingarten, E.| Aaronson, S. , Leibniz International Proceedings in Informatics, LIPIcs
・ The complexity of hex and the Jordan curve theorem , Adler, A.| Daskalakis, C.| Demaine, E.D. , Leibniz International Proceedings in Informatics, LIPIcs
・ Symmetric assembly puzzles are hard, beyond a few pieces , Demaine, E.D.| Korman, M.| Ku, J.S.| Mitchell, J.S.B.| Otachi, Y.| Renssen, A.| Roeloffzen, M.| Uehara, R.| Uno, Y. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Toward an energy efficient language and compiler for (partially) reversible algorithms , Tyagi, N.| Lynch, J.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Mario kart is hard , Bosboom, J.| Demaine, E.D.| Hesterberg, A.| Lynch, J.| Waingarten, E. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Dissection with the fewest pieces is hard, even to approximate , Bosboom, J.| Demaine, E.D.| Demaine, M.L.| Lynch, J.| Manurangsi, P.| Rudoy, M.| Yodpinyanee, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Folding a paper strip to minimize thickness , Demaine, E.D.| Eppstein, D.| Hesterberg, A.| Ito, H.| Lubiw, A.| Uehara, R.| Uno, Y. , Journal of Discrete Algorithms
・ Bust-a-move/puzzle bobble is NP-complete , Demaine, E.D.| Langerman, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Approximation Schemes for Planar Graph Problems , Hajiaghayi, M.T.| Demaine, E.D. , Encyclopedia of Algorithms, Second Edition
・ Network Creation Games , Demaine, E.D.| Hajiaghayi, M.T.| Mahini, H.| Zadimoghaddam, M. , Encyclopedia of Algorithms, Second Edition
・ Swapping labeled tokens on graphs , Yamanaka, K.| Demaine, E.D.| Ito, T.| Kawahara, J.| Kiyomi, M.| Okamoto, Y.| Saitoh, T.| Suzuki, A.| Uchizawa, K.| Uno, T. , Theoretical Computer Science
・ Linear-time algorithm for sliding tokens on trees , Demaine, E.D.| Demaine, M.L.| Fox-Epstein, E.| Hoang, D.A.| Ito, T.| Ono, H.| Otachi, Y.| Uehara, R.| Yamada, T. , Theoretical Computer Science
・ Classic Nintendo games are (computationally) hard , Aloupis, G.| Demaine, E.D.| Guo, A.| Viglietta, G. , Theoretical Computer Science
・ Zig-Zag Numberlink is NP-Complete , Adcock, A.| Demaine, E.D.| Demaine, M.L.| O'Brien, M.P.| Reidl, F.| Villaamil, F.S.| Sullivan, B.D. , Journal of Information Processing
・ Fun with fonts: Algorithmic typography , Demaine, E.D.| Demaine, M.L. , Theoretical Computer Science
・ Particle computation: Device fan-out and binary memory , Shad, H.M.| Morris-Wright, R.| Demaine, E.D.| Fekete, S.P.| Becker, A.T. , Proceedings - IEEE International Conference on Robotics and Automation
・ Tilt: The Video Designing Worlds to Control Robot Swarms with only Global Signals , Becker, A.T.| Demaine, E.D.| Fekete, S.P.| Shad, H.M.| Morris-Wright, R. , Leibniz International Proceedings in Informatics, LIPIcs
・ New geometric algorithms for fully connected staged self-assembly , Demaine, E.D.| Fekete, S.P.| Scheffer, C.| Schmidt, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Folding flat crease patterns with thick materials , Ku, J.S.| Demaine, E.D. , Proceedings of the ASME Design Engineering Technical Conference
・ Worst-Case Optimal Tree Layout in External Memory , Demaine, E.D.| Iacono, J.| Langerman, S. , Algorithmica
・ Polylogarithmic fully retroactive priority queues via hierarchical checkpointing , Demaine, E.D.| Kaler, T.| Liu, Q.| Sidford, A.| Yedidia, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Computational complexity of numberless Shakashaka , Adler, A.| Biro, M.| Demaine, E.| Rudoy, M.| Schmidt, C. , Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015
・ Folding a paper strip to minimize thickness , Demaine, E.D.| Eppstein, D.| Hesterberg, A.| Ito, H.| Lubiw, A.| Uehara, R.| Uno, Y. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Folding polyominoes into (poly) cubes , Aichholzer, O.| Biro, M.| Demaine, E.| Demaine, M.| Eppstein, D.| Feketek, S.P.| Hesterberg, A.| Kostitsyna, I.| Schmidt, C. , Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015
・ Cache-oblivious iterated predecessor queries via range coalescing , Demaine, E.D.| Gopal, V.| Hasenplaugh, W. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A dissimilarity measure for comparing origami crease patterns , Oh, S.M.| Toussaint, G.T.| Demaine, E.D.| Demaine, M.L. , ICPRAM 2015 - 4th International Conference on Pattern Recognition Applications and Methods, Proceedings
・ You should be Scared of German Ghost , Demaine, E.D.| Ma, F.| Susskind, M.| Waingarten, E. , Journal of Information Processing
・ A method for building self-folding machines , Felton, S.| Tolley, M.| Demaine, E.| Rus, D.| Wood, R. , Science
・ Necklaces, convolutions, and X+Y , Bremner, D.| Chan, T.M.| Demaine, E.D.| Erickson, J.| Hurtado, F.| Iacono, J.| Langerman, S.| Pǎtraşcu, M.| Taslakian, P. , Algorithmica
・ An end-to-end approach to making self-folded 3D surface shapes by uniform heating , An, B.| Miyashita, S.| Tolley, M.T.| Aukes, D.M.| Meeker, L.| Demaine, E.D.| Demaine, M.L.| Wood, R.J.| Rus, D. , Proceedings - IEEE International Conference on Robotics and Automation
・ How to influence people with partial incentives , Demaine, E.D.| Hajiaghayi, M.T.| Mahini, H.| Malec, D.L.| Raghavan, S.| Sawant, A.| Zadimoghadam, M. , WWW 2014 - Proceedings of the 23rd International Conference on World Wide Web
・ On Cartesian trees and range minimum queries , Demaine, E.D.| Landau, G.M.| Weimann, O. , Algorithmica
・ One tile to rule them all: Simulating any tile assembly system with a single universal tile , Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Patitz, M.J.| Schweller, R.T.| Winslow, A.| Woods, D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Node-weighted steiner tree and group steiner tree in planar graphs , Demaine, E.D.| Hajiaghayi, M.| Klein, P.N. , ACM Transactions on Algorithms
・ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs , Borradaile, G.| Demaine, E.D.| Tazari, S. , Algorithmica
・ On streaming and communication complexity of the set cover problem , Demaine, E.D.| Indyk, P.| Mahabadi, S.| Vakilian, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Particle computation: Designing worlds to control robot swarms with only global signals , Becker, A.| Demaine, E.D.| Fekete, S.P.| McLurkin, J. , Proceedings - IEEE International Conference on Robotics and Automation
・ Computational complexity and an integer programming model of shakashaka , Demaine, E.D.| Okamoto, Y.| Uehara, R.| Uno, Y. , IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
・ Approximability of the subset sum reconfiguration problem , Ito, T.| Demaine, E.D. , Journal of Combinatorial Optimization
・ Polynomial-time algorithm for sliding tokens on trees , Demaine, E.D.| Demaine, M.L.| Fox-Epstein, E.| Hoang, D.A.| Ito, T.| Ono, H.| Otachi, Y.| Uehara, R.| Yamada, T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Swapping labeled tokens on graphs , Yamanaka, K.| Demaine, E.D.| Ito, T.| Kawahara, J.| Kiyomi, M.| Okamoto, Y.| Saitoh, T.| Suzuki, A.| Uchizawa, K.| Uno, T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Continuously flattening polyhedra using straight skeletons , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Itoh, J.-I.| Lubiw, A.| Nara, C.| O'Rourke, J. , Proceedings of the Annual Symposium on Computational Geometry
・ Classic Nintendo games are (computationally) hard , Aloupis, G.| Demaine, E.D.| Guo, A.| Viglietta, G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Minimizing movement: Fixed-parameter tractability , Demaine, E.D.| Hajiaghayi, M.| Marx, D. , ACM Transactions on Algorithms
・ Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm , Damian, M.| Demaine, E.D.| Flatland, R. , Graphs and Combinatorics
・ UNO is hard, even for a single player , Demaine, E.D.| Demaine, M.L.| Harvey, N.J.A.| Uehara, R.| Uno, T.| Uno, Y. , Theoretical Computer Science
・ Correction: Basic network creation games , Alon, N.| Demaine, E.D.| Hajiaghayi, M.| Kanellopoulos, P.| Leighton, T. , SIAM Journal on Discrete Mathematics
・ Canadians should travel randomly , Demaine, E.D.| Huang, Y.| Liao, C.-S.| Sadakane, K. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Picture-hanging puzzles , Demaine, E.D.| Demaine, M.L.| Minsky, Y.N.| Mitchell, J.S.| Rivest, R.L.| Pătraşcu, M. , Theory of Computing Systems
・ On wrapping spheres and cubes with rectangular paper , Cole, A.| Demaine, E.D.| Fox-Epstein, E. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Flat foldings of plane graphs with prescribed angles and edge lengths , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eppstein, D.| Lubiw, A.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Bumpy pyramid folding , Abel, Z.R.| Demaine, E.D.| Demaine, M.L.| Ito, H.| Snoeyink, J.| Uehara, R. , 26th Canadian Conference on Computational Geometry, CCCG 2014
・ Playing dominoes is hard, except by yourself , Demaine, E.D.| Ma, F.| Waingarten, E. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Fun with fonts: Algorithmic typography , Demaine, E.D.| Demaine, M.L. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Reprint of: Refold rigidity of convex polyhedra , Demaine, E.D.| Demaine, M.L.| Itoh, J.-I.| Lubiw, A.| Nara, C.| O'Rourke, J. , Computational Geometry: Theory and Applications
・ Computational complexity of piano-hinged dissections , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Horiyama, T.| Uehara, R. , IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
・ Self-folding with shape memory composites , Felton, S.M.| Tolley, M.T.| Shin, B.| Onal, C.D.| Demaine, E.D.| Rus, D.| Wood, R.J. , Soft Matter
・ Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM , Cannon, S.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Patitz, M.J.| Schwellerk, R.T.| Summers, S.M.| Winslow, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ Basic network creation games , Alon, N.| Demaine, E.D.| Hajiaghayi, M.T.| Leighton, T. , SIAM Journal on Discrete Mathematics
・ The two-handed tile assembly model is not intrinsically universal , Demaine, E.D.| Patitz, M.J.| Rogers, T.A.| Schweller, R.T.| Summers, S.M.| Woods, D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Reconfiguring massive particle swarms with limited, global control , Becker, A.| Demaine, E.D.| Fekete, S.P.| Habibi, G.| McLurkin, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Non-crossing matchings of points with geometric objects , Aloupis, G.| Cardinal, J.| Collette, S.| Demaine, E.D.| Demaine, M.L.| Dulieu, M.| Fabila-Monroy, R.| Hart, V.| Hurtado, F.| Langerman, S.| Saumell, M.| Seara, C.| Taslakian, P. , Computational Geometry: Theory and Applications
・ Efficient reconfiguration of lattice-based modular robots , Aloupis, G.| Benbernou, N.| Damian, M.| Demaine, E.D.| Flatland, R.| Iacono, J.| Wuhrer, S. , Computational Geometry: Theory and Applications
・ PCB origami: A material-based design approach to computer-aided foldable electronic devices , Sterman, Y.| Demaine, E.D.| Oxman, N. , Journal of Mechanical Design
・ Reconstructing David Huffman's origami tessellations , Davis, E.| Demaine, E.D.| Demaine, M.L.| Ramseyer, J. , Journal of Mechanical Design
・ Scheduling to minimize gaps and power consumption , Demaine, E.D.| Ghodsi, M.| Hajiaghayi, M.| Sayedi-Roshkhar, A.S.| Zadimoghaddam, M. , Journal of Scheduling
・ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs , Cardinal, J.| Demaine, E.D.| Fiorini, S.| Joret, G.| Newman, I.| Weimann, O. , Journal of Combinatorial Optimization
・ Coverage with k-transmitters in the presence of obstacles , Ballinger, B.| Benbernou, N.| Bose, P.| Damian, M.| Demaine, E.D.| Dujmović, V.| Flatland, R.| Hurtado, F.| Iacono, J.| Lubiw, A.| Morin, P.| Sacristán, V.| Souvaine, D.| Uehara, R. , Journal of Combinatorial Optimization
・ Edge-compositions of 3D surfaces , Sung, C.| Demaine, E.D.| Demaine, M.L.| Rus, D. , Journal of Mechanical Design
・ Combining binary search trees , Demaine, E.D.| Iacono, J.| Langerman, S.| Özkan, Ö. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Algorithms for designing pop-up cards , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lubiw, A.| Schulz, A.| Souvainek, D.L.| Viglietta, G.| Winslowk, A. , Leibniz International Proceedings in Informatics, LIPIcs
・ One-dimensional staged self-assembly , Demaine, E.D.| Eisenstat, S.| Ishaque, M.| Winslow, A. , Natural Computing
・ Joining unfoldings of 3-D surfaces , Sung, C.| Demaine, E.D.| Demaine, M.L.| Rus, D. , Proceedings of the ASME Design Engineering Technical Conference
・ Computational complexity and an integer programming model of Shakashaka , Demaine, E.D.| Okamoto, Y.| Uehara, R.| Uno, Y. , CCCG 2013 - 25th Canadian Conference on Computational Geometry
・ Zipper unfolding of domes and prismoids , Demaine, E.D.| Demaine, M.L.| Uehara, R. , CCCG 2013 - 25th Canadian Conference on Computational Geometry
・ Bounded-degree polyhedronization of point sets , Barequet, G.| Benbernou, N.| Charlton, D.| Demaine, E.D.| Demaine, M.L.| Ishaque, M.| Lubiw, A.| Schulz, A.| Souvaine, D.L.| Toussaint, G.T.| Winslow, A. , Computational Geometry: Theory and Applications
・ Variations on instant insanity , Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Morgan, T.D.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Finding a Hamiltonian path in a cube with specified turns is hard , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B. , Journal of Information Processing
・ Reconstructing David Huffman's origami tessellations , Davis, E.| Demaine, E.D.| Demaine, M.L.| Ramseyer, J. , Proceedings of the ASME Design Engineering Technical Conference
・ Folding equilateral plane graphs , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B.| Shapiro-Ellowitz, I. , International Journal of Computational Geometry and Applications
・ Constructing points through folding and intersection , Butler, S.| Demaine, E.| Graham, R.| Tachi, T. , International Journal of Computational Geometry and Applications
・ Learning disjunctions: Near-optimal trade-off between mistakes and "I don't know"s , Demaine, E.D.| Zadimoghaddam, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Refold rigidity of convex polyhedra , Demaine, E.D.| Demaine, M.L.| Itoh, J.-I.| Lubiw, A.| Nara, C.| Oêrourke, J. , Computational Geometry: Theory and Applications
・ PCB origami: A material-based design approach to computer-aided foldable electronic devices , Sterman, Y.| Demaine, E.D.| Oxman, N. , Proceedings of the ASME Design Engineering Technical Conference
・ Six recipes for making polyhedra , Walter, M.| Pedersen, J.| Wenninger, M.| Schattschneider, D.| Loeb, A.L.| Demaine, E.| Demaine, M.| Hart, V. , Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination
・ Blame trees , Demaine, E.D.| Panchekha, P.| Wilson, D.A.| Yang, E.Z. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Covering folded shapes , Aichholzer, O.| Aloupis, G.| Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Hoffmann, M.| Lubiw, A.| Snoeyink, J.| Winslow, A. , CCCG 2013 - 25th Canadian Conference on Computational Geometry
・ Reconfiguration of list edge-colorings in a graph , Ito, T.| Kamiski, M.| Demaine, E.D. , Discrete Applied Mathematics
・ The price of anarchy in network creation games , Demaine, E.D.| Hajiaghayi, M.| Mahini, H.| Zadimoghaddam, M. , ACM Transactions on Algorithms
・ Hinged Dissections Exist , Abbott, T.G.| Abel, Z.| Charlton, D.| Demaine, E.D.| Demaine, M.L.| Kominers, S.D. , Discrete and Computational Geometry
・ On k-convex polygons , Aichholzer, O.| Aurenhammer, F.| Demaine, E.D.| Hurtado, F.| Ramos, P.| Urrutia, J. , Computational Geometry: Theory and Applications
・ NP-completeness of generalized Kaboozle , Asano, T.| Demaine, E.D.| Demaine, M.L.| Uehara, R. , Journal of Information Processing
・ A generalization of the source unfolding of convex polyhedra , Demaine, E.D.| Lubiw, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Constant price of anarchy in network-creation games via public-service advertising , Demaine, E.D.| Zadimoghaddam, M. , Internet Mathematics
・ Any monotone function is realized by interlocked polygons , Demaine, E.D.| Demaine, M.L.| Uehara, R. , Algorithms
・ Meshes preserving minimum feature size , Aloupis, G.| Demaine, E.D.| Demaine, M.L.| Dujmović, V.| Iacono, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Picture-hanging puzzles , Demaine, E.D.| Demaine, M.L.| Minsky, Y.N.| Mitchell, J.S.B.| Rivest, R.L.| Pǎtraşcu, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Origami robots and star trek replicators , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Ghost chimneys , Charlton, D.| Demaine, E.D.| Demaine, M.L.| Dujmovi, V.| Morin, P.| Uehara, R. , International Journal of Computational Geometry and Applications
・ On the complexity of reconfiguration problems , Ito, T.| Demaine, E.D.| Harvey, N.J.A.| Papadimitriou, C.H.| Sideri, M.| Uehara, R.| Uno, Y. , Theoretical Computer Science
・ (Non)Existence of Pleated Folds: How Paper Folds Between Creases , Demaine, E.D.| Demaine, M.L.| Hart, V.| Price, G.N.| Tachi, T. , Graphs and Combinatorics
・ Programmable assembly with universally foldable strings (moteins) , Cheung, K.C.| Demaine, E.D.| Bachrach, J.R.| Griffith, S. , IEEE Transactions on Robotics
・ Contraction decomposition in h-minor-free graphs and algorithmic applications , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Proceedings of the Annual ACM Symposium on Theory of Computing
・ Planning to fold multiple objects from a single self-folding sheet , An, B.| Benbernou, N.| Demaine, E.D.| Rus, D. , Robotica
・ Self-assembly of arbitrary shapes using RNAse enzymes: Meeting the kolmogorov bound with small scale factor , Demaine, E.D.| Patitz, M.J.| Schweller, R.T.| Summers, S.M. , Leibniz International Proceedings in Informatics, LIPIcs
・ The Stackelberg minimum spanning tree game , Cardinal, J.| Demaine, E.D.| Fiorini, S.| Joret, G.| Langerman, S.| Newman, I.| Weimann, O. , Algorithmica (New York)
・ The voronoi game on graphs and its complexity , Teramoto, S.| Demaine, E.D.| Uehara, R. , Journal of Graph Algorithms and Applications
・ One-dimensional staged self-assembly , Demaine, E.D.| Eisenstat, S.| Ishaque, M.| Winslow, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Covering points by disjoint boxes with outliers , Ahn, H.-K.| Bae, S.W.| Demaine, E.D.| Demaine, M.L.| Kim, S.-S.| Korman, M.| Reinbacher, I.| Son, W. , Computational Geometry: Theory and Applications
・ Remarks on separating words , Demaine, E.D.| Eisenstat, S.| Shallit, J.| Wilson, D.A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Common unfoldings of polyominoes and polycubes , Aloupis, G.| Bose, P.K.| Collette, S.| Demaine, E.D.| Demaine, M.L.| Douïeb, K.| Dujmović, V.| Iacono, J.| Langerman, S.| Morin, P. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Algorithms for solving rubik's cubes , Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lubiw, A.| Winslow, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Common developments of several different orthogonal boxes , Abel, Z.| Demaine, E.| Demaine, M.| Matsui, H.| Rote, G.| Uehara, R. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Convexifying polygons without losing visibilities , Aichholzer, O.| Aloupis, G.| Demaine, E.D.| Demaine, M.L.| Dujmović, V.| Hurtado, F.| Lubiw, A.| Rote, G.| Schulz, A.| Souvaine, D.L.| Winslow, A. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Edge-guarding orthogonal polyhedra , Benbernou, N.M.| Demaine, E.D.| Demaine, M.L.| Kurdia, A.| O'Rourke, J.| Toussaint, G.| Urrutia, J.| Viglietta, G. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Efficient constant-velocity reconfiguration of crystalline robots , Aloupis, G.| Collette, S.| Damian, M.| Demaine, E.D.| Flatland, R.| Langerman, S.| O'Rourke, J.| Pinciu, V.| Ramaswami, S.| Sacristán, V.| Wuhrer, S. , Robotica
・ Approximability of the subset sum reconfiguration problem , Ito, T.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ O(1)-approximations for maximum movement problems , Berman, P.| Demaine, E.D.| Zadimoghaddam, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Embedding stacked polytopes on a polynomial-size grid , Demaine, E.D.| Schulz, A. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Continuous Blooming of Convex Polyhedra , Demaine, E.D.| Demaine, M.L.| Hart, V.| Iacono, J.| Langerman, S.| O'Rourke, J. , Graphs and Combinatorics
・ Edge-unfolding orthogonal polyhedra is strongly NP-complete , Abel, Z.| Demaine, E.D. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Algorithmic Folding Complexity , Cardinal, J.| Demaine, E.D.| Demaine, M.L.| Imahori, S.| Ito, T.| Kiyomi, M.| Langerman, S.| Uehara, R.| Uno, T. , Graphs and Combinatorics
・ Making polygons by simple folds and one straight cut , Demaine, E.D.| Demaine, M.L.| Hawksley, A.| Ito, H.| Loh, P.-R.| Manber, S.| Stephens, O. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Lossless fault-tolerant data structures with additive overhead , Christiano, P.| Demaine, E.D.| Kishore, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Flattening fixed-angle chains is strongly NP-hard , Demaine, E.D.| Eisenstat, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A topologically convex vertex-ununfoldable polyhedron , Abel, Z.| Demaine, E.D.| Demaine, M.L. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Expansive motions for d-dimensional open chains , Demaine, E.D.| Eisenstat, S. , Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
・ Folding equilateral plane graphs , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B.| Shapiro-Ellowitz, I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Computing signed permutations of polygons , Aloupis, G.| Bose, P.| Demaine, E.D.| Langerman, S.| Meijer, H.| Overmars, M.| Toussaint, G.T. , International Journal of Computational Geometry and Applications
・ Programmable matter by folding , Hawkes, E.| An, B.| Benbernou, N.M.| Tanaka, H.| Kim, S.| Demaine, E.D.| Rus, D.| Wood, R.J. , Proceedings of the National Academy of Sciences of the United States of America
・ Deploying sensor networks with guaranteed fault tolerance , Bredin, J.L.| Demaine, E.D.| Hajiaghayi, M.T.| Rus, D. , IEEE/ACM Transactions on Networking
・ Minimizing the diameter of a network using shortcut edges , Demaine, E.D.| Zadimoghaddam, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Shape replication through self-assembly and RNase enzymes , Abel, Z.| Benbernou, N.| Damian, M.| Demaine, E.D.| Demaine, M.L.| Flatland, R.| Kominers, S.D.| Schweller, R. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Basic network creation games , Alon, N.| Demaine, E.D.| Hajiaghayi, M.| Leighton, T. , Annual ACM Symposium on Parallelism in Algorithms and Architectures
・ Cache-oblivious dynamic dictionaries with update/query tradeoffs , Brodal, G.S.| Demaine, E.D.| Fineman, J.T.| Iacono, J.| Langerman, S.| Munro, J.I. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Approximation algorithms via contraction decomposition , Demaine, E.D.| Hajiaghayi, M.| Mohar, B. , Combinatorica
・ Decomposition, approximation, and coloring of odd-minor-free graphs , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Zipper unfoldings of polyhedral complexes , Demaine, E.D.| Demaine, M.L.| Lubiw, A.| Shallit, A.| Shallit, J.L. , Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
・ Locked and unlocked chains of planar shapes , Connelly, R.| Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Langerman, S.| Mitchell, J.S.B.| Ribó, A.| Rote, G. , Discrete and Computational Geometry
・ UNO is hard, even for a single player , Demaine, E.D.| Demaine, M.L.| Uehara, R.| Uno, T.| Uno, Y. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Reconfigurable asynchronous logic automata: (RALA) , Gershenfeld, N.| Dalrymple, D.| Chen, K.| Knaian, A.| Green, F.| Demaine, E.D.| Greenwald, S.| Schmidt-Nielsen, P. , Conference Record of the Annual ACM Symposium on Principles of Programming Languages
・ Reconfigurable asynchronous logic automata , Gershenfeld, N.| Dalrymple, D.| Chen, K.| Knaian, A.| Green, F.| Demaine, E.D.| Greenwald, S.| Schmidt-Nielsen, P. , ACM SIGPLAN Notices
・ Open problems from CCCG 2009 , Demaine, E.D.| O'Rourke, J. , Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
・ Confluently persistent tries for efficient version control , Demaine, E.D.| Langerman, S.| Price, E. , Algorithmica (New York)
・ Scheduling to minimize power consumption using submodular functions , Demaine, E.D.| Zadimoghaddam, M. , Annual ACM Symposium on Parallelism in Algorithms and Architectures
・ Matching points with things , Aloupis, G.| Cardinal, J.| Collette, S.| Demaine, E.D.| Demaine, M.L.| Dulieu, M.| Fabila-Monroy, R.| Hart, V.| Hurtado, F.| Langerman, S.| Saumell, M.| Seara, C.| Taslakian, P. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Realistic reconfiguration of crystalline (and telecube) robots , Aloupis, G.| Collette, S.| Damian, M.| Demaine, E.D.| El-Khechen, D.| Flatland, R.| Langerman, S.| O'Rourke, J.| Pinciu, V.| Ramaswami, S.| Sacristán, V.| Wuhrer, S. , Springer Tracts in Advanced Robotics
・ Coverage with k-transmitters in the presence of obstacles , Ballinger, B.| Benbernou, N.| Bose, P.| Damian, M.| Demaine, E.D.| Dujmović, V.| Flatland, R.| Hurtado, F.| Iacono, J.| Lubiw, A.| Morin, P.| Sacristán, V.| Souvaine, D.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Constant price of anarchy in network creation games via public service advertising , Demaine, E.D.| Zadimoghaddam, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Recreational computing , Demaine, E.D. , American Scientist
・ Grid vertex-unfolding orthostacks , Demaine, E.D.| Iacono, J.| Langerman, S. , International Journal of Computational Geometry and Applications
・ Filling holes in triangular meshes using digital images by curve unfolding , Brunton, A.| Wuhrer, S.| Shu, C.| Bose, P.| Demaine, E. , International Journal of Shape Modeling
・ Kaboozle is NP-complete, even in a strip , Asano, T.| Demaine, E.D.| Demaine, M.L.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Any Monotone boolean function can be realized by interlocked polygons , Demaine, E.D.| Demaine, M.L.| Uehara, R. , Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
・ Ghost chimneys , Charlton, D.| Demaine, E.D.| Demaine, M.L.| Dujmović, V.| Morin, P.| Uehara, R. , Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
・ Bounded-degree polyhedronization of point sets , Barequet, G.| Benbernou, N.| Charlton, D.| Demaine, E.D.| Demaine, M.L.| Ishaque, M.| Lubiw, A.| Schulz, A.| Souvaine, D.L.| Toussaint, G.T.| Winslow, A. , Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
・ Open Problems from Dagstuhl Seminar 09511: Parameterized Complexity and Approximation Algorithms , Demaine, E.D.| Hajiaghayi, M.T.| Marx, D. , Dagstuhl Seminar Proceedings
・ Executive Summary for the Dagstuhl Seminar 09511 Parameterized Complexity and Approximation Algorithms , Demaine, E.| HajiAghayi, M.| Marx, D. , Dagstuhl Seminar Proceedings
・ Games, Puzzles, and Computation , Hearn, R.A.| Demaine, E.D. , Games, Puzzles, and Computation
・ An optimal decomposition algorithm for tree edit distance , Demaine, E.D.| Mozes, S.| Rossman, B.| Weimann, O. , ACM Transactions on Algorithms
・ Minimizing movement , Demaine, E.D.| Hajiaghayi, M.| Mahini, H.| Sayedi-Roshkhar, A.S.| Oveisgharan, S.| Zadimoghaddam, M. , ACM Transactions on Algorithms
・ The geometry of binary search trees , Demaine, E.D.| Harmon, D.| Iacono, J.| Kane, D.| Pǎtraşcu, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Playing games with algorithms: Algorithmic combinatorial game theory , Demaine, E.D.| Hearn, R.A. , Games of No Chance 3
・ On cartesian trees and range minimum queries , Demaine, E.D.| Landau, G.M.| Weimann, O. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ The distance geometry of music , Demaine, E.D.| Gomez-Martin, F.| Meijer, H.| Rappaport, D.| Taslakian, P.| Toussaint, G.T.| Winograd, T.| Wood, D.R. , Computational Geometry: Theory and Applications
・ Filling holes in triangular meshes by curve unfolding , Brunton, A.| Wuhrer, S.| Shu, C.| Bose, P.| Demaine, E.D. , 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009
・ Linear reconfiguration of cube-style modular robots , Aloupis, G.| Collette, S.| Damian, M.| Demaine, E.D.| Flatland, R.| Langerman, S.| O'Rourke, J.| Ramaswami, S.| Sacristán, V.| Wuhrer, S. , Computational Geometry: Theory and Applications
・ A distributed boundary detection algorithm for multi-robot systems , McLurkin, J.| Demaine, E.D. , 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2009
・ Node-weighted steiner tree and group steiner tree in planar graphs , Demaine, E.D.| Hajiaghayi, M.| Klein, P.N. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Algorithmica (New York)
・ A pseudopolynomial algorithm for Alexandrov's theorem , Kane, D.| Price, G.N.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Wrapping spheres with flat paper , Demaine, E.D.| Demaine, M.L.| Iacono, J.| Langerman, S. , Computational Geometry: Theory and Applications
・ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs , Borradaile, G.| Demaine, E.D.| Tazari, S. , Leibniz International Proceedings in Informatics, LIPIcs
・ Reconfiguration of list edge-colorings in a graph , Ito, T.| Kamiński, M.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Refolding planar polygons , Iben, H.N.| O'Brien, J.F.| Demaine, E.D. , Discrete and Computational Geometry
・ Approximation algorithms via structural results for apex-minor-free graphs , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Minimizing movement: Fixed-parameter tractability , Demaine, E.D.| Hajiaghayi, M.| Marx, D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ The price of anarchy in cooperative network creation games , Demaine, E.D.| Hajiaghayi, M.| Mahini, H.| Zadimoghaddam, M. , Leibniz International Proceedings in Informatics, LIPIcs
・ Relaxed gabriel graphs , Bose, P.| Cardinal, J.| Collette, S.| Demaine, E.D.| Palop, B.| Taslakian, P.| Zehk, N. , Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009
・ Minimal locked trees , Ballinger, B.| Charlton, D.| Demaine, E.D.| Demaine, M.L.| Iacono, J.| Liu, C.-H.| Poon, S.-H. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Additive approximation algorithms for list-coloring minor-closed class of graphs , Kawarabayashi, K.-I.| Demaine, E.D.| Hajiaghayi, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Generalized D-forms have no spurious creases , Demaine, E.D.| Price, G.N. , Discrete and Computational Geometry
・ The complexity of Dyson telescopes , Demaine, E.D.| Demaine, M.L.| Fleischer, R.| Hearn, R.A.| Oertzen, T.V. , Games of No Chance 3
・ The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs , Cardinal, J.| Demaine, E.D.| Fiorini, S.| Joret, G.| Newman, I.| Weimann, O. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Algorithmic folding complexity , Cardinal, J.| Demaine, E.D.| Demaine, M.L.| Imahori, S.| Langerman, S.| Uehara, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Dynamic ham-sandwich cuts in the plane , Abbott, T.G.| Burr, M.A.| Chan, T.M.| Demaine, E.D.| Demaine, M.L.| Hugg, J.| Kane, D.| Langerman, S.| Nelson, J.| Rafalin, E.| Seyboth, K.| Yeung, V. , Computational Geometry: Theory and Applications
・ Folding a better checkerboard , Demaine, E.D.| Demaine, M.L.| Konjevod, G.| Lang, R.J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A PSEUDOPOLYNOMIAL ALGORITHM FOR ALEXANDROV’S THEOREM , Kane, D.| Price, G.N.| Demaine, E.D. , Dagstuhl Seminar Proceedings
・ Integer point sets minimizing average pairwise ℓ1 distance: What is the optimal shape of a town? , Demaine, E.D.| Fekete, S.P.| Rote, G.| Schweer, N.| Schymura, D.| Zelke, M. , Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009
・ The bidimensionality theory and its algorithmic applications , Demaine, E.D.| Hajiaghayi, M.T. , Computer Journal
・ Staged self-assembly: Nanomanufacture of arbitrary shapes with O(1) glues , Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Ishaque, M.| Rafalin, E.| Schweller, R.T.| Souvaine, D.L. , Natural Computing
・ Linearity of grid minors in treewidth with applications through bidimensionality , Demaine, E.D.| Hajiaghayi, M. , Combinatorica
・ Subquadratic algorithms for 3SUM , Baran, I.| Demaine, E.D.| Pǎtraşcu, M. , Algorithmica (New York)
・ Combination can be hard: Approximability of the unique coverage problem , Demaine, E.D.| Feige, U.| Hajiaghayi, M.| Salavatipour, M.R. , SIAM Journal on Computing
・ Communication-aware processor allocation for supercomputers: Finding point sets of small average distance , Bender, M.A.| Bunde, D.P.| Demaine, E.D.| Fekete, S.P.| Leung, V.J.| Meijer, H.| Phillips, C.A. , Algorithmica (New York)
・ Reconfiguration of cube-style modular robots using o(logn) parallel moves , Aloupis, G.| Collette, S.| Demaine, E.D.| Langerman, S.| Sacristán, V.| Wuhrer, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Constraint logic: A uniform framework for modeling computation as games , Demaine, E.D.| Hearn, R.A. , Proceedings of the Annual IEEE Conference on Computational Complexity
・ Approximability of partitioning graphs with supply and demand , Ito, T.| Demaine, E.D.| Zhou, X.| Nishizeki, T. , Journal of Discrete Algorithms
・ Moving-baseline localization , Park, J.-G.| Demaine, E.D.| Teller, S. , Proceedings - 2008 International Conference on Information Processing in Sensor Networks, IPSN 2008
・ Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics , Alon, N.| Bdoiu, M.| Demaine, E.D.| Farach-Colton, M.| Hajiaghayi, M.| Sidiropoulos, A. , ACM Transactions on Algorithms
・ Ordinal embedding: Approximation algorithms and dimensionality reduction , Bǎdoiu, M.| Demaine, E.D.| Hajiaghayi, M.| Sidiropoulos, A.| Zadimoghaddam, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ On the complexity of reconfiguration problems , Ito, T.| Demaine, E.D.| Harvey, N.J.A.| Papadimitriou, C.H.| Sideri, M.| Uehara, R.| Uno, Y. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Staged self-assembly: Nanomanufacture of arbitrary shapes with O(1) glues , Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Ishaque, M.| Rafalin, E.| Schweller, R.T.| Souvaine, D.L. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Open problems from CCCG 2007 , Demaine, E.D.| O'Rourke, J. , Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG 2008
・ Optimally adaptive integration of univariate lipschitz functions , Baran, I.| Demaine, E.D.| Katz, D.A. , Algorithmica (New York)
・ Edge-unfolding nested polyhedral bands , Aloupis, G.| Demaine, E.D.| Langerman, S.| Morin, P.| O'Rourke, J.| Streinu, I.| Toussaint, G. , Computational Geometry: Theory and Applications
・ Hinged dissections exist , Abbott, T.G.| Abel, Z.| Charlton, D.| Demaine, E.D.| Demaine, M.L.| Kominers, S.D. , Proceedings of the Annual Symposium on Computational Geometry
・ Computational balloon twisting: The theory of balloon polyhedra , Demaine, E.D.| Demaine, M.L.| Hart, V. , Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG 2008
・ Deflating the pentagon , Demaine, E.D.| Demaine, M.L.| Fevens, T.| Mesa, A.| Soss, M.| Souvaine, D.L.| Taslakian, P.| Toussaint, G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Realizing partitions respecting full and partial order information , Demaine, E.D.| Erickson, J.| Kriz̧anc, D.| Meijer, H.| Morin, P.| Overmars, M.| Whitesides, S. , Journal of Discrete Algorithms
・ Confluently persistent tries for efficient version control , Demaine, E.D.| Langerman, S.| Price, E. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Algorithmic graph minors and bidimensionality , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A lifetime of puzzles , Demaine, E.D.| Demaine, M.L.| Rodgers, T. , A Lifetime of Puzzles
・ Geometric folding algorithms: Linkages, origami, polyhedra , Demaine, E.D.| O’rourke, J. , Geometric Folding Algorithms: Linkages, Origami, Polyhedra
・ Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity , Demaine, E.D.| Demaine, M.L. , Graphs and Combinatorics
・ An optimal decomposition algorithm for tree edit distance , Demaine, E.D.| Mozes, S.| Rossman, B.| Weimann, O. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Dynamic optimality - Almost , Demaine, E.D.| Harmon, D.| Iacono, J.| Pǎtraşcu, M. , SIAM Journal on Computing
・ The price of anarchy in network creation games , Demaine, E.D.| Hajiaghayi, M.| Mahini, H.| Zadimoghaddam, M. , Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
・ Approximation algorithms via contraction decomposition , Demaine, E.D.| Hajiaghayi, M.| Mohar, B. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ A unified access bound on comparison-based dynamic dictionaries , Bǎdoiu, M.| Cole, R.| Demaine, E.D.| Iacono, J. , Theoretical Computer Science
・ A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems , Deshpande, A.| Kim, T.| Demaine, E.D.| Sarma, S.E. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Planar embeddings of graphs with specified edge lengths , Cabello, S.| Demaine, E.D.| Rote, G. , Journal of Graph Algorithms and Applications
・ Scheduling to minimize gaps and power consumption , Demaine, E.D.| Ghodsi, M.| Hajiaghayi, M.T.| Sayedi-Roshkhar, A.S.| Zadimoghaddam, M. , Annual ACM Symposium on Parallelism in Algorithms and Architectures
・ An optimal cache-oblivious priority queue and its application to graph algorithms , Arge, L.| Bender, M.A.| Demaine, E.D.| Holland-Minkley, B.| Munro, J.I. , SIAM Journal on Computing
・ Retroactive data structures , Demaine, E.D.| Iacono, J.| Langerman, S. , ACM Transactions on Algorithms
・ Minimizing movement , Demaine, E.D.| Hajiaghayi, M.| Mahini, H.| Sayedi-Roshkhar, A.S.| Oveisgharan, S.| Zadimoghaddam, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ On rolling cube puzzles , Buchin, K.| Buchin, M.| Demaine, E.D.| Demaine, M.L.| El-Khechen, D.| Fekete, Ś.P.| Knauer, C.| Schulz, A.| Taslakian, P. , CCCG 2007 - 19th Canadian Conference on Computational Geometry
・ Geodesic Ham-Sandwich Cuts , Bose, P.| Demaine, E.D.| Hurtado, F.| Iacono, J.| Langerman, S.| Morin, P. , Discrete and Computational Geometry
・ Quickly deciding minor-closed parameters in general graphs , Demaine, E.D.| Hajiaghayi, M. , European Journal of Combinatorics
・ The Stackelberg minimum spanning tree game , Cardinal, J.| Demaine, E.D.| Fiorini, S.| Joret, G.| Langerman, S.| Newman, I.| Weimann, O. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Vertex pops and popturns , Aloupis, G.| Ballinger, B.| Bose, P.| Damian, M.| Demaine, E.D.| Demaine, M.L.| Flatland, R.| Hurtado, F.| Langerman, S.| O'Rourke, J.| Taslakian, P.| Toussaint, G. , CCCG 2007 - 19th Canadian Conference on Computational Geometry
・ Disjoint segments have convex partitions with 2-edge connected dual graphs , Benbernou, N.M.| Demaine, E.D.| Demaine, M.L.| Hoffmann, M.| Ishaque, M.| Souvaine, D.L.| Tóth, C.D. , CCCG 2007 - 19th Canadian Conference on Computational Geometry
・ Plane embeddings of planar graph metrics , Bateni, M.| Demaine, E.D.| Hajiaghayi, M.| Moharrami, M. , Discrete and Computational Geometry
・ Linear reconfiguration of cube-style modular robots , Aloupis, G.| Collette, S.| Damian, M.| Demaine, E.D.| Flatland, R.| Langerman, S.| O'Rourke, J.| Ramaswami, S.| Sacristán, V.| Wuhrer, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Sand drawings and gaussian graphs , Demaine, E.D.| Demaine, M.L.| Taslakian, P.| Toussaint, G.T. , Journal of Mathematics and the Arts
・ Tight bounds for dynamic convex hull queries (again) , Demaine, E.D.| Patrascu, M. , Proceedings of the Annual Symposium on Computational Geometry
・ Revising quorum systems for energy conservation in sensor networks , Tulone, D.| Demaine, E.D. , WASA 2007 - The 2nd International Conference on Wireless Algorithms, Systems and Applications
・ Open Problems from Dagstuhl Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs , Demaine, E.D.| Gutin, G.| Marx, D.| Stege, U. , Dagstuhl Seminar Proceedings
・ Correlation clustering in general weighted graphs , Demaine, E.D.| Emanuel, D.| Fiat, A.| Immorlica, N. , Theoretical Computer Science
・ Logarithmic lower bounds in the cell-probe model , Pǎtraşcu, M.| Demaine, E.D. , SIAM Journal on Computing
・ Online searching with turn cost , Demaine, E.D.| Fekete, S.P.| Gal, S. , Theoretical Computer Science
・ Cache-oblivious B-trees , Bender, M.A.| Demaine, E.D.| Farach-Colton, M. , SIAM Journal on Computing
・ Combination can be hard: Approximability of the unique coverage problem , Demaine, E.D.| Feige, U.| Hajiaghayi, M.T.| Salavatipour, M.R. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management , Leong, B.| Liskov, B.| Demaine, E.D. , Computer Communications
・ Necklaces, convolutions, and X + Y , Bremner, D.| Chan, T.M.| Demaine, E.D.| Erickson, J.| Hurtado, F.| Iacono, J.| Langerman, S.| Taslakian, P. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ The bidimensional theory of bounded-genus graphs , Demaine, E.D.| Hajiaghayi, M.| Thilikos, D.M. , SIAM Journal on Discrete Mathematics
・ Voronoi game on graphs and its complexity , Teramoto, S.| Demaine, E.D.| Uehara, R. , Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games, CIG'06
・ De dictionariis dynamicis pauco spatio utentibus (lat. On dynamic dictionaries using little space) , Demaine, E.D.| Auf Der Heide, F.M.| Pagh, R.| Pǎtraşcu, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Data structures for halfplane proximity queries and incremental Voronoi diagrams , Aronov, B.| Bose, P.| Demaine, E.D.| Gudmundsson, J.| Iacono, J.| Langerman, S.| Smid, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Morpion solitaire , Demaine, E.D.| Demaine, M.L.| Langerman, A.| Langerman, S. , Theory of Computing Systems
・ Open problems from CCCG 2005 , Demaine, E.D.| O’Rourke, J. , Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006
・ Lower bounds for asymmetric communication channels and distributed source coding , Adler, M.| Demaine, E.D.| Harvey, N.J.A.| Pǎtraşcu, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Refolding planar polygons , Iben, H.N.| O'Brien, J.F.| Demaine, E.D. , Proceedings of the Annual Symposium on Computational Geometry
・ Puzzles, art, and magic with algorithms , Demaine, E.D.| Demaine, M.L. , Theory of Computing Systems
・ Locked and unlocked chains of planar shapes , Connelly, R.| Demaine, E.D.| Demaine, M.L.| Fekete, S.P.| Langerman, S.| Mitchell, J.S.B.| Ribó, A.| Rote, G. , Proceedings of the Annual Symposium on Computational Geometry
・ Low-dimensional embedding with extra information , Badoiu, M.| Demaine, E.D.| Hajiaghayi, M.| Indyk, P. , Discrete and Computational Geometry
・ Geometric restrictions on producible polygonal protein chains , Demaine, E.D.| Langerman, S.| O'Rourke, J. , Algorithmica (New York)
・ Approximability of partitioning graphs with supply and demand , Ito, T.| Demaine, E.D.| Zhou, X.| Nishizeki, T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Curves in the sand: Algorithmic drawing , Damian, M.| Demaine, E.D.| Demaine, M.L.| Dujmović, V.| El-Khechen, D.| Flatland, R.| Iacono, J.| Langerman, S.| Meijer, H.| Ramaswami, S.| Souvaine, D.L.| Taslakian, P.| Toussaint, G.T. , Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006
・ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Origami, linkages, and polyhedra: Folding with algorithms , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Polygons flip finitely: Flaws and a fix , Demaine, E.D.| Gassend, B.| O’Rourke, J.| Toussaint, G.T. , Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006
・ The Helium Stockpile: A collaboration in mathematical folding sculpture , Demaine, E.D.| Demaine, M.L.| Palmer, A.L. , Leonardo
・ Plane embeddings of planar graph metrics , Bateni, M.| Demaine, E.D.| Hajiaghayi, M.| Moharrami, M. , Proceedings of the Annual Symposium on Computational Geometry
・ Optimally adaptive integration of univariate lipschitz functions , Baran, I.| Demaine, E.D.| Katz, D.A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , Demaine, E.D.| Fomin, F.V.| Hajiaghayi, M.| Thilikos, D.M. , Journal of the ACM
・ PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , Hearn, R.A.| Demaine, E.D. , Theoretical Computer Science
・ Mobile-assisted localization in wireless sensor networks , Priyantha, N.B.| Balakrishnan, H.| Demaine, E.D.| Teller, S. , Proceedings - IEEE INFOCOM
・ Representing trees of higher degree , Benoit, D.| Demaine, E.D.| Munro, J.I.| Raman, R.| Raman, V.| Rao, S.S. , Algorithmica (New York)
・ Algorithmic graph minor theory: Decomposition, approximation, and coloring , Demaine, E.D.| Hajiaghayi, M.| Kawarabayashi, K.-I. , Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
・ Deploying sensor networks with guaranteed capacity and fault tolerance , Bredin, J.L.| Demaine, E.D.| Hajiaghayi, M.| Rus, D. , Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
・ Bidimensionality: New connections between FPT algorithms and PTASs , Demaine, E.D.| Hajiaghayi, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Output-sensitive algorithms for computing nearest-neighbour decision boundaries , Bremner, D.| Demaine, E.| Erickson, J.| Iacono, J.| Langerman, S.| Morin, P.| Toussaint, G. , Discrete and Computational Geometry
・ Fixed-Parameter Algorithms for (k, r)-Center in Planar Graphs and Map Graphs , Demaine, E.D.| Hajiaghayi, M.| Fomin, F.V.| Thilikos, D.M.| Thilikos, D.M. , ACM Transactions on Algorithms
・ Optimal covering tours with turn costs , Arkin, E.M.| Bender, M.A.| Demaine, E.D.| Fekete, S.P.| Mitchell, J.S.B.| Sethia, S. , SIAM Journal on Computing
・ Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , Demaine, E.D.| Hajiaghayi, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Hinged dissection of polyominoes and polyforms , Demaine, E.D.| Demaine, M.L.| Eppstein, D.| Frederickson, G.N.| Friedman, E. , Computational Geometry: Theory and Applications
・ Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors , Demaine, E.D.| Hajiaghayi, M.| Thilikos, D.M. , Algorithmica (New York)
・ Subquadratic algorithms for 3SUM , Baran, I.| Demaine, E.D.| Pǎtraşcu, M. , Lecture Notes in Computer Science
・ Hinged dissection of polypolyhedra , Demaine, E.D.| Demaine, M.L.| Lindy, J.F.| Souvaine, D.L. , Lecture Notes in Computer Science
・ Fast allocation and deallocation with an improved buddy system , Brodal, G.S.| Demaine, E.D.| Munro, J.I. , Acta Informatica
・ Separating point sets in polygonal environments , Demaine, E.D.| Erickson, J.| Hurtado, F.| Iacono, J.| Langerman, S.| Meijer, H.| Overmars, M.| Whitesides, S. , International Journal of Computational Geometry and Applications
・ Games on triangulations , Aichholzer, O.| Bremner, D.| Demaine, E.D.| Hurtado, F.| Kranakis, E.| Krasser, H.| Ramaswami, S.| Sethia, S.| Urrutia, J. , Theoretical Computer Science
・ Optimizing a 2D function satisfying unimodality properties , Demaine, E.D.| Langerman, S. , Lecture Notes in Computer Science
・ Communication - A ware processor allocation for supercomputers , Bender, M.A.| Bunde, D.P.| Demaine, E.D.| Fekete, S.P.| Leung, V.J.| Meijer, H.| Phillips, C.A. , Lecture Notes in Computer Science
・ PersiFS: A versioned file system with an efficient representation , Ports, D.R.K.| Clements, A.T.| Demaine, E.D. , Proceedings of the 20th ACM Symposium on Operating Systems Principles, SOSP 2005
・ Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve , Baran, I.| Demaine, E.D. , International Journal of Computational Geometry and Applications
・ Kinematics and dynamics of Nanostructured Origami™ , Stellman, P.| Takahashi, S.| Demaine, E.D.| Arora, W.| Barbastathis, G. , American Society of Mechanical Engineers, Design Engineering Division (Publication) DE
・ Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics , Alon, N.| Bǎdoiu, M.| Demaine, E.D.| Farach-Colton, M.| Hajiaghayi, M.| Sidiropoulos, A. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ The distance geometry of deep rhythms and scales , Demaine, E.D.| Gomez-Martin, F.| Meijer, H.| Rappaport, D.| Taslakian, P.| Toussaint, G.T.| Winograd, T.| Wood, D.R. , Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005
・ Grid vertex-unfolding orthostacks , Demaine, E.D.| Iacono, J.| Langerman, S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Dynamic ham-sandwich cuts of convex polygons in the plane , Abbott, T.| Demaine, E.D.| Demaine, M.L.| Kane, D.| Langerman, S.| Nelson, J.| Yeung, V. , Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005
・ Puzzles, art, and magic with algorithms , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Bidimensional parameters and local treewidth , Demaine, E.D.| Fomin, F.V.| Hajiaghayi, M.| Thilikos, D.M. , SIAM Journal on Discrete Mathematics
・ Tight bounds on maximal and maximum matchings , Biedl, T.| Demaine, E.D.| Duncan, C.A.| Fleischer, R.| Kobourov, S.G. , Discrete Mathematics
・ When can you fold a map? , Arkin, E.M.| Bender, M.A.| Demaine, E.D.| Demaine, M.L.| Mitchell, J.S.B.| Sethia, S.| Skiena, S.S. , Computational Geometry: Theory and Applications
・ Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications , Demaine, E.D.| Hajiaghayi, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Tetris is hard, even to approximate , Breukelaar, R.| Demaine, E.D.| Hohenberger, S.| Hoogeboom, H.J.| Kosters, W.A.| Liben-Nowell, D. , International Journal of Computational Geometry and Applications
・ Tight Bounds for the Partial-Sums Problem , Pǎtraşcu, M.| Demaine, E.D. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Epichord: Parallelizing the chord lookup algorithm with reactive routing state management , Leong, B.| Liskov, B.| Demaine, E.D. , Proceedings - IEEE International Conference on Networks, ICON
・ Approximation algorithms for classes of graphs excluding single-crossing graphs as minors , Demaine, E.D.| Hajiaghayi, M.| Nishimura, N.| Ragde, P.| Thilikos, D.M. , Journal of Computer and System Sciences
・ Diameter and treewidth in minor-closed graph families, revisited , Demaine, E.D.| Hajiaghayi, M.T. , Algorithmica (New York)
・ Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth , Demaine, E.D.| Hajiaghayi, M.T. , Lecture Notes in Computer Science
・ An energy-driven approach to linkage unfolding , Cantarella, J.H.| Demaine, E.D.| Iben, H.N.| O'Brien, J.F. , Proceedings of the Annual Symposium on Computational Geometry
・ What is the optimal shape of a city? , Bender, C.M.| Bender, M.A.| Demaine, E.D.| Fekete, S.P. , Journal of Physics A: Mathematical and General
・ Lower bounds for dynamic connectivity , Pǎtraşcu, M.| Demaine, E.D. , Conference Proceedings of the Annual ACM Symposium on Theory of Computing
・ Finding frequent items in sliding windows with multinomially-distributed item frequenciesß , Golab, L.| DeHaan, D.| López-Ortiz, A.| Demaine, E.D. , Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM
・ Low-dimensional embedding with extra information , Bǎdoiu, M.| Demaine, E.D.| Hajiaghayi, M.T.| Indyk, P. , Proceedings of the Annual Symposium on Computational Geometry
・ Fun-Sort-or the chaos of unordered binary search , Biedl, T.| Chan, T.| Demaine, E.D.| Fleischer, R.| Golin, M.| King, J.A.| Munro, J.I. , Discrete Applied Mathematics
・ Solitaire Clobber , Demaine, E.D.| Demaine, M.L.| Fleischer, R. , Theoretical Computer Science
・ Geodesic ham-sandwich cuts , Bose, P.| Demaine, E.D.| Hurtado, F.| Iacono, J.| Langerman, S.| Morin, P. , Proceedings of the Annual Symposium on Computational Geometry
・ Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs , Demaine, E.D.| Fomin, F.V.| Hajiaghayi, M.| Thilikos, D.M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Interpolation Search for Non-Independent Data , Demaine, E.D.| Jones, T.| Pǎtraşcu, M. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Dynamic optimality - Almost , Demaine, E.D.| Harmon, D.| Iacono, J.| Pǎtraşcu, M. , Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
・ The bidimensional theory of bounded-genus graphs , Demaine, E.D.| Hajiaghayi, M.| Thilikos, D.M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Retroactive Data Structures , Demaine, E.D.| Iacono, J.| Langerman, S. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Finding hidden independent sets in interval graphs , Biedl, T.| Brejová, B.| Demaine, E.D.| Hamel, A.M.| López-Ortiz, A.| Vinař, T. , Theoretical Computer Science
・ Proximate point searching , Demaine, E.D.| Iacono, J.| Langerman, S. , Computational Geometry: Theory and Applications
・ Bidimensioiial parameters and local treewidth , Domaine, E.D.| Fomin, F.V.| Hajiaghayi, M.T.| Thilikos, D.M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Planar Embeddings of Graphs with Specified Edge Lengths , Cabello, S.| Demaine, E.D.| Rote, G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Separating point sets in polygonal environments , Demaine, E.D.| Erickson, J.| Hurtado, F.| Iacono, J.| Langerman, S.| Meijer, H.| Overmars, M.| Whitesides, S. , Proceedings of the Annual Symposium on Computational Geometry
・ Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve , Baran, I.| Demaine, E.D. , Proceedings of the Annual Symposium on Computational Geometry
・ A simplified and dynamic unified structure , Bǎdoiu, M.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Refolding planar polygons , Iben, H.N.| O'Brien, J.F.| Demaine, E.D. , ACM SIGGRAPH 2004 Sketches, SIGGRAPH'04
・ Poster abstract: Anchor-free distributed localization in sensor networks , Priyantha, N.B.| Balakrishnan, H.| Demaine, E.| Teller, S. , SenSys'03: Proceedings of the First International Conference on Embedded Networked Sensor Systems
・ Identifying frequent items in sliding windows over on-line packet streams , Golab, L.| DeHaan, D.| Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC
・ Straightening Polygonal Arcs and Convexifying Polygonal Cycles , Connelly, R.| Demaine, E.D.| Rote, G. , Discrete and Computational Geometry
・ Correlation clustering with partial information , Demaine, E.D.| Immorlica, N. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ K-ary clustering with optimal leaf ordering for gene expression data , Bar-Joseph, Z.| Demaine, E.D.| Gifford, D.K.| Srebro, N.| Hamel, A.M.| Jaakkola, T.S. , Bioinformatics
・ Tetris is hard, even to approximate , Demaine, E.D.| Hohenberger, S.| Liben-Nowell, D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Ununfoldable polyhedra with convex faces , Bern, M.| Demaine, E.D.| Eppstein, D.| Kuo, E.| Mantler, A.| Snoeyink, J. , Computational Geometry: Theory and Applications
・ A linear lower bound on index size for text retrieval , Demaine, E.D.| López-Ortiz, A. , Journal of Algorithms
・ Pushing blocks is hard , Demaine, E.D.| Demaine, M.L.| Hoffmann, M.| O'Rourke, J. , Computational Geometry: Theory and Applications
・ Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs , Demaine, E.D.| Fomin, F.V.| Hajiaghayi, M.T.| Thilikos, D.M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Long proteins with unique optimal foldings in the H-P model , Aichholzer, O.| Bremner, D.| Demaine, E.D.| Meijer, H.| Sacristán, V.| Soss, M. , Computational Geometry: Theory and Applications
・ VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS , Demaine, E.D.| Eppstein, D.| Erickson, J.| Hart, G.W.| O'Rourke, J. , Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday
・ Palindrome recognition using a multidimensional tape , Biedl, T.| Buss, J.F.| Demaine, E.D.| Demaine, M.L.| Hajiaghayi, M.| Vinař, T. , Theoretical Computer Science
・ Output-sensitive algorithms for computing nearest-neighbour decision boundaries , Bremner, D.| Demaine, E.| Erickson, J.| Iacono, J.| Langerman, S.| Morin, P.| Toussaint, G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Interlocked open and closed linkages with few joints , Demaine, E.D.| Langerman, S.| O'Rourke, J.| Snoeyink, J. , Computational Geometry: Theory and Applications
・ On universally easy classes for NP-complete problems , Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Theoretical Computer Science
・ Optimal dynamic video-on-demand using adaptive broadcasting , Biedl, T.| Demaine, E.D.| Golynski, A.| Horton, J.D.| López-Ortiz, A.| Poirier, G.| Quimper, C.-G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Geometric restrictions on producible polygonal protein chains , Demaine, E.D.| Langerman, S.| O'Rourke, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Finding hidden independent sets in interval graphs , Biedl, T.| Brejová, B.| Demaine, E.D.| Hamel, A.M.| López-Ortiz, A.| Vinař, T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Playing with Triangulations , Aichholzer, O.| Bremner, D.| Demaine, E.D.| Hurtado, F.| Kranakis, E.| Krasser, H.| Ramaswami, S.| Sethia, S.| Urrutia, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Solitaire Clobber , Demaine, E.D.| Demaine, M.L.| Fleischer, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Frequency estimation of internet packet streams with limited space , Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Two simplified algorithms for maintaining order in a list , Bender, M.A.| Cole, R.| Demaine, E.D.| Farach-Colton, M.| Zito, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Cache-oblivious priority queue and graph algorithm applications , Arge, L.| Bender, M.A.| Demaine, E.D.| Holland-Minkley, B.| Munro, J.I. , Conference Proceedings of the Annual ACM Symposium on Theory of Computing
・ Recent results in computational origami , Demaine, E.D.| Demaine, M.L. , Origami
・ Online routing in convex subdivisions , Bose, P.| Brodnik, A.| Carlsson, S.| Demaine, E.D.| Fleischer, R.| López-Ortiz, A.| Morin, P.| Munro, J.I. , International Journal of Computational Geometry and Applications
・ Scanning and traversing: Maintaining data for traversals in a memory hierarchy , Bender, M.A.| Cole, R.| Demaine, E.D.| Farach-Colton, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A note on reconfiguring tree linkages: Trees can lock , Biedl, T.| Demaine, E.| Demaine, M.| Lazard, S.| Lubiw, A.| O'Rourke, J.| Robbins, S.| Streinu, I.| Toussaint, G.| Whitesides, S. , Discrete Applied Mathematics
・ Efficient tree layout in a multilevel memory hierarchy , Bender, M.A.| Demaine, E.D.| Farach-Colton, M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ The nondeterministic constraint logic model of computation: Reductions and applications , Hearn, R.A.| Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Exponential speedup of fixed-parameter algorithms on K33-minor-free or K5-minor-free graphs , Demaine, E.D.| Hajiaghayi, M.T.| Thilikos, D.M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Flipturning polygons , Aichholzer, O.| Cortés, C.| Demaine, E.D.| Dujmović, V.| Erickson, J.| Meijer, H.| Overmars, M.| Palop, B.| Ramaswami, S.| Toussaint, G.T. , Discrete and Computational Geometry
・ 1.5-approximation for treewidth of graphs excluding a graph with one crossing as a minor , Demaine, E.D.| Hajiaghayi, M.T.| Thilikos, D.M. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Enumerating foldings and unfoldings between polygons and polytopes , Demaine, E.D.| Demaine, M.L.| Lubiw, A.| O'Rourke, J. , Graphs and Combinatorics
・ Flat-state connectivity of linkages under dihedral motions , Aloupis, G.| Demaine, E.D.| Dujmović, V.| Erickson, J.| Langerman, S.| Meijer, H.| O'Rourke, J.| Overmars, M.| Soss, M.| Streinu, I.| Toussaint, G.T. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ A disk-packing algorithm for an origami magic trick , Bern, M.| Demaine, E.| Eppstein, D.| Hayes, B. , Origami
・ Balanced k-colorings , Biedl, T.C.| Čenek, E.| Chan, T.M.| Demaine, E.D.| Demaine, M.L.| Fleischer, R.| Wang, M.-W. , Discrete Mathematics
・ Vertex-unfoldings of simplicial manifolds , Demaine, E.D.| Eppstein, D.| Erickson, J.| Hart, G.W.| O'Rourke, J. , Proceedings of the Annual Symposium on Computational Geometry
・ K-ary clustering with optimal leaf ordering for gene expression data , Bar-Joseph, Z.| Demaine, E.D.| Gifford, D.K.| Hamel, A.M.| Jaakkola, T.S.| Srebro, N. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Interlocked open linkages with few joints , Demaine, E.D.| Langerman, S.| O'Rourke, J.| Snoeyink, J. , Proceedings of the Annual Symposium on Computational Geometry
・ Robot localization without depth perception , Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Playing games with algorithms: Algorithmic combinatorial game theory , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Efficient Algorithms for Petersen's Matching Theorem , Biedl, T.C.| Bose, P.| Demaine, E.D.| Lubiw, A. , Journal of Algorithms
・ Experiments on adaptive set intersections for text retrieval systems , Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Optimal covering tours with turn costs , Arkin, E.M.| Bender, M.A.| Demaine, E.D.| Fekete, S.P.| Mitchell, J.S.B.| Sethia, S. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Locked and unlocked polygonal chains in three dimensions , Biedl, T.| Demaine, E.| Demaine, M.| Lazard, S.| Lubiw, A.| O'Rourke, J.| Overmars, M.| Robbins, S.| Streinu, I.| Toussaint, G.| Whitesides, S. , Discrete and Computational Geometry
・ Polygons cuttable by a circular saw , Demaine, E.D.| Demaine, M.L.| Kaplan, C.S. , Computational Geometry: Theory and Applications
・ Folding and unfolding linkages, paper, and polyhedra , Demaine, E.D. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Reconfiguring convex polygons , Aichholzer, O.| Demaine, E.D.| Erickson, J.| Hurtado, F.| Overmars, M.| Soss, M.| Toussaint, G.T. , Computational Geometry: Theory and Applications
・ Generalized communicators in the message passing interface , Demaine, E.D.| Foster, I.| Kesselman, C.| Snir, M. , IEEE Transactions on Parallel and Distributed Systems
・ A linear lower bound on index size for text retrieval , Demaine, E.D.| López-Ortiz, A. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ When can you fold a map? , Arkin, E.M.| Bender, M.A.| Demaine, E.D.| Demaine, M.L.| Mitchell, J.S.| Sethia, S.| Skiena, S.S. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Tight bounds on maximal and maximum matchings , Biedl, T.| Demaine, E.D.| Duncan, C.A.| Fleischer, R.| Kobourov, S.G. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ On universally easy classes for NP-complete problems , Demaine, E.D.| López-Ortiz, A.| Munro, J.I. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Adaptive set intersections, unions, and differences , Demaine, Erik D.| Lopez-Ortiz, Alejandro| Munro, J.Ian , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Cache-oblivious B-trees , Bender, M.A.| Demaine, E.D.| Farach-Colton, M. , Annual Symposium on Foundations of Computer Science - Proceedings
・ Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami , Demaine, E.D.| Demaine, M.L.| Mitchell, J.S.B. , Computational Geometry: Theory and Applications
・ Straightening polygonal arcs and convexifying polygonal cycles , Connelly, R.| Demaine, E.D.| Rote, G. , Annual Symposium on Foundations of Computer Science - Proceedings
・ Online routing in convex subdivisions , Bose, P.| Brodnik, A.| Carlsson, S.| Demaine, E.D.| Fleischer, R.| López-Ortiz, A.| Morin, P.| Ian Munro, J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Folding and cutting paper , Demaine, E.D.| Demaine, M.L.| Lubiw, A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Balanced k-colorings , Biedl, T.C.| Čenek, E.| Chan, T.M.| Demaine, E.D.| Demaine, M.L.| Fleischer, R.| Wang, M.-W. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Computational geometry column 37 , Demaine, E.D.| O'Rourke, J. , International Journal of Computational Geometry and Applications
・ Resizable arrays in optimal time and space , Brodnik, A.| Carlsson, S.| Demaine, E.D.| Munro, J.I.| Sedgewick, R. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Locked and unlocked polygonal chains in 3D , Biedl, T.| Demaine, E.| Demaine, M.| Lazard, S.| Lubiw, A.| O'Rourke, J.| Overmars, M.| Robbins, S.| Streinu, I.| Toussaint, G.| Whitesides, S. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami , Demaine, Erik D.| Demaine, Martin L.| Mitchell, Joseph S.B. , Proceedings of the Annual Symposium on Computational Geometry
・ Representing trees of higher degree , Benoit, D.| Demaine, E.D.| Munro, J.I.| Raman, V. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Folding and one straight cut suffice , Demaine, Erik D.| Demaine, Martin L.| Lubiw, Anna , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Efficient algorithms for Petersen's matching theorem , Biedl, Therese C.| Bose, Prosenjit| Demaine, Erik D.| Lubiw, Anna , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
・ Metamorphosis of the cube , Demaine, Erik| Demaine, Martin| Lubiw, Anna| O'Rourke, Joseph| Pashchenko, Irena , Proceedings of the Annual Symposium on Computational Geometry
・ Convexifying monotone polygons , Biedl, T.C.| Demaine, E.D.| Lazard, S.| Robbins, S.M.| Soss, M.A. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Fast allocation and deallocation with an improved buddy system , Demaine, E.D.| Munro, I.J. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Planar drawings of origami polyhedra , Demaine, E.D.| Demaine, M.L. , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
・ Protocols for non-deterministic communication over synchronous channels , Demaine, Erik D. , Proceedings of the International Parallel Processing Symposium, IPPS
・ C to Java: Converting pointers into references , Demaine, E.D. , Concurrency Practice and Experience
・ Protocols for non-deterministic communication over synchronous channels , Demaine, E.D. , Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998
・ Routing algorithms on static interconnection networks: A classification scheme , Demaine, E.| Srinivas, S. , Computer Systems Science and Engineering
・ A novel routing algorithm for k-ary n-cube interconnection networks , Demaine, E.D.| Srinivas, S. , International Journal of High Speed Computing