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 | 934 | 2000 |

Tuning and comparing spatial normalization methods S Robbins, AC Evans, DL Collins, S Whitesides Medical image analysis 8 (3), 311-323, 2004 | 224 | 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 | 197 | 2003 |

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 | 190 | 1985 |

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 | 177 | 2005 |

Movement problems for 2-dimensional linkages J Hopcroft, D Joseph, S Whitesides SIAM Journal on Computing 13 (3), 610-629, 1984 | 154 | 1984 |

Effects of navigation speed on motion sickness caused by an immersive virtual environment RHY So, WT Lo, ATK Ho Human factors 43 (3), 452-461, 2001 | 151 | 2001 |

Localizing a robot with minimum travel G Dudek, K Romanik, S Whitesides SIAM Journal on Computing 27 (2), 583-604, 1998 | 141 | 1998 |

Drawing graphs in two layers P Eades, S Whitesides Theoretical Computer Science 131 (2), 361-374, 1994 | 135 | 1994 |

An algorithm for finding clique cut-sets SH Whitesides | 122 | 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 | 101* | 2001 |

Level planarity testing in linear time M Jünger, S Leipert, P Mutzel International Symposium on Graph Drawing, 224-237, 1998 | 98 | 1998 |

Depth potential function for folding pattern representation, registration and analysis M Boucher, S Whitesides, A Evans Medical image analysis 13 (2), 203-214, 2009 | 90 | 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 | 88 | 1988 |

The realization problem for Euclidean minimum spanning trees is NP-hard P Eades, S Whitesides Algorithmica 16 (1), 60-82, 1996 | 84 | 1996 |

Reconfiguring closed polygonal chains in Euclideand-space WJ Lenhart, SH Whitesides Discrete & Computational Geometry 13 (1), 123-140, 1995 | 83 | 1995 |

Unfolding some classes of orthogonal polyhedra TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy | 82 | 1998 |

Computational geometry and motion planning SH Whitesides Machine Intelligence and Pattern Recognition 2, 377-427, 1985 | 80 | 1985 |

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 | 76 | 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 | 75 | 2002 |