World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
4580
World Ranking
10919
National Ranking
435

Mathematics

D-Index
41
Citations
6113
World Ranking
1934
National Ranking
70

Overview

Sue Whitesides is affiliated with the University of Victoria in Canada and specializes in computer science with a significant focus on computational theory and applied mathematics within this broad field. Their work spans several subfields including computer networks and communications, computer vision and pattern recognition, artificial intelligence, and computer graphics and computer-aided design.

The research contributions of Sue Whitesides include investigations into interconnection networks and systems, advanced graph theory research, algorithms and data compression, cellular automata and applications, computational geometry and mesh generation, optimization and search problems, as well as 3D shape modeling and analysis.

Their recent published papers feature the following:

  • Closed space-filling curves with controlled orientation for 3D printing, 2022, published in Computer Graphics Forum
  • Combinatorial Properties and Recognition of Unit Square Visibility Graphs, 2023, published in Discrete & Computational Geometry
  • 1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, 2023, published in Journal of Graph Algorithms and Applications
  • The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs, 2022, published in arXiv (Cornell University)
  • Combinatorial Properties and Recognition of Unit Square Visibility Graphs, 2023, published in edoc Publication server (Humboldt University of Berlin)

Frequently collaborating coauthors include Rahnuma Islam Nishat, Venkatesh Srinivasan, Katrin Casel, and Henning Fernau.

Sue Whitesides has published regularly in diverse venues such as Computer Graphics Forum, Discrete & Computational Geometry, Journal of Graph Algorithms and Applications, arXiv (Cornell University), and the edoc Publication server of Humboldt University of Berlin.

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

  • Tuning and comparing spatial normalization methods.

    Steven M. Robbins;Steven M. Robbins;Alan C. Evans;D. Louis Collins;Sue Whitesides

  • Magnetic self-assembly of three-dimensional surfaces from planar sheets

    Mila Boncheva;Stefan A. Andreev;L. Mahadevan;Adam Winkleman

  • A complete and effective move set for simplified protein folding

    Neal Lesh;Michael Mitzenmacher;Sue Whitesides

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

    John E. Hopcroft;Deborah Joseph;Sue Whitesides

  • Movement problems for 2-dimensional linkages

    John E. Hopcroft;Deborah A. Joseph;Sue H. Whitesides

  • Localizing a Robot with Minimum Travel

    Gregory Dudek;Kathleen Romanik;Sue Whitesides

  • Drawing graphs in two layers

    Peter Eades;Sue Whitesides

  • An algorithm for finding clique cut-sets

    S.H. Whitesides

  • Depth potential function for folding pattern representation, registration and analysis

    Maxime Boucher;Sue Whitesides;Alan C. Evans

  • Locked and Unlocked Polygonal Chains in Three Dimensions

    T. Biedl;E. Demaine;M. Demaine;S. Lazard

  • Computational Geometry and Motion Planning

    S.H. Whitesides

  • On the Parameterized Complexity of Layered Graph Drawing

    Vida Dujmović;Michael R. Fellows;Matthew Kitching;Giuseppe Liotta

  • The realization problem for Euclidean minimum spanning trees is NP-hard

    Peter Eades;Sue Whitesides

  • Reconfiguring closed polygonal chains in Euclideand-space

    W. J. Lenhart;S. H. Whitesides

  • On the Parameterized Complexity of Layered Graph Drawing

    Vida Dujmovic;Michael R. Fellows;Michael T. Hallett;M. Kitching

  • Unfolding some classes of orthogonal polyhedra.

    Therese C. Biedl;Erik D. Demaine;Martin L. Demaine;Anna Lubiw

  • Anatomical standardization of the human brain in euclidean 3-space and on the cortical 2-manifold

    Sue Whitesides;Alan Evans;Steven M. Robbins

  • Using hierarchical self-assembly to form three-dimensional lattices of spheres.

    Hongkai Wu;Venkat R. Thalladi;Sue Whitesides;George M. Whitesides

  • A note on reconfiguring tree linkages: trees can lock ☆

    Therese C. Biedl;Erik D. Demaine;Martin L. Demaine;Sylvain Lazard

  • Curvature-Constrained Shortest Paths in a Convex Polygon

    Pankaj K. Agarwal;Therese Biedl;Sylvain Lazard;Steve Robbins

  • Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

    M. R. Fellows;C. Knauer;N. Nishimura;P. Ragde

  • Curvature-constrained shortest paths in a convex polygon (extended abstract)

    Pankaj K. Agarwal;Therese Biedl;Sylvain Lazard;Steve Robbins

Frequent Co-Authors

Anna Lubiw
Anna Lubiw University of Waterloo
Giuseppe Liotta
Giuseppe Liotta University of Perugia
Olivier Devillers
Olivier Devillers University of Lorraine
George M. Whitesides
George M. Whitesides Harvard University
Peter Eades
Peter Eades University of Sydney
Joseph O'Rourke
Joseph O'Rourke Smith College
Michael R. Fellows
Michael R. Fellows Lebanese American University
Hongkai Wu
Hongkai Wu Hong Kong University of Science and Technology
Giuseppe Di Battista
Giuseppe Di Battista Roma Tre University

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

Report an issue

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:

Related Online Degrees & Career Pathways

For Mathematics graduates looking to expand their career options, pursuing related online degrees can be a strategic move. A popular choice is a masters data analytics program, which leverages strong mathematical foundations to analyze and interpret complex data sets—a skill in high demand across industries.

Additionally, many professionals consider an MBA to gain business acumen and leadership skills. If accessibility is key, exploring the easiest mba to get into options can offer a practical path without compromising on quality.

For those seeking flexibility, the easiest and fastest online mba programs provide accelerated formats suited for working professionals eager to advance quickly.

Finally, for career advancement focused on organizational leadership, pursuing one of the most affordable online dba programs can offer an affordable yet impactful option to deepen expertise in business administration.

Combining strong mathematical skills with these diverse degree pathways opens doors to rewarding careers in analytics, management, and executive leadership.

Best Scientists Citing Sue Whitesides

Trending Scientists

Recently Published Articles