Sue Whitesides

Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides: Indexing Reverse Top-k Queries in Two Dimensions. DASFAA (1) 2013: 201-208

Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: The Shape of Orthogonal Cycles in Three Dimensions. Discrete & Computational Geometry 47(3): 461-491 (2012)

Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman: Acyclic colorings of graph subdivisions revisited. J. Discrete Algorithms 16: 90-103 (2012)

Dimitri Marinakis, Kui Wu, Ning Ye, Sue Whitesides: Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks. IEEE Transactions on Wireless Communications 11(8): 2786-2795 (2012)

David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides: On Representing Graphs by Touching Cuboids. Graph Drawing 2012: 187-198

Zahed Rahmati, Sue Whitesides, Valerie King: Kinetic and Stationary Point-Set Embeddability for Plane Graphs. Graph Drawing 2012: 279-290

Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides: Acyclic Coloring with Few Division Vertices. IWOCA 2012: 86-99

Sue Whitesides: On Three-Dimensional Graph Drawing and Embedding. WALCOM 2012: 3-4

Tamal K. Dey, Sue Whitesides (Eds.): Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012. ACM 2012, isbn 978-1-4503-1299-8

Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides: Indexing Reverse Top-k Queries. CoRR abs/1205.0837 (2012)

Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides: Computing optimal k-regret minimizing sets with top-k depth contours. CoRR abs/1207.6329 (2012)

Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi: Sampled medial loci for 3D shape representation. Computer Vision and Image Understanding 115(5): 695-706 (2011)

Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides: A Note on Minimum-Segment Drawings of Planar Graphs. CCCG 2011

Svetlana Stolpner, Kaleem Siddiqi, Sue Whitesides: Approximating the Medial Axis by Shooting Rays: 3D Case. CCCG 2011

Neil MacMillan, River Allen, Dimitri Marinakis, Sue Whitesides: Range-based Navigation System for a Mobile Robot. CRV 2011: 16-23

Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides: Indexing for Vector Projections. DASFAA (2) 2011: 367-376

Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides: Embedding Plane 3-Trees in ℝ2 and ℝ3. Graph Drawing 2011: 39-51

Dimitri Marinakis, Neil MacMillan, River Allen, Sue Whitesides: Simultaneous localization and environmental mapping with a sensor network. ICRA 2011: 5881-5886

Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman: Acyclic Colorings of Graph Subdivisions. IWOCA 2011: 247-260

Dimitri Marinakis, Kui Wu, Sue Whitesides: Stochastic Scheduling for Underwater Sensor Networks. Networking (1) 2011: 134-146

Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194

Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011)

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang: A Succinct 3D Visibility Skeleton. Discrete Math., Alg. and Appl. 2(4): 567-590 (2010)

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang: On the Computation of 3D Visibility Skeletons. COCOON 2010: 469-478

Dimitri Marinakis, Sue Whitesides: The Sentinel Problem for a Multi-hop Sensor Network. CRV 2010: 253-260

Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445

Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu: Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134

Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)

Maxime Boucher, Sue Whitesides, Alan C. Evans: Depth potential function for folding pattern representation, registration and analysis. Medical Image Analysis 13(2): 203-214 (2009)

Svetlana Stolpner, Sue Whitesides: Medial Axis Approximation with Bounded Error. ISVD 2009: 171-180

Sue Whitesides: Intractability in Graph Drawing and Geometry: FPT Approaches. IWOCA 2009: 20-23

Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu: Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009)

Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)

Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)

Panos Giannopoulos, Christian Knauer, Sue Whitesides: Parameterized Complexity of Geometric Problems. Comput. J. 51(3): 372-384 (2008)

Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides: Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008)

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides: On the Size of the 3D Visibility Skeleton: Experimental Results. ESA 2008: 805-816

Francesco Giordano, Giuseppe Liotta, Sue Whitesides: Embeddability Problems for Upward Planar Digraphs. Graph Drawing 2008: 242-253

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geometry Appl. 17(4): 297-304 (2007)

Malvika Rao, Gregory Dudek, Sue Whitesides: Randomized Algorithms for Minimum Distance Localization. I. J. Robotic Res. 26(9): 917-933 (2007)

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007)

