| 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 | 1045 | 2000 |
| Tuning and comparing spatial normalization methods S Robbins, AC Evans, DL Collins, S Whitesides Medical image analysis 8 (3), 311-323, 2004 | 251 | 2004 |
| 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 | 217 | 2005 |
| 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 | 209 | 2003 |
| Movement problems for 2-dimensional linkages J Hopcroft, D Joseph, S Whitesides SIAM journal on computing 13 (3), 610-629, 1984 | 169 | 1984 |
| Localizing a robot with minimum travel G Dudek, K Romanik, S Whitesides SIAM Journal on Computing 27 (2), 583-604, 1998 | 157 | 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 | 156 | 1985 |
| Drawing graphs in two layers P Eades, S Whitesides Theoretical Computer Science 131 (2), 361-374, 1994 | 152 | 1994 |
| An algorithm for finding clique cut-sets SH Whitesides Information Processing Letters 12 (1), 31-32, 1981 | 134 | 1981 |
| Depth potential function for folding pattern representation, registration and analysis M Boucher, S Whitesides, A Evans Medical image analysis 13 (2), 203-214, 2009 | 130 | 2009 |
| On the parameterized complexity of layered graph drawing V Dujmović, MR Fellows, M Kitching, G Liotta, C McCartin, N Nishimura, ... Algorithmica 52, 267-292, 2008 | 130* | 2008 |
| Curvature-constrained shortest paths in a convex polygon PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides Proceedings of the fourteenth annual symposium on Computational geometry …, 1998 | 117 | 1998 |
| 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 |
| Unfolding some classes of orthogonal polyhedra TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy | 93 | 1998 |
| The realization problem for Euclidean minimum spanning trees is NP-hard P Eades, S Whitesides Proceedings of the Tenth Annual Symposium on Computational Geometry, 49-56, 1994 | 93 | 1994 |
| Computing k-regret minimizing sets S Chester, A Thomo, S Venkatesh, S Whitesides Proceedings of the VLDB Endowment 7 (5), 389-400, 2014 | 92 | 2014 |
| Computational geometry and motion planning SH Whitesides Machine Intelligence and Pattern Recognition 2, 377-427, 1985 | 90 | 1985 |
| Reconfiguring closed polygonal chains in Euclideand-space WJ Lenhart, SH Whitesides Discrete & Computational Geometry 13, 123-140, 1995 | 87 | 1995 |
| 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 | 77 | 2002 |
