Showing 1 - 20 results of 220 for search 'Demaine, Erik D.', query time: 0.06s Refine Results
  1. 1
    Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect

    Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect by Demaine, Erik D

    Published 2020
    Get full text
    Article
  2. 2
    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers

    Universal reconfiguration of facet-connected modular robots by pivots: The O(1) musketeers by Demaine, Erik D

    Published 2020
    Get full text
    Article
  3. 3
    Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

    Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs by Demaine, Erik D

    Published 2021
    Get full text
    Article
  4. 4
    Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly

    Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly by Demaine, Erik D

    Published 2021
    Get full text
    Article
  5. 5
    Embedding Stacked Polytopes on a Polynomial-Size Grid

    Embedding Stacked Polytopes on a Polynomial-Size Grid by Schulz, André, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Article
  6. 6
    Folding Flat Crease Patterns With Thick Materials

    Folding Flat Crease Patterns With Thick Materials by Ku, Jason S, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
  7. 7
    Bust-a-Move/Puzzle Bobble Is NP-complete

    Bust-a-Move/Puzzle Bobble Is NP-complete by Langerman, Stefan, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Article
  8. 8
    Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

    Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs by Demaine, Erik D, Liu, Quanquan

    Published 2019
    Get full text
    Article
  9. 9
    Rigid foldability is NP-hard

    Rigid foldability is NP-hard by Demaine, Erik D, Ku, Jason S

    Published 2020
    Get full text
    Article
  10. 10
    Symmetric assembly puzzles are hard, beyond a few pieces

    Symmetric assembly puzzles are hard, beyond a few pieces by Demaine, Erik D, Ku, Jason S

    Published 2020
    Get full text
    Article
  11. 11
    Folded Structures Satisfying Multiple Conditions

    Folded Structures Satisfying Multiple Conditions by Demaine, Erik D, Ku, Jason S

    Published 2021
    Get full text
    Article
  12. 12
    A simple proof that the (n2 − 1)-puzzle is hard

    A simple proof that the (n2 − 1)-puzzle is hard by Demaine, Erik D, Rudoy, Mikhail

    Published 2021
    Get full text
    Article
  13. 13
    A simple proof that the (n2 − 1)-puzzle is hard

    A simple proof that the (n2 − 1)-puzzle is hard by Demaine, Erik D, Rudoy, Mikhail

    Published 2022
    Get full text
    Article
  14. 14
    Folding Flat Crease Patterns With Thick Materials

    Folding Flat Crease Patterns With Thick Materials by Ku, Jason S., Demaine, Erik D.

    Published 2021
    Get full text
    Article
  15. 15
    Folding Flat Crease Patterns With Thick Materials

    Folding Flat Crease Patterns With Thick Materials by Ku, Jason S., Demaine, Erik D

    Published 2021
    Get full text
    Article
  16. 16
    Embedding Stacked Polytopes on a Polynomial-Size Grid

    Embedding Stacked Polytopes on a Polynomial-Size Grid by Demaine, Erik D., Schulz, Andre

    Published 2011
    Get full text
    Get full text
    Article
  17. 17
    Minimizing the Diameter of a Network Using Shortcut Edges

    Minimizing the Diameter of a Network Using Shortcut Edges by Demaine, Erik D., Zadimoghaddam, Morteza

    Published 2011
    Get full text
    Get full text
    Article
  18. 18
    Constant Price of Anarchy in Network Creation Games via Public Service Advertising

    Constant Price of Anarchy in Network Creation Games via Public Service Advertising by Demaine, Erik D., Zadimoghaddam, Morteza

    Published 2011
    Get full text
    Get full text
    Article
  19. 19
    Scheduling to Minimize Power Consumption using Submodular Functions

    Scheduling to Minimize Power Consumption using Submodular Functions by Demaine, Erik D., Zadimoghaddam, Morteza

    Published 2012
    Get full text
    Get full text
    Article
  20. 20
    Approximability of the Subset Sum Reconfiguration Problem

    Approximability of the Subset Sum Reconfiguration Problem by Ito, Takehiro, Demaine, Erik D.

    Published 2014
    Get full text
    Get full text
    Article

Search Tools: