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

Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami ED Demaine, ML Demaine, JSB Mitchell Computational Geometry 16 (1), 3-21, 2000 | 133 | 2000 |

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

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 (3), 269-281, 2001 | 93* | 2001 |

Folding and cutting paper ED Demaine, ML Demaine, A Lubiw Japanese Conference on Discrete and Computational Geometry, 104-118, 1998 | 81 | 1998 |

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

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 | 76 | 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 | 72 | 2012 |

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

(Non) existence of pleated folds: how paper folds between creases ED Demaine, ML Demaine, V Hart, GN Price, T Tachi Graphs and Combinatorics 27 (3), 377-397, 2011 | 66 | 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 | 66 | 2002 |

Reconstructing David Huffman’s legacy in curved-crease folding ED Demaine, ML Demaine, D Koschitz Origami 5: Fifth International Meeting of Origami Science, Mathematics, and …, 2011 | 56 | 2011 |

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 | 54 | 2010 |

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 | 52 | 2014 |

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 | 47 | 2011 |

The complexity of Clickomania TC Biedl, ED Demaine, ML Demaine, R Fleischer, L Jacobsen, JI Munro arXiv preprint cs/0107031, 2001 | 46 | 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 | 43 | 1999 |

Hinged dissection of polyominoes and polyforms ED Demaine, ML Demaine, D Eppstein, GN Frederickson, E Friedman Computational Geometry 31 (3), 237-262, 2005 | 36 | 2005 |

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 | 35 | 2015 |

Hinged dissections exist TG Abbott, Z Abel, D Charlton, ED Demaine, ML Demaine, SD Kominers Discrete & Computational Geometry 47 (1), 150-186, 2012 | 35 | 2012 |