D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 30 Citations 3,470 115 World Ranking 2108 National Ranking 92
Engineering and Technology D-index 32 Citations 4,130 123 World Ranking 4730 National Ranking 195

Overview

What is she best known for?

The fields of study she is best known for:

  • Geometry
  • Artificial intelligence
  • Combinatorics

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 most cited work include:

  • Fabrication of topologically complex three-dimensional microfluidic systems in PDMS by rapid prototyping. (606 citations)
  • Tuning and comparing spatial normalization methods. (193 citations)
  • A complete and effective move set for simplified protein folding (136 citations)

What are the main themes of her work throughout her whole career to date?

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.

She most often published in these fields:

  • Combinatorics (58.00%)
  • Discrete mathematics (35.50%)
  • Time complexity (11.50%)

What were the highlights of her more recent work (between 2010-2019)?

  • Combinatorics (58.00%)
  • Discrete mathematics (35.50%)
  • Planar graph (10.50%)

In recent papers she was focusing on the following fields of study:

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.

Between 2010 and 2019, her most popular works were:

  • Computing k-regret minimizing sets (40 citations)
  • On representing graphs by touching cuboids (22 citations)
  • Indexing Reverse Top-k Queries in Two Dimensions (17 citations)

In her most recent research, the most cited papers focused on:

  • Geometry
  • Artificial intelligence
  • Combinatorics

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.

Best Publications

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)

961 Citations

Tuning and comparing spatial normalization methods.

Steven M. Robbins;Steven M. Robbins;Alan C. Evans;D. Louis Collins;Sue Whitesides.
Medical Image Analysis (2004)

232 Citations

A complete and effective move set for simplified protein folding

Neal Lesh;Michael Mitzenmacher;Sue Whitesides.
research in computational molecular biology (2003)

203 Citations

On the Movement of Robot Arms in 2-Dimensional Bounded Regions

John E. Hopcroft;Deborah Joseph;Sue Whitesides.
SIAM Journal on Computing (1985)

197 Citations

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)

181 Citations

Movement problems for 2-dimensional linkages

John E. Hopcroft;Deborah A. Joseph;Sue H. Whitesides.
SIAM Journal on Computing (1984)

159 Citations

Localizing a Robot with Minimum Travel

Gregory Dudek;Kathleen Romanik;Sue Whitesides.
SIAM Journal on Computing (1998)

147 Citations

Drawing graphs in two layers

Peter Eades;Sue Whitesides.
Theoretical Computer Science (1994)

139 Citations

An algorithm for finding clique cut-sets

S.H. Whitesides.
Information Processing Letters (1981)

126 Citations

Locked and Unlocked Polygonal Chains in Three Dimensions

T. Biedl;E. Demaine;M. Demaine;S. Lazard.
Discrete and Computational Geometry (2001)

97 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Sue Whitesides

Alan C. Evans

Alan C. Evans

McGill University

Publications: 52

Giuseppe Liotta

Giuseppe Liotta

University of Perugia

Publications: 51

Erik D. Demaine

Erik D. Demaine

MIT

Publications: 46

M. Mallar Chakravarty

M. Mallar Chakravarty

McGill University

Publications: 39

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 38

David R. Wood

David R. Wood

Monash University

Publications: 35

Joseph O'Rourke

Joseph O'Rourke

Smith College

Publications: 34

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 29

David Eppstein

David Eppstein

University of California, Irvine

Publications: 29

George M. Whitesides

George M. Whitesides

Harvard University

Publications: 28

Jason P. Lerch

Jason P. Lerch

University of Toronto

Publications: 25

John A. Rogers

John A. Rogers

Northwestern University

Publications: 19

Sang Won Seo

Sang Won Seo

Samsung Medical Center

Publications: 19

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 18

Andreas Brandstädt

Andreas Brandstädt

University of Rostock

Publications: 17

Ashok Malla

Ashok Malla

McGill University

Publications: 17

Something went wrong. Please try again later.