Ethan Kim, Sue Whitesides, Giuseppe Liotta: A Note on Drawing Direction-constrained Paths in 3D. CCCG 2007: 193-196

Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu: On Bus Graph Realizability. CCCG 2007: 229-232

Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides: Towards an implementation of the 3D visibility skeleton. Symposium on Computational Geometry 2007: 131-132

Maxime Boucher, Sue Whitesides, Oliver Lyttleton, Alan C. Evans: A Discrete Differential Operator for Direction-based Surface Morphometry. ICCV 2007: 1-8

Gary Haggard, John S. Schlipf, Sue Whitesides: Discrete mathematics for computer science. Thomson Brooks/Cole 2006, isbn 978-0-534-49501-5, pp. I-XXXIII, 1-600

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)

Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006)

Rafa Absar, Sue Whitesides: On Computing Shortest External Watchman Routes for Convex Polygons. CCCG 2006

Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu: On Bus Graph Realizability. CoRR abs/cs/0609127 (2006)

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to Line Segments in Three-Dimensional Space. Discrete & Computational Geometry 34(3): 381-390 (2005)

Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating Point Sets in Polygonal Environments. Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005)

Matthew Suderman, Sue Whitesides: Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. J. Graph Algorithms Appl. 9(1): 149-163 (2005)

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305

Sue Whitesides: 05191 Open Problem Session Report. Graph Drawing 2005

Malvika Rao, Gregory Dudek, Sue Whitesides: Minimum Distance Localization for a Robot with Limited Visibility. ICRA 2005: 2438-2445

Vida Dujmovic, Sue Whitesides: An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica 40(1): 15-31 (2004)

Steven Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides: Tuning and comparing spatial normalization methods. Medical Image Analysis 8(3): 311-323 (2004)

Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: The number of lines tangent to arbitrary convex polyhedra in 3D. Symposium on Computational Geometry 2004: 46-55

Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322

Matthew Kitching, Sue Whitesides: The Three Dimensional Logic Engine. Graph Drawing 2004: 329-339

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: Transversals to line segments in R³. CCCG 2003: 174-177

Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides: The complexity of (un)folding. Symposium on Computational Geometry 2003: 164-170

Matthew Suderman, Sue Whitesides: Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. Graph Drawing 2003: 345-356

Steven Robbins, Sue Whitesides: On the Reliability of Triangle Intersection in 3D. ICCSA (3) 2003: 923-930

Steven Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides: Tuning and Comparing Spatial Normalization Methods. MICCAI (2) 2003: 910-917

Neal Lesh, Michael Mitzenmacher, Sue Whitesides: A complete and effective move set for simplified protein folding. RECOMB 2003: 188-195

Ileana Streinu, Sue Whitesides: Rectangle Visibility Graphs: Characterization, Construction, and Compaction. STACS 2003: 26-37

Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides: The number of transversals to line segments in R^3. CoRR math.MG/0306401 (2003)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: A note on reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics 117(1-3): 293-297 (2002)

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002)

Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002)

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117

Vida Dujmovic, Sue Whitesides: An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Graph Drawing 2002: 118-129

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete & Computational Geometry 26(3): 269-281 (2001)

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15

Sue Whitesides: Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. ISAAC 2001: 1-13

Vida Dujmovic, Sue Whitesides: On validating planar worlds. SODA 2001: 791-792

Peter Eades, Antonios Symvonis, Sue Whitesides: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3): 55-87 (2000)

Giuseppe Liotta, Sue Whitesides: Guest Editors' Foreword. J. Graph Algorithms Appl. 4(3): 1-3 (2000)

Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73

Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Graph Drawing 2000: 272-283

Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3(4): 63-79 (1999)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999)

Helmut Alt, Michael Godau, Sue Whitesides: Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9(1-2): 111-125 (1998)

Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998)

Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides: The largest k-ball in a d-dimensional box. Comput. Geom. 11(2): 59-67 (1998)

Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle: A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(2) (1998)

