Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ED Demaine, ML Demaine Graphs and Combinatorics 23 (Suppl 1), 195-208, 2007 | 293 | 2007 |

Staged self-assembly: nanomanufacture of arbitrary shapes with *O*(1) gluesED Demaine, ML Demaine, SP Fekete, M Ishaque, E Rafalin, ... Natural Computing 7, 347-370, 2008 | 152 | 2008 |

Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami ED Demaine, ML Demaine, JSB Mitchell Proceedings of the fifteenth annual symposium on Computational geometry, 105-114, 1999 | 146 | 1999 |

When can you fold a map? EM Arkin, MA Bender, ED Demaine, ML Demaine, JSB Mitchell, S Sethia, ... Computational Geometry 29 (1), 23-46, 2004 | 105 | 2004 |

Two hands are better than one (up to constant factors) S Cannon, ED Demaine, ML Demaine, S Eisenstat, MJ Patitz, ... arXiv preprint arXiv:1201.1650, 2012 | 102 | 2012 |

Locked and unlocked polygonal chains in three dimensions T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ... Discrete & Computational Geometry 26, 269-281, 2001 | 102 | 2001 |

Recent results in computational origami ED Demaine, ML Demaine Origami3: Third International Meeting of Origami Science, Mathematics and …, 2002 | 100 | 2002 |

(Non) existence of pleated folds: how paper folds between creases ED Demaine, ML Demaine, V Hart, GN Price, T Tachi Graphs and Combinatorics 27, 377-397, 2011 | 91 | 2011 |

PushPush and Push-1 are NP-hard in 2D ED Demaine, ML Demaine, J O'Rourke arXiv preprint cs/0007021, 2000 | 81 | 2000 |

Folding and cutting paper ED Demaine, ML Demaine, A Lubiw Discrete and Computational Geometry: Japanese Conference, JCDCG’98 Tokyo …, 2000 | 81 | 2000 |

Curved crease folding: a review on art, design and mathematics ED Demaine, ML Demaine, D Koschitz, T Tachi Proceedings of the IABSE-IASS symposium: taller, longer, lighter, 20-23, 2011 | 79 | 2011 |

Reconstructing David Huffman’s legacy in curved-crease folding ED Demaine, ML Demaine, D Koschitz Origami 5, 39-52, 2011 | 75 | 2011 |

A note on reconfiguring tree linkages: Trees can lock T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ... Discrete Applied Mathematics 117 (1-3), 293-297, 2002 | 71 | 2002 |

Shape replication through self-assembly and RNase enzymes Z Abel, N Benbernou, M Damian, ED Demaine, ML Demaine, R Flatland, ... Proceedings of the twenty-first annual ACM-SIAM symposium on discrete …, 2010 | 70 | 2010 |

Hinged dissections exist TG Abbott, Z Abel, D Charlton, ED Demaine, ML Demaine, SD Kominers Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008 | 64 | 2008 |

Linear-time algorithm for sliding tokens on trees ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ... Theoretical Computer Science 600, 132-142, 2015 | 61 | 2015 |

An end-to-end approach to making self-folded 3D surface shapes by uniform heating B An, S Miyashita, MT Tolley, DM Aukes, L Meeker, ED Demaine, ... 2014 IEEE International Conference on Robotics and Automation (ICRA), 1466-1473, 2014 | 61 | 2014 |

Algorithms for solving Rubik’s cubes ED Demaine, ML Demaine, S Eisenstat, A Lubiw, A Winslow Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011 | 56 | 2011 |

The complexity of Clickomania TC Biedl, ED Demaine, ML Demaine, R Fleischer, L Jacobsen, JI Munro arXiv preprint cs/0107031, 2001 | 52 | 2001 |

Folding and one straight cut suffice ED Demaine, ML Demaine, A Lubiw Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999 | 47 | 1999 |