| Fabrication of topologically complex three-dimensional microfluidic systems in PDMS by rapid prototyping JR Anderson, DT Chiu, RJ Jackman, O Cherniavskaya, JC McDonald, ... Analytical chemistry 72 (14), 3158-3164, 2000 | 981 | 2000 |
| Tuning and comparing spatial normalization methods S Robbins, AC Evans, DL Collins, S Whitesides Medical image analysis 8 (3), 311-323, 2004 | 232 | 2004 |
| A complete and effective move set for simplified protein folding N Lesh, M Mitzenmacher, S Whitesides Proceedings of the seventh annual international conference on Research in …, 2003 | 201 | 2003 |
| Magnetic self-assembly of three-dimensional surfaces from planar sheets M Boncheva, SA Andreev, L Mahadevan, A Winkleman, DR Reichman, ... Proceedings of the National Academy of Sciences 102 (11), 3924-3929, 2005 | 191 | 2005 |
| Movement problems for 2-dimensional linkages J Hopcroft, D Joseph, S Whitesides SIAM Journal on Computing 13 (3), 610-629, 1984 | 159 | 1984 |
| Localizing a robot with minimum travel G Dudek, K Romanik, S Whitesides SIAM Journal on Computing 27 (2), 583-604, 1998 | 151 | 1998 |
| On the movement of robot arms in 2-dimensional bounded regions J Hopcroft, D Joseph, S Whitesides SIAM Journal on Computing 14 (2), 315-333, 1985 | 144 | 1985 |
| Drawing graphs in two layers P Eades, S Whitesides Theoretical Computer Science 131 (2), 361-374, 1994 | 139 | 1994 |
| An algorithm for finding clique cut-sets SH Whitesides | 128 | 1981 |
| On the parameterized complexity of layered graph drawing V Dujmović, M Fellows, M Hallett, M Kitching, G Liotta, C McCartin, ... European Symposium on Algorithms, 488-499, 2001 | 110* | 2001 |
| Depth potential function for folding pattern representation, registration and analysis M Boucher, S Whitesides, A Evans Medical image analysis 13 (2), 203-214, 2009 | 99 | 2009 |
| Computing the link center of a simple polygon W Lenhart, R Pollack, J Sack, R Seidel, M Sharir, S Suri, G Toussaint, ... Discrete & Computational Geometry 3 (3), 281-293, 1988 | 94 | 1988 |
| The realization problem for Euclidean minimum spanning trees is NP-hard P Eades, S Whitesides Algorithmica 16 (1), 60-82, 1996 | 92 | 1996 |
| Reconfiguring closed polygonal chains in Euclideand-space WJ Lenhart, SH Whitesides Discrete & Computational Geometry 13 (1), 123-140, 1995 | 87 | 1995 |
| Computational geometry and motion planning SH Whitesides Machine Intelligence and Pattern Recognition 2, 377-427, 1985 | 84 | 1985 |
| Unfolding some classes of orthogonal polyhedra TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy | 83 | 1998 |
| A method for solving certain graph recognition and optimization problems, with applications to perfect graphs SH Whitesides North-Holland mathematics studies 88, 281-297, 1984 | 82 | 1984 |
| Using hierarchical self-assembly to form three-dimensional lattices of spheres H Wu, VR Thalladi, S Whitesides, GM Whitesides Journal of the American Chemical Society 124 (48), 14495-14502, 2002 | 79 | 2002 |
| A visibility representation for graphs in three dimensions P Bose, H Everett, SP Fekete, ME Houle, A Lubiw, H Meijer, K Romanik, ... Graph Algorithms And Applications I, 103-118, 2002 | 72 | 2002 |
| Three-dimensional metallic microstructures fabricated by soft lithography and microelectrodeposition RJ Jackman, ST Brittain, A Adams, H Wu, MG Prentiss, S Whitesides, ... Langmuir 15 (3), 826-836, 1999 | 71 | 1999 |
