Her scientific interests lie mostly in Combinatorics, Discrete mathematics, Topology, Algorithm and 1-planar graph. Sue Whitesides frequently studies issues relating to Polygon covering and Combinatorics. Her Topology research focuses on Motion and how it relates to Linkage, Sequence and Planar.
Her studies in Algorithm integrate themes in fields like Polynomial, Monte Carlo localization and Color-coding. Her 1-planar graph research is multidisciplinary, relying on both Pathwidth, Outerplanar graph and Distance-hereditary graph. She interconnects Graph drawing and Theoretical computer science in the investigation of issues within Pathwidth.
Her primary areas of investigation include Combinatorics, Discrete mathematics, Time complexity, Graph drawing and Planar graph. Sue Whitesides is interested in Graph, which is a branch of Combinatorics. Her study connects Grid and Discrete mathematics.
Her research integrates issues of Graph theory, Theoretical computer science and Minimum bounding box in her study of Graph drawing. Sue Whitesides studied Planar graph and Outerplanar graph that intersect with Book embedding. Her Plane research includes themes of Chain, Planar, Simple and Polygonal chain.
Her main research concerns Combinatorics, Discrete mathematics, Planar graph, Graph and Time complexity. Specifically, her work in Combinatorics is concerned with the study of Dimension. Her Discrete mathematics research is multidisciplinary, incorporating perspectives in Planar, Cardinality and Regret.
Her Planar graph research also works with subjects such as
Outerplanar graph together with Graph embedding,
Book embedding which intersects with area such as Split graph. Her Graph research also works with subjects such as
Complete graph, Complete bipartite graph and Pathwidth most often made with reference to Unit square,
Grid together with Transpose, Lattice graph and Enumeration. Her work carried out in the field of Time complexity brings together such families of science as Graph drawing and The Intersect.
Sue Whitesides mainly focuses on Combinatorics, Discrete mathematics, Planar graph, Time complexity and Graph drawing. Sue Whitesides mostly deals with Theta graph in her studies of Combinatorics. The concepts of her Discrete mathematics study are interwoven with issues in Linear programming, Data point, Sweep line algorithm and Relaxation.
Her work deals with themes such as 3d space, Rectangle, Mathematical proof and Unit cube, which intersect with Planar graph. The various areas that Sue Whitesides examines in her Time complexity study include Characterization, Simple, Representation and Force-directed graph drawing. Sue Whitesides has included themes like Digraph, Planar, Planarity testing and Topology in her Graph drawing study.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fabrication of topologically complex three-dimensional microfluidic systems in PDMS by rapid prototyping.
Janelle R. Anderson;Daniel T. Chiu;Rebecca J. Jackman;Oksana Cherniavskaya.
Analytical Chemistry (2000)
Tuning and comparing spatial normalization methods.
Steven M. Robbins;Steven M. Robbins;Alan C. Evans;D. Louis Collins;Sue Whitesides.
Medical Image Analysis (2004)
A complete and effective move set for simplified protein folding
Neal Lesh;Michael Mitzenmacher;Sue Whitesides.
research in computational molecular biology (2003)
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
John E. Hopcroft;Deborah Joseph;Sue Whitesides.
SIAM Journal on Computing (1985)
Magnetic self-assembly of three-dimensional surfaces from planar sheets
Mila Boncheva;Stefan A. Andreev;L. Mahadevan;Adam Winkleman.
Proceedings of the National Academy of Sciences of the United States of America (2005)
Movement problems for 2-dimensional linkages
John E. Hopcroft;Deborah A. Joseph;Sue H. Whitesides.
SIAM Journal on Computing (1984)
Localizing a Robot with Minimum Travel
Gregory Dudek;Kathleen Romanik;Sue Whitesides.
SIAM Journal on Computing (1998)
Drawing graphs in two layers
Peter Eades;Sue Whitesides.
Theoretical Computer Science (1994)
An algorithm for finding clique cut-sets
Information Processing Letters (1981)
Locked and Unlocked Polygonal Chains in Three Dimensions
T. Biedl;E. Demaine;M. Demaine;S. Lazard.
Discrete and Computational Geometry (2001)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: