Erik D. Demaine - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 551

2025

2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar GraphsErik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree. mst, 69(2):22, June 2025. [doi]

Hardness of Traversing Gadget Systems with Small BandwidthMIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch. sand 2025: [doi]

2024

Minimum Plane Bichromatic Spanning TreesHugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth. isaac 2024: [doi]

Graph ThreadingErik D. Demaine, Yael Kirkpatrick, Rebecca Lin. innovations 2024: [doi]

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized BoundsErik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert T. Schweller, Ahmed Shalaby 0005, Damien Woods. dna 2024: [doi]

PSPACE-Hard 2D Super Mario Games: Thirteen DoorsMIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman. fun 2024: [doi]

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario GamesMIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat. fun 2024: [doi]

Tetris with Few Piece TypesMIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li. fun 2024: [doi]

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop PuzzlesMIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman. fun 2024: [doi]

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint GraphsMIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou. isaac 2024: [doi]

Routing ReconfigurationsRebecca Lin, Wenzhong Yan, Ankur Mehta, Erik D. Demaine. scf 2024: [doi]

Complexity of 2D Snake Cube PuzzlesPitchayut Saengrungkongka, Erik D. Demaine, Nithid Anchaleenukoon, Kaylee Ji, Alex Dang. cccg 2024: 171-178

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement ConstraintsMIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna. swat 2024: [doi]

2023

Complexity of Reconfiguration in Surface Chemical Reaction NetworksRobert M. Alaniz, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Elise Grizzell, Ryan Knobel, Jayson Lynch, Andrew Rodriguez, Robert T. Schweller, Tim Wylie. dna 2023: [doi]

Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State ChangeRobert M. Alaniz, Michael J. Coulombe, Erik D. Demaine, Bin Fu, Ryan Knobel, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie. cccg 2023: 265-271

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgetsJoshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. TCS, 969:113945, August 2023. [doi]

Traversability, Reconfiguration, and Reachability in the Gadget FrameworkJoshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. algorithmica, 85(11):3453-3486, November 2023. [doi]

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter MachinesJoshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch. sand 2023: [doi]

Rectangular Spiral Galaxies are still hardErik D. Demaine, Maarten Löffler, Christiane Schmidt 0001. comgeo, 110:101949, 2023. [doi]

O(1) refoldingsErik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang. comgeo, 113:101995, August 2023. [doi]

Developing a tetramonohedron with minimum cut lengthErik D. Demaine, Martin L. Demaine, Ryuhei Uehara. comgeo, 108:101903, 2023. [doi]

Super Guarding and Dark Rays in Art GalleriesJoseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock. cccg 2023: 51-61

2022

Hardness of Token Swapping on TreesOswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein. esa 2022: [doi]

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding SquaresHugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms. swat 2022: [doi]

Ununfoldable polyhedra with 6 vertices or 6 facesHugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara. comgeo, 103:101857, 2022. [doi]

Traversability, Reconfiguration, and Reachability in the Gadget FrameworkJoshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. walcom 2022: 47-58 [doi]

Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output GadgetsJoshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. walcom 2022: 187-198 [doi]

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box DudeJoshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. fun 2022: [doi]

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between PolyhedraElena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara. cccg 2022: 9-23

Rolling Polyhedra on TessellationsAkira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams. fun 2022: [doi]

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat AnglesLily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo. compgeom 2022: [doi]

Lower Bounds on Retroactive Data StructuresLily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. isaac 2022: [doi]

PSPACE-Completeness of Reversible Deterministic SystemsErik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch. mcu 2022: 91-108 [doi]

Area-Optimal Simple Polygonalizations: The CG Challenge 2019Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell. jea, 27, 2022. [doi]

Computational Complexity of Flattening Fixed-Angle Orthogonal ChainsErik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara. cccg 2022: 98-104

ZHED is NP-completeSagnik Saha, Erik D. Demaine. cccg 2022: 277-283

2021

Continuous flattening of all polyhedral manifolds using countably infinite creasesZachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara. comgeo, 98:101773, 2021. [doi]

Snipperclips: Cutting tools into desired polygons using themselvesZachary Abel, Hugo A. Akitaya, Man-Kwun Chiu, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jayson Lynch, André van Renssen, Marcel Roeloffzen. comgeo, 98:101784, 2021. [doi]

Tatamibari Is NP-CompleteAviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch. fun 2020: [doi]

Folding polyominoes with holes into a cubeOswin 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 0001. comgeo, 93:101700, 2021. [doi]

Folding Points to a Point and Lines to a LineHugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt 0001. cccg 2021: 271-278

Characterizing Universal Reconfigurability of Modular Pivoting RobotsHugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán. compgeom 2021: [doi]

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) MusketeersHugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán. algorithmica, 83(5):1316-1351, 2021. [doi]

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door GadgetsJoshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. fun 2020: [doi]

Edge-Unfolding Prismatoids: Tall or Rectangular BaseVincent Bian, Erik D. Demaine, Rachana Madhukara. cccg 2021: 343-347

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-CompleteJosh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff. fun 2020: [doi]

On the effects of hierarchical self-assembly for reducing program-size complexitySarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow. TCS, 894:50-78, 2021. [doi]

Scalable Equilibrium Computation in Multi-agent Influence Games on NetworksFotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff. AAAI 2021: 5277-5285 [doi]

Multidimensional Scaling: Approximation and ComplexityErik D. Demaine, Adam Hesterberg, Frederic Koehler, Jayson Lynch, John Urschel. icml 2021: 2568-2578 [doi]

Yin-Yang Puzzles are NP-completeErik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno. cccg 2021: 97-106

An Efficient Reversible Algorithm for Linear RegressionErik D. Demaine, Jayson Lynch, Jiaying Sun. icrc 2021: 103-108 [doi]