Gregory Dudek, Kathleen Romanik, Sue Whitesides: Localizing a Robot with Minimum Travel. SIAM J. Comput. 27(2): 583-604 (1998)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On reconfiguring tree linkages: Trees can lock. CCCG 1998

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides: Unfolding some classes of orthogonal polyhedra. CCCG 1998

Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides: Convexifying star-shaped polygons. CCCG 1998

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Symposium on Computational Geometry 1998: 392-401

Therese C. Biedl, Joe Marks, Kathy Ryall, Sue Whitesides: Graph Multidrawing: Finding Nice Drawings Without Defining Nice. Graph Drawing 1998: 347-355

Sue Whitesides (Ed.): Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings. Lecture Notes in Computer Science 1547, Springer 1998, isbn 3-540-65473-9

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998)

Naixun Pei, Sue Whitesides: On folding rulers in regular polygons. CCCG 1997

Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Orthogonal 3-D Graph Drawing. Graph Drawing 1997: 76-86

Sándor P. Fekete, Michael E. Houle, Sue Whitesides: The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. Graph Drawing 1997: 272-283

Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996)

Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers Inside Triangles. Discrete & Computational Geometry 15(3): 265-285 (1996)

Peter Eades, Charles Stirk, Sue Whitesides: The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. 60(2): 97-103 (1996)

Peter Eades, Sue Whitesides: The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996)

Naixun Pei, Sue Whitesides: On the Reachable Regions of Chains. CCCG 1996: 161-166

Sue Whitesides, Naixun Pei: On the Reconfiguration of Chains (Extended Abstract). COCOON 1996: 381-390

Peter Eades, Antonios Symvonis, Sue Whitesides: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. Graph Drawing 1996: 139-154

William Lenhart, Sue Whitesides: Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discrete & Computational Geometry 13: 123-140 (1995)

Helmut Alt, Michael Godau, Sue Whitesides: Universal 3-Dimensional Visibility Representations for Graphs. Graph Drawing 1995: 8-19

Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides: The Strength of Weak Proximity. Graph Drawing 1995: 178-189

Sándor P. Fekete, Michael E. Houle, Sue Whitesides: New Results on a Visibility Representation of Graphs in 3D. Graph Drawing 1995: 234-241

Peter Eades, Sue Whitesides: Nearest Neighbour Graph Realizability is NP-hard. LATIN 1995: 245-256

Gregory Dudek, Kathleen Romanik, Sue Whitesides: Localizing a Robot with Minimum Travel. SODA 1995: 437-446

Peter Eades, Sue Whitesides: Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994)

Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Symposium on Computational Geometry 1994: 49-56

Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: Recognizing Rectangle of Influence Drawable Graphs. Graph Drawing 1994: 352-363

Sue Whitesides: Poster Gallery Report. Graph Drawing 1994: 461-469

S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides: Grid intersection graphs and boxicity. Discrete Mathematics 114(1-3): 41-49 (1993)

Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers inside Triangles. CCCG 1993: 1-6

Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides: Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191

Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides (Eds.): Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Lecture Notes in Computer Science 709, Springer 1993, isbn 3-540-57155-8

Sue Whitesides: Algorithmic Issues in the Geometry of Planar Linkage Movement. Australian Computer Journal 24(2): 42-50 (1992)

Sue Whitesides, Rongyao Zhao: Algorithmic and Complexity Results for Drawing Euclidian Trees. Advanced Visual Interfaces 1992: 395-408

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988)

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10

John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. 14(2): 315-333 (1985)

John E. Hopcroft, Deborah Joseph, Sue Whitesides: Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13(3): 610-629 (1984)

Sue Whitesides: Edge-colored complete graphs with alternating cycles. Discrete Mathematics 46(3): 299-304 (1983)

Sue Whitesides: A classification of certain graphs with minimal imperfection properties. Discrete Mathematics 38(2-3): 303-310 (1982)

John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions. FOCS 1982: 280-289

Sue Whitesides: An Algorithm for Finding Clique Cut-Sets. Inf. Process. Lett. 12(1): 31-32 (1981)

Sue Whitesides: Collineations of Projective Planes of Order 10, Part I. J. Comb. Theory, Ser. A 26(3): 249-268 (1979)

Sue Whitesides: Collineations of Projective Planes of Order 10, Part II. J. Comb. Theory, Ser. A 26(3): 269-277 (1979)