Follow
Martin Demaine
Title
Cited by
Cited by
Year
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
ED Demaine, ML Demaine
Graphs and Combinatorics 23 (Suppl 1), 195-208, 2007
2942007
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues
ED Demaine, ML Demaine, SP Fekete, M Ishaque, E Rafalin, ...
Natural Computing 7, 347-370, 2008
1532008
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
1481999
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
1052004
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
1022012
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
1022001
Recent results in computational origami
ED Demaine, ML Demaine
Origami3: Third International Meeting of Origami Science, Mathematics and …, 2002
1002002
(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
912011
PushPush and Push-1 are NP-hard in 2D
ED Demaine, ML Demaine, J O'Rourke
arXiv preprint cs/0007021, 2000
822000
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
812011
Folding and cutting paper
ED Demaine, ML Demaine, A Lubiw
Discrete and Computational Geometry: Japanese Conference, JCDCG’98 Tokyo …, 2000
812000
Reconstructing David Huffman’s legacy in curved-crease folding
ED Demaine, ML Demaine, D Koschitz
Origami 5, 39-52, 2011
762011
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
712002
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
702010
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
632008
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
622015
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
612014
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
562011
The complexity of Clickomania
TC Biedl, ED Demaine, ML Demaine, R Fleischer, L Jacobsen, JI Munro
arXiv preprint cs/0107031, 2001
522001
Folding and one straight cut suffice
ED Demaine, ML Demaine, A Lubiw
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999
481999
The system can't perform the operation now. Try again later.
Articles 1–20