| Handbook of discrete and computational geometry CD Toth, J O'Rourke, JE Goodman Chapman and Hall/CRC, 2017 | 1542 | 2017 |
| Geometric folding algorithms: linkages, origami, polyhedra ED Demaine, J O'Rourke Cambridge university press, 2007 | 688 | 2007 |
| Anchor-free distributed localization in sensor networks. NB Priyantha, H Balakrishnan, ED Demaine, SJ Teller SenSys 3, 340-341, 2003 | 659 | 2003 |
| A method for building self-folding machines S Felton, M Tolley, E Demaine, D Rus, R Wood Science 345 (6197), 644-646, 2014 | 548 | 2014 |
| Frequency estimation of internet packet streams with limited space ED Demaine, A López-Ortiz, JI Munro European Symposium on Algorithms, 348-360, 2002 | 524 | 2002 |
| Programmable matter by folding E Hawkes, B An, NM Benbernou, H Tanaka, S Kim, ED Demaine, D Rus, ... Proceedings of the National Academy of Sciences 107 (28), 12441-12445, 2010 | 506 | 2010 |
| Mobile-assisted localization in wireless sensor networks NB Priyantha, H Balakrishnan, ED Demaine, S Teller Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and …, 2005 | 348 | 2005 |
| Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs ED Demaine, FV Fomin, M Hajiaghayi, DM Thilikos Journal of the ACM (JACM) 52 (6), 866-893, 2005 | 286 | 2005 |
| Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005 | 258 | 2005 |
| Correlation clustering in general weighted graphs ED Demaine, D Emanuel, A Fiat, N Immorlica Theoretical Computer Science 361 (2-3), 172-187, 2006 | 244 | 2006 |
| PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation RA Hearn, ED Demaine Theoretical Computer Science 343 (1-2), 72-96, 2005 | 244 | 2005 |
| Deploying sensor networks with guaranteed capacity and fault tolerance JL Bredin, ED Demaine, MT Hajiaghayi, D Rus Proceedings of the 6th ACM international symposium on Mobile ad hoc …, 2005 | 238 | 2005 |
| Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000 | 225 | 2000 |
| Adaptive set intersections, unions, and differences ED Demaine, A López-Ortiz, JI Munro In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2000 | 218 | 2000 |
| Playing games with algorithms: Algorithmic combinatorial game theory ED Demaine International Symposium on Mathematical Foundations of Computer Science, 18-33, 2001 | 216 | 2001 |
| Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ED Demaine, ML Demaine Graphs and Combinatorics 23 (1), 195-208, 2007 | 209 | 2007 |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33 (4), 593-604, 2005 | 209 | 2005 |
| Self-folding with shape memory composites SM Felton, MT Tolley, BH Shin, CD Onal, ED Demaine, D Rus, RJ Wood Soft Matter 9 (32), 7688-7694, 2013 | 207 | 2013 |
| Straightening polygonal arcs and convexifying polygonal cycles R Connelly, ED Demaine, G Rote Proceedings 41st Annual Symposium on Foundations of Computer Science, 432-442, 2000 | 202 | 2000 |
| The bidimensionality theory and its algorithmic applications ED Demaine, MT Hajiaghayi The Computer Journal 51 (3), 292-302, 2008 | 192 | 2008 |
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
