Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik D. Demaine
Person information
- affiliation: MIT, Cambridge, US
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j201]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
:
Developing a tetramonohedron with minimum cut length. Comput. Geom. 108: 101903 (2023)- [j200]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are still hard. Comput. Geom. 110: 101949 (2023) - [j199]Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang:
Any platonic solid can transform to another by O(1) refoldings. Comput. Geom. 113: 101995 (2023) - [i186]Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
This Game Is Not Going To Analyze Itself. CoRR abs/2302.01145 (2023) - [i185]Josh Brunner, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Timothy Gomez, Jayson Lynch:
Complexity of Solo Chess with Unlimited Moves. CoRR abs/2302.01405 (2023) - [i184]Robert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Ryan Knobel, Timothy Gomez, Elise Grizzell, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie:
Complexity of Reconfiguration in Surface Chemical Reaction Networks. CoRR abs/2303.15556 (2023) - [i183]Erik D. Demaine, Martin L. Demaine:
Every Author as First Author. CoRR abs/2304.01393 (2023) - 2022
- [j198]Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara:
Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. 103: 101857 (2022) - [j197]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. ACM J. Exp. Algorithmics 27: 2.4:1-2.4:12 (2022) - [c331]Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG 2022: 9-23 - [c330]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104 - [c329]Sagnik Saha, Erik D. Demaine:
ZHED is NP-complete. CCCG 2022: 277-283 - [c328]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo:
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. SoCG 2022: 29:1-29:17 - [c327]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. ESA 2022: 3:1-3:15 - [c326]Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. FUN 2022: 3:1-3:30 - [c325]Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Rolling Polyhedra on Tessellations. FUN 2022: 6:1-6:16 - [c324]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Lower Bounds on Retroactive Data Structures. ISAAC 2022: 32:1-32:12 - [c323]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. MCU 2022: 91-108 - [c322]Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms:
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. SWAT 2022: 4:1-4:19 - [c321]Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM 2022: 47-58 - [c320]Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM 2022: 187-198 - [i182]Erik D. Demaine, Kritkorn Karntikoon:
Unfolding Orthotubes with a Dual Hamiltonian Path. CoRR abs/2201.12452 (2022) - [i181]Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara:
Orthogonal Fold & Cut. CoRR abs/2202.01293 (2022) - [i180]Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt:
The Legend of Zelda: The Complexity of Mechanics. CoRR abs/2203.17167 (2022) - [i179]Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. CoRR abs/2204.00600 (2022) - [i178]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo:
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without Flat Angles. CoRR abs/2204.03696 (2022) - [i177]Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - [i176]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. CoRR abs/2207.07229 (2022) - [i175]Lily Chung, Erik D. Demaine:
Celeste is PSPACE-hard. CoRR abs/2211.11839 (2022) - [i174]Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Lower Bounds on Retroactive Data Structures. CoRR abs/2211.14664 (2022) - [i173]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR abs/2212.12450 (2022) - 2021
- [j196]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021) - [j195]Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane:
Approximating the Canadian Traveller Problem with Online Randomization. Algorithmica 83(5): 1524-1543 (2021) - [j194]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021) - [j193]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara:
Continuous flattening of all polyhedral manifolds using countably infinite creases. Comput. Geom. 98: 101773 (2021) - [j192]Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen:
Snipperclips: Cutting tools into desired polygons using themselves. Comput. Geom. 98: 101784 (2021) - [j191]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. Theory Comput. Syst. 65(3): 541-558 (2021) - [j190]Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
On the effects of hierarchical self-assembly for reducing program-size complexity. Theor. Comput. Sci. 894: 50-78 (2021) - [c319]Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff:
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI 2021: 5277-5285 - [c318]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CCCG 2021: 97-106 - [c317]Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt:
Folding Points to a Point and Lines to a Line. CCCG 2021: 271-278 - [c316]Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang:
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CCCG 2021: 332-342 - [c315]Vincent Bian, Erik D. Demaine, Rachana Madhukara:
Edge-Unfolding Prismatoids: Tall or Rectangular Base. CCCG 2021: 343-347 - [c314]Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán:
Characterizing Universal Reconfigurability of Modular Pivoting Robots. SoCG 2021: 10:1-10:20 - [c313]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari Is NP-Complete. FUN 2021: 1:1-1:24 - [c312]Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. FUN 2021: 3:1-3:23 - [c311]Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff:
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. FUN 2021: 7:1-7:14 - [c310]Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel:
Multidimensional Scaling: Approximation and Complexity. ICML 2021: 2568-2578 - [c309]Erik D. Demaine, Jayson Lynch, Jiaying Sun:
An Efficient Reversible Algorithm for Linear Regression. ICRC 2021: 103-108 - [i172]Erik D. Demaine, Yevhenii Diomidov:
Strings-and-Coins and Nimstring are PSPACE-complete. CoRR abs/2101.06361 (2021) - [i171]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. CoRR abs/2103.06707 (2021) - [i170]Zachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen:
Snipperclips: Cutting Tools into Desired Polygons using Themselves. CoRR abs/2105.08305 (2021) - [i169]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara:
Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases. CoRR abs/2105.10774 (2021) - [i168]Vincent Bian, Erik D. Demaine, Rachana Madhukara:
Edge-Unfolding Prismatoids: Tall or Rectangular Base. CoRR abs/2106.14262 (2021) - [i167]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CoRR abs/2106.15585 (2021) - [i166]Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang:
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CoRR abs/2109.03997 (2021) - [i165]Erik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John C. Urschel:
Multidimensional Scaling: Approximation and Complexity. CoRR abs/2109.11505 (2021) - [i164]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are Still Hard. CoRR abs/2110.00058 (2021) - [i163]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. CoRR abs/2111.07304 (2021) - [i162]Sagnik Saha, Erik D. Demaine:
ZHED is NP-complete. CoRR abs/2112.07914 (2021) - 2020
- [j189]Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson:
Existence and Hardness of Conveyor Belts. Electron. J. Comb. 27(4): 4 (2020) - [j188]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal hinge patterns for folding strips efficiently into any grid polyhedron. Comput. Geom. 89: 101633 (2020) - [j187]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90: 101648 (2020) - [j186]Jin Akiyama, Erik D. Demaine, Stefan Langerman:
Polyhedral Characterization of Reversible Hinged Dissections. Graphs Comb. 36(2): 221-229 (2020) - [j185]Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku:
Infinite All-Layers Simple Foldability. Graphs Comb. 36(2): 231-244 (2020) - [j184]Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky:
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. Graphs Comb. 36(2): 251-267 (2020) - [j183]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao:
Cookie Clicker. Graphs Comb. 36(2): 269-302 (2020) - [j182]Erik D. Demaine, Martin L. Demaine:
Adventures in Maze Folding Art. J. Inf. Process. 28: 745-749 (2020) - [j181]Erik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura:
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. 28: 825-833 (2020) - [j180]Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl:
PSPACE-completeness of Pulling Blocks to Reach a Goal. J. Inf. Process. 28: 929-941 (2020) - [j179]Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal:
Tetris is NP-hard even with O(1) Rows or Columns. J. Inf. Process. 28: 942-958 (2020) - [j178]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. J. Inf. Process. 28: 987-1007 (2020) - [j177]Hugo Alves Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid foldability is NP-hard. J. Comput. Geom. 11(1): 93-124 (2020) - [j176]Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. 806: 332-343 (2020) - [j175]Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. 839: 41-102 (2020) - [c308]Erik D. Demaine:
Tribute to Godfried Toussaint. CCCG 2020: 1 - [c307]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CCCG 2020: 63-72 - [c306]Kingston Yao Czajkowski, Erik D. Demaine, Martin L. Demaine, Kim Eppling, Robby Kraft, Klara Mundilova, Levi Smith:
Folding Small Polyominoes into a Unit Cube. CCCG 2020: 95-100 - [c305]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge Zipper Unfolding. CCCG 2020: 101-105 - [c304]Erik D. Demaine, Martin L. Demaine, David Eppstein:
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG 2020: 106-113 - [c303]Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth:
2048 Without Merging. CCCG 2020: 285-291 - [c302]Erik D. Demaine, Adam Hesterberg, Jason S. Ku:
Finding Closed Quasigeodesics on Convex Polyhedra. SoCG 2020: 33:1-33:13 - [c301]Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. ITCS 2020: 62:1-62:42 - [c300]Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. ISAAC 2020: 12:1-12:15 - [c299]Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ISAAC 2020: 17:1-17:14 - [c298]Erik D. Demaine, Justin Kopinsky, Jayson Lynch:
Recursed Is Not Recursive: A Jarring Result. ISAAC 2020: 50:1-50:15 - [i161]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. CoRR abs/2002.03887 (2020) - [i160]Erik D. Demaine, Justin Kopinsky, Jayson Lynch:
Recursed is not Recursive: A Jarring Result. CoRR abs/2002.05131 (2020) - [i159]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari is NP-complete. CoRR abs/2003.08331 (2020) - [i158]Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff:
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete. CoRR abs/2003.09914 (2020) - [i157]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. CoRR abs/2004.04207 (2020) - [i156]Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets. CoRR abs/2005.03192 (2020) - [i155]Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch:
Negative Instance for the Edge Patrolling Beacon Problem. CoRR abs/2006.01202 (2020) - [i154]Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets. CoRR abs/2006.01256 (2020) - [i153]Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl:
PSPACE-completeness of Pulling Blocks to Reach a Goal. CoRR abs/2006.04337 (2020) - [i152]Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch:
Escaping a Polygon. CoRR abs/2007.08965 (2020) - [i151]Erik D. Demaine, Martin L. Demaine, David Eppstein:
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CoRR abs/2007.14525 (2020) - [i150]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CoRR abs/2007.15784 (2020) - [i149]Erik D. Demaine, Adam C. Hesterberg, Jason S. Ku:
Finding Closed Quasigeodesics on Convex Polyhedra. CoRR abs/2008.00589 (2020) - [i148]Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal:
Tetris is NP-hard even with $O(1)$ rows or columns. CoRR abs/2009.14336 (2020) - [i147]Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard. CoRR abs/2010.09271 (2020) - [i146]Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. CoRR abs/2011.11767 (2020) - [i145]Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán:
Characterizing Universal Reconfigurability of Modular Pivoting Robots. CoRR abs/2012.07556 (2020)
2010 – 2019
- 2019
- [j174]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105: 199-241 (2019) - [j173]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23(1): 3-27 (2019) - [j172]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright:
Particle computation: complexity, algorithms, and logic. Nat. Comput. 18(1): 181-201 (2019) - [j171]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. 48(6): 1727-1762 (2019) - [c297]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - [c296]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. CSR 2019: 93-105 - [c295]John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa:
Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly. DNA 2019: 140-158 - [c294]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [c293]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019: 37:1-37:15 - [c292]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. WADS 2019: 353-365 - [i144]Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku:
Infinite All-Layers Simple Foldability. CoRR abs/1901.08564 (2019) - [i143]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-trees. CoRR abs/1903.03560 (2019) - [i142]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. CoRR abs/1905.00518 (2019) - [i141]John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa:
Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly. CoRR abs/1906.01773 (2019) - [i140]Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao, Hao-Ting Wei:
Waiting is not easy but worth it: the online TSP on the line revisited. CoRR abs/1907.00317 (2019) - [i139]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge-Unzipping. CoRR abs/1907.08433 (2019) - [i138]Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson:
Existence and hardness of conveyor belts. CoRR abs/1908.07668 (2019) - [i137]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop,