Sue Whitesides
#65,561
Most Influential Person Now
Canadian mathematician and computer scientist
Sue Whitesides's AcademicInfluence.com Rankings
Sue Whitesidescomputer-science Degrees
Computer Science
#4468
World Rank
#4712
Historical Rank
Theoretical Computer Science
#140
World Rank
#140
Historical Rank
Sue Whitesidesmathematics Degrees
Mathematics
#4008
World Rank
#5780
Historical Rank
Complexity Theory
#18
World Rank
#18
Historical Rank
Group Theory
#198
World Rank
#234
Historical Rank
Algebra
#404
World Rank
#555
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Sue Whitesides Influential?
(Suggest an Edit or Addition)According to Wikipedia, Sue Hays Whitesides is a Canadian mathematician and computer scientist, a professor emeritus of computer science and the chair of the computer science department at the University of Victoria in British Columbia, Canada. Her research specializations include computational geometry and graph drawing.
Sue Whitesides's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Fabrication of topologically complex three-dimensional microfluidic systems in PDMS by rapid prototyping. (2000) (684)
- Tuning and Comparing Spatial Normalization Methods (2003) (228)
- A complete and effective move set for simplified protein folding (2003) (165)
- Magnetic self-assembly of three-dimensional surfaces from planar sheets. (2005) (141)
- Movement Problems for 2-Dimensional Linkages (1984) (133)
- On the movement of robot arms in 2-dimensional bounded regions (1982) (114)
- Localizing a robot with minimum travel (1995) (108)
- An Algorithm for Finding Clique Cut-Sets (1981) (101)
- Depth potential function for folding pattern representation, registration and analysis (2009) (96)
- Drawing Graphs in Two Layers (1994) (94)
- Curvature-Constrained Shortest Paths in a Convex Polygon (2002) (84)
- Computing the link center of a simple polygon (2011) (80)
- Unfolding some classes of orthogonal polyhedra (1998) (77)
- Reconfiguring closed polygonal chains in Euclideand-space (1995) (74)
- On the Parameterized Complexity of Layered Graph Drawing (2001) (74)
- Anatomical standardization of the human brain in euclidean 3-space and on the cortical 2-manifold (2004) (74)
- The realization problem for Euclidean minimum spanning trees is NP-hard (1994) (68)
- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems (2008) (67)
- Computational Geometry and Motion Planning (1985) (65)
- A Method for Solving Certain Graph Recognition and Optimization Problems, with Applications to Perfect Graphs (1982) (64)
- A Visibility Representation for Graphs in Three Dimensions (1998) (56)
- Computing k-Regret Minimizing Sets (2014) (56)
- Locked and unlocked polygonal chains in 3D (1998) (55)
- Three-dimensional orthogonal graph drawing algorithms (2000) (52)
- Grid intersection graphs and boxicity (1993) (51)
- Using hierarchical self-assembly to form three-dimensional lattices of spheres. (2002) (50)
- Dissections: self-assembled aggregates that spontaneously reconfigure their structures when their environment changes. (2002) (49)
- Microorigami: Fabrication of Small, Three-Dimensional, Metallic Structures (2001) (49)
- The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings (1996) (48)
- Two Algorithms for Three Dimensional Orthogonal Graph Drawing (1996) (46)
- Three-Dimensional Metallic Microstructures Fabricated by Soft Lithography and Microelectrodeposition (1999) (46)
- Locked and Unlocked Polygonal Chains in Three Dimensions (1999) (44)
- Combinatorial designs related to the strong perfect graph conjecture (1979) (41)
- A Fixed-Parameter Approach to 2-Layer Planarization (2001) (41)
- The rectangle of influence drawability problem (1996) (41)
- Discrete mathematics for computer science (2005) (39)
- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization (2002) (38)
- Gender and Graduate School: Engineering Students Confront Life after the B. Eng. (2002) (37)
- New Results on a Visibility Representation of Graphs in 3D (1995) (37)
- Universal 3-dimensional visibility representations for graphs (1995) (37)
- Transversals to Line Segments in Three-Dimensional Space (2005) (36)
- Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra (2007) (34)
- A note on reconfiguring tree linkages: trees can lock (2002) (33)
- Combinatorial Designs Related to the Perfect Graph Conjecture (1984) (33)
- Randomized Algorithms for Minimum Distance Localization (2007) (31)
- Algorithmic Issues in the Geometry of Planar Linkage Movement (1992) (31)
- Parameterized Complexity of Geometric Problems (2008) (31)
- The Logic Engine and the Realization Problem for Nearest Neighbor Graphs (1996) (29)
- The strength of weak proximity (1995) (29)
- Rectangle Visibility Graphs: Characterization, Construction, and Compaction (2003) (26)
- Bounds for Orthogonal 3-D Graph Drawing (1999) (24)
- Separating point sets in polygonal environments (2004) (23)
- Convexifying star-shaped polygons (1998) (22)
- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems (2004) (21)
- On Representing Graphs by Touching Cuboids (2012) (21)
- On reconfiguring tree linkages: Trees can lock (1999) (21)
- Fabrication of Topologically Complex Three-Dimensional Microstructures: Metallic Microknots (2000) (20)
- Graph Multidrawing: Finding Nice Drawings Without Defining Nice (1998) (20)
- On the Planar Split Thickness of Graphs (2015) (19)
- Recognizing Rectangle of Influence Drawable Graphs (1994) (18)
- Sampled medial loci for 3D shape representation (2011) (18)
- Indexing Reverse Top-k Queries in Two Dimensions (2013) (17)
- Curvature-constrained shortest paths in a convex polygon (extended abstract) (1998) (16)
- On the number of lines tangent to four convex polyhedra (2002) (16)
- A GENERAL RANDOM COMBINATORIAL MODEL OF BOTANICAL TREES (1998) (16)
- Computing upward topological book embeddings of upward planar digraphs (2007) (16)
- Minimum Distance Localization for a Robot with Limited Visibility (2005) (16)
- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization (2003) (16)
- Embeddability Problems for Upward Planar Digraphs (2009) (15)
- Orthogonal 3-D Graph Drawing (1997) (15)
- The complexity of (un)folding (2003) (14)
- A Note on Minimum-Segment Drawings of Planar Graphs (2011) (14)
- Sampled medial loci and boundary differential geometry (2009) (14)
- Nearest Neighbour Graph Realizability is NP-hard (1995) (13)
- The largest k-ball in a d-dimensional box (1998) (13)
- Folding rulers inside triangles (1996) (13)
- Connecting a set of circles with minimum sum of radii (2011) (13)
- Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks (2012) (12)
- Dominance Drawings of Bipartite Graphs (1993) (12)
- The Range Beacon Placement Problem for Robot Navigation (2014) (12)
- Medial Axis Approximation with Bounded Error (2009) (11)
- Embedding problems for paths with direction constrained edges (2000) (11)
- On the Size of the 3D Visibility Skeleton: Experimental Results (2008) (11)
- A simple, faster method for kinetic proximity problems (2013) (10)
- Range-based Navigation System for a Mobile Robot (2011) (10)
- The number of lines tangent to arbitrary convex polyhedra in 3D (2004) (10)
- The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems (1997) (9)
- Acyclic coloring with few division vertices (2012) (9)
- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs (2019) (9)
- Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005) (9)
- Acyclic colorings of graph subdivisions revisited (2012) (9)
- Collineations of Projective Planes of Order 10, Part I (1979) (9)
- The Shape of Orthogonal Cycles in Three Dimensions (2012) (8)
- Map Folding (2013) (8)
- On the Complexity of the Linkage Reconguration Problem (2003) (8)
- Indexing for Vector Projections (2011) (8)
- Simultaneous localization and environmental mapping with a sensor network (2011) (7)
- Kinetic data structures for all nearest neighbors and closest pair in the plane (2013) (7)
- Orthogonal Drawings of Cycles in 3D Space (Extended Abstract) (2000) (7)
- On validating planar worlds (2001) (7)
- Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages (2001) (7)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (2010) (7)
- The Three Dimensional Logic Engine (2004) (6)
- A classification of certain graphs with minimal imperfection properties (1984) (6)
- Determining Points of a Circular Region Reachable by Joints of a Robot Arm (1982) (6)
- The number of transversals to line segments in R^3 (2003) (6)
- Visibility Representations of Boxes in 2.5 Dimensions (2016) (6)
- Transversals to line segments in R3 (2003) (6)
- Towards an implementation of the 3D visibility skeleton (2007) (6)
- Fabrication of Micro-Chain Mail by Simultaneous, Patterned Electrodeposition on a Plane and Multiple Cylinders. (2001) (6)
- On folding rulers in regular polygons (1997) (5)
- Kinetic and Stationary Point-Set Embeddability for Plane Graphs (2012) (5)
- On the Reachable Regions of Chains (1996) (5)
- Graph drawing : 6th International Symposium, GD'98, Montréal, Canada, August 13-15, 1998 : proceedings (1998) (5)
- On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra (2005) (5)
- Connectivity Graphs of Uncertainty Regions (2010) (5)
- Approximating the Medial Axis by Shooting Rays: 3D Case (2011) (5)
- Bend Complexity and Hamiltonian Cycles in Grid Graphs (2017) (5)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (2011) (5)
- Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996 (1996) (4)
- Proceedings of the twenty-eighth annual symposium on Computational geometry (2012) (4)
- On the reconfiguration and reachability of chains (1997) (4)
- Simultaneous dominance representation of multiple posets (1996) (4)
- Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d (2013) (4)
- Acyclic Colorings of Graph Subdivisions (2011) (4)
- Stochastic Scheduling for Underwater Sensor Networks (2011) (3)
- Kinetic Reverse k-Nearest Neighbor Problem (2014) (3)
- On the Reconfiguration of Chains (Extended Abstract) (1996) (3)
- Risk Averse Motion Planning for a Mobile Robot (2011) (3)
- A Discrete Differential Operator for Direction-based Surface Morphometry (2007) (3)
- Proceedings of the 6th International Symposium on Graph Drawing (1998) (3)
- On Bus Graph Realizability (2006) (3)
- Indexing Reverse Top-k Queries (2012) (2)
- The Sentinel Problem for a Multi-hop Sensor Network (2010) (2)
- Algorithmic and Complexity Results for Drawing Euclidian Trees (1992) (2)
- Closed space‐filling curves with controlled orientation for 3D printing (2022) (2)
- On Computing Shortest External Watchman Routes for Convex Polygons (2006) (2)
- Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs (2021) (2)
- Acknowledgement. the Authors Thank Bill Lenhart for Interesting Discussions on the Reconnguration of Rulers (1996) (2)
- Realizing partitions respecting full and partial order information (2008) (2)
- Open Problems from CCCG 2014 (2015) (2)
- On the Computation of 3D Visibility Skeletons (2010) (2)
- A Note on Minimum-Segment Drawings of (2013) (1)
- Edge-colored complete graphs with alternating cycles (1983) (1)
- On the Reliability of Triangle Intersection in 3D (2003) (1)
- Computing optimal k-regret minimizing sets with top-k depth contours (2012) (1)
- Connectivity Graphs of Uncertainty Regions (2016) (1)
- Kinetic $k$-Semi-Yao Graph and its Applications (2014) (1)
- A Succinct 3D Visibility Skeleton (2010) (1)
- How to Water Carrots : Geometric Coverage Problems for Point Sets (2005) (1)
- A note on a generalized regularity condition (1978) (1)
- (Reverse) k-nearest neighbors for moving objects (2014) (1)
- Kinetic Data Structures on The Move (2013) (1)
- On the Computation of the 3D Visibility Skeleton (2010) (1)
- The Rectangle of In uence Drawability Problem (1997) (1)
- On the Planar Split Thickness of Graphs (2017) (1)
- 1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (2022) (1)
- Collineations of Projective Planes of Order 10, Part II (1979) (1)
- On the Complexity of the Linkage Recon guration Problem (1)
- Grid Proximity Graphs: LOGs, GIGs and GIRLs (2013) (1)
- Combinatorial Properties and Recognition of Unit Square Visibility Graphs (2017) (1)
- Sliding Local Planners for Sampling-Based Path Planning (2017) (1)
- Graph Drawing (1999) (0)
- Simultaneous Dominance Representationof Multiple (1996) (0)
- The Shape of Orthogonal Cycles in Three Dimensions (2011) (0)
- Monotone Simultaneous Paths Embeddings in ℝd (2016) (0)
- IBM Research Report Connectivity Graphs of Uncertain Regions (2010) (0)
- A Note on Drawing Direction-constrained Paths in 3D (2007) (0)
- Guest Editors' Foreword (2000) (0)
- Msn-support Help (2001) (0)
- C G ] 2 9 Se p 20 00 On Reconfiguring Tree Linkages : Trees can Lock (2019) (0)
- Recent Results on 3 D Visibility Representation of GraphsSue Whitesides (2007) (0)
- Constrained Light Deployment for Reducing Energy Consumption in Buildings (2016) (0)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (2016) (0)
- Abstract Milling with Turn Costs (2009) (0)
- The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs (2022) (0)
- Monotone Simultaneous Embeddings of Paths in R^d (2016) (0)
- 05191 Open Problem Session Report (2005) (0)
- Intractability in Graph Drawing and Geometry: FPT Approaches (2009) (0)
- On the Complexity of the Linkage Recon(cid:12)guration Problem (cid:3) (2003) (0)
- The Rectangle of Influence Drawabillty Problem 6 (0)
- The Rectangle of Innuence Drawability Problem the Rectangle of Innuence Drawability Problem (1996) (0)
- Poster Gallery Report (1994) (0)
- Reconfiguring a Chain of Cubes (2015) (0)
- C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
- On Three-Dimensional Graph Drawing and Embedding (2012) (0)
- SERIE B INFORMATIK Universal Dimensional Visibility Representations for Graphs (2009) (0)
- Proceedings of the Third Workshop on Algorithms and Data Structures (1989) (0)
- Collaborative problem solving: integrating theory and practice in the classroom (2010) (0)
- C G ] 11 N ov 1 99 8 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
This paper list is powered by the following services:
Other Resources About Sue Whitesides
What Schools Are Affiliated With Sue Whitesides?
Sue Whitesides is affiliated with the following schools:
