Sue Whitesides

Learn More
Eades, P. and S. Whitesides, Drawing graphs in two layers, Theoretical Computer Science 131 (1994) 361-374. , Let G=(fJ, L,E) be a bipartite graph with vertex set uut and edge set Ec U x L. A typical convention for drawing G is to put the vertices of I/ on a ll’ne and the vertices of L on a separate, parallel line and then to represent edges by placing open(More)
We present new lowest energy configurations for several large benchmark problems for the two-dimensional hydrophobic-hydrophilic model. We found these solutions with a generic implementation of tabu search using an apparently novel set of transformations that we call <i>pull moves</i>. Our experiments show that our algorithm can find these best solutions in(More)
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of(More)
This paper describes a procedure for making topologically complex three-dimensional microfluidic channel systems in poly(dimethylsiloxane) (PDMS). This procedure is called the "membrane sandwich" method to suggest the structure of the final system: a thin membrane having channel structures molded on each face (and with connections between the faces)(More)
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithm gives drawings bounded by an O(x/~ ) • O(x/~ • O(v~ ) box; each edge route contains at most 7 bends. The best previous result generated edge routes containing(More)
We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the size k of the solution is considered a parameter. We first establish a general framework for finding and exploiting small problem kernels (of size polynomial in k). This technique lets us combine Alon, Yuster and Zwick’s color-coding technique with dynamic(More)
The purpose of this note is to present an algorithm for determining whether a graph has a completely connected cut-set and for producing such a cut-set, if one exists, in time proportional to the cube of the number of vertices of the graph. The algorithm can be used for determining properties such as chromatic number and largest clique size for fdes of(More)
The classical mover's problem is the following: can a rigid object in 3-dimensional space be moved from one given position to another while avoiding obstacles? It is known that a more general version of this problem involving objects with movable joints is PSPACE-complete, even for a simple tree-like structure. In this paper, we investigate a 2-dimensional(More)