Sue Whitesides

Known as: Whitesides 
Sue Hays Whitesides is a Canadian mathematician and computer scientist, a professor of computer science and the chair of the computer science… (More)
Wikipedia

Related topics

Related topics

4 relations
Computational geometryGraph drawingInternational Symposium on Graph DrawingSymposium on Computational Geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Pneumatic Networks for Soft Robotics that Actuate Rapidly
Bobak Mosadegh, Panagiotis Polygerinos, Christoph Keplinger, Sophia Wennstedt, Robert F. Shepherd, Unmukt Gupta, Jongmin Shim… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2009
2009
Optical microassembly platform for constructing reconfigurable microenvironments for biomedical studies.
Cellular development is highly influenced by the surrounding microenvironment. We propose user-reconfigurable microenvironments… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Microfluidic bubble logic.
We demonstrate universal computation in an all-fluidic two-phase microfluidic system. Nonlinearity is introduced into an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Biomedical Applications of Layer-by-Layer Assembly : From Biomimetics to Tissue Engineering
In the second half of the 20th century, scientists have been attracted to the design of thin solid films at the molecular level… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Locked and Unlocked Polygonal Chains in Three Dimensions
This paper studies movements of polygonal chains in three dimensions whose links are not allowed to cross or change length. Our… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
We describe a new approach for cluster-based drawing of large graphs, which obtains clusters by using binary space partition (BSP… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Navigating Clustered Graphs Using Force-Directed Methods
Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Prevention of protein adsorption by tethered poly(ethylene oxide) layers : Experiments and single-chain mean-field analysis
Prevention of protein adsorption by the surface-grafted poly(ethylene oxide) (PEO) chains has been well-known. We have examined… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Solving the Multiple Instance Problem with Axis-Parallel Rectangles
The multiple instance problem arises in tasks where the training examples are ambiguous: a single example object may have many… (More)
  • figure 9
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Drawing Graphs in Two Layers
Eades, P. and S. Whitesides, Drawing graphs in two layers, Theoretical Computer Science 131 (1994) 361-374. , Let G=(fJ, L,E) be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?