Belga B-TreesErik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman. mst, 65(3):541-558, 2021. [doi]

Approximating the Canadian Traveller Problem with Online RandomizationErik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane. algorithmica, 83(5):1524-1543, 2021. [doi]

Any Regular Polyhedron Can Transform to Another by O(1) RefoldingsErik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang. cccg 2021: 332-342

2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossibleZachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen. TCS, 839:41-102, 2020. [doi]

Rigid foldability is NP-hardHugo Alves Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi. jocg, 11(1):93-124, 2020. [doi]

Infinite All-Layers Simple FoldabilityHugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku. gc, 36(2):231-244, 2020. [doi]

Polyhedral Characterization of Reversible Hinged DissectionsJin Akiyama, Erik D. Demaine, Stefan Langerman. gc, 36(2):221-229, 2020. [doi]

Arithmetic Expression ConstructionLeo 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. isaac 2020: [doi]

PSPACE-completeness of Pulling Blocks to Reach a GoalJoshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl. jip, 28:929-941, 2020. [doi]

O(1) Rows or ColumnsSualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal. jip, 28:942-958, 2020. [doi]

Existence and Hardness of Conveyor BeltsMolly 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. combinatorics, 27(4):4, 2020. [doi]

Universal hinge patterns for folding strips efficiently into any grid polyhedronNadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw. comgeo, 89:101633, 2020. [doi]

Path Puzzles: Discrete Tomography with a Path Constraint is HardJeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky. gc, 36(2):251-267, 2020. [doi]

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two PlayersJeffrey 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. jip, 28:987-1007, 2020. [doi]

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is HardJosh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman. isaac 2020: [doi]

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connectJean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow. TCS, 806:332-343, 2020. [doi]

Finding Closed Quasigeodesics on Convex PolyhedraErik D. Demaine, Adam Hesterberg, Jason S. Ku. compgeom 2020: [doi]

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games HardErik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. innovations 2020: [doi]

Recursed Is Not Recursive: A Jarring ResultErik D. Demaine, Justin Kopinsky, Jayson Lynch. isaac 2020: [doi]

Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley AssignmentErik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura. jip, 28:825-833, 2020. [doi]

Adventures in Maze Folding ArtErik D. Demaine, Martin L. Demaine. jip, 28:745-749, 2020. [doi]

Cookie ClickerErik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao. gc, 36(2):269-302, 2020. [doi]

Symmetric assembly puzzles are hard, beyond a few piecesErik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno. comgeo, 90:101648, 2020. [doi]

2019

Folding Polyominoes with Holes into a CubeOswin 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 0001. cccg 2019: 164-170

Simulation of Programmable Matter Systems Using Active Tile-Based Self-AssemblyJohn Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine, Matthew J. Patitz, Andréa W. Richa. dna 2019: 140-158 [doi]

Particle computation: complexity, algorithms, and logicAaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright. nc, 18(1):181-201, 2019. [doi]

Belga B-TreesErik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman. csr 2019: 93-105 [doi]

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded StretchErik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer. SICOMP, 48(6):1727-1762, 2019. [doi]

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphsErik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan. jcss, 105:199-241, 2019. [doi]

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable ClassErik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel. esa 2019: [doi]

Reconfiguring Undirected PathsErik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno. wads 2019: 353-365 [doi]

Sequentially Swapping Colored Tokens on GraphsKatsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno. jgaa, 23(1):3-27, 2019. [doi]

2018

Negative Instance for the Edge Patrolling Beacon ProblemZachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch. jcdcg 2021: 28-35 [doi]

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossibleZachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy. fun 2018: [doi]

Conflict-Free Coloring of GraphsZachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer. siamdm, 32(4):2675-2702, 2018. [doi]

Folding Polyominoes into (Poly)CubesOswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt 0001. ijcga, 28(3):197-226, 2018. [doi]

PachinkoHugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch. comgeo, 68:226-242, 2018. [doi]

Data Structures for Halfplane Proximity Queries and Incremental Voronoi DiagramsBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. algorithmica, 80(11):3316-3334, 2018. [doi]

Computational Complexity of Generalized Push FightJeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy. fun 2018: [doi]

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to ConnectJean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow. cocoon 2018: 365-377 [doi]

Solving the Rubik's Cube Optimally is NP-completeErik D. Demaine, Sarah Eisenstat, Mikhail Rudoy. STACS 2018: [doi]

Tree-Residue Vertex-Breaking: a new tool for proving hardnessErik D. Demaine, Mikhail Rudoy. swat 2018: [doi]

The Computational Complexity of Portal and Other 3D Video GamesErik D. Demaine, Joshua Lockhart, Jayson Lynch. fun 2018: [doi]

Know When to Fold 'Em: Self-assembly of Shapes by Folding in OritatamiErik D. Demaine, Jacob Hendricks, Meagan Olsen, Matthew J. Patitz, Trent A. Rogers, Nicolas Schabanel, Shinnosuke Seki, Hadley Thomas. dna 2018: 19-36 [doi]

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded StretchErik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer. compgeom 2018: [doi]

Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory TransfersErik D. Demaine, Quanquan C. Liu. spaa 2018: 195-204 [doi]

2 - 1)-puzzle is hardErik D. Demaine, Mikhail Rudoy. TCS, 732:80-84, 2018. [doi]

Computational Complexity of Motion Planning of a Robot through Simple GadgetsErik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy. fun 2018: [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Erik D. Demaine'

Viewing Publication 1 - 100 from 551

2025

2024

2023

2022

2021

2020

2019

2018

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Erik D. Demaine'

Viewing Publication 1 - 100 from 551

2025

2024

2023

2022

2021

2020

2019

2018

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1