Combinatorial designs related to the strong perfect graph conjecture. - Vasek Chvátal; Ronald L. Graham; André F. Perold; Sue Whitesides (Discret. Math., 1979)

Collineations of Projective Planes of Order 10, Part I. - Sue Whitesides (J. Comb. Theory A, 1979)

Collineations of Projective Planes of Order 10, Part II. - Sue Whitesides (J. Comb. Theory A, 1979)

An Algorithm for Finding Clique Cut-Sets. - Sue Whitesides (Inf. Process. Lett., 1981)

A classification of certain graphs with minimal imperfection properties. - Sue Whitesides (Discret. Math., 1982)

Edge-colored complete graphs with alternating cycles. - Sue Whitesides (Discret. Math., 1983)

Movement Problems for 2-Dimensional Linkages. - John E. Hopcroft; Deborah Joseph; Sue Whitesides (SIAM J. Comput., 1984)

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

Computing the Link Center of a Simple Polygon. - William J. Lenhart; Richard Pollack; Jörg-Rüdiger Sack; Raimund Seidel; Micha Sharir; Subhash Suri; Godfried T. Toussaint; Sue Whitesides; Chee-Keng Yap (Discret. Comput. Geom., 1988)

Algorithmic and Complexity Results for Drawing Euclidian Trees. - Sue Whitesides; Rongyao Zhao (Advanced Visual Interfaces, 1992)

Algorithmic Issues in the Geometry of Planar Linkage Movement. - Sue Whitesides (Aust. Comput. J., 1992)

Dominance Drawings of Bipartite Graphs. - Hossam A. ElGindy; Michael E. Houle; William J. Lenhart; Mirka Miller; David Rappaport; Sue Whitesides (CCCG, 1993)

Grid intersection graphs and boxicity. - S. Bellantoni; Irith Ben-Arroyo Hartman; Teresa M. Przytycka; Sue Whitesides (Discret. Math., 1993)

The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. - Peter Eades; Sue Whitesides (SCG, 1994)

Recognizing Rectangle of Influence Drawable Graphs. - Hossam A. ElGindy; Giuseppe Liotta; Anna Lubiw; Henk Meijer; Sue Whitesides (GD, 1994)

Poster Gallery Report. - Sue Whitesides (GD, 1994)

Drawing Graphs in Two Layers. - Peter Eades; Sue Whitesides (Theor. Comput. Sci., 1994)

New Results on a Visibility Representation of Graphs in 3D. - Sándor P. Fekete; Michael E. Houle; Sue Whitesides (GD, 1995)

Nearest Neighbour Graph Realizability is NP-hard. - Peter Eades; Sue Whitesides (LATIN, 1995)

Reconfigurating Closed Polygonal Chains in Euclidean d-Space. - William J. Lenhart; Sue Whitesides (Discret. Comput. Geom., 1995)

On the Reachable Regions of Chains. - Naixun Pei; Sue Whitesides (CCCG, 1996)

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

Two Algorithms for Three Dimensional Orthogonal Graph Drawing. - Peter Eades; Antonios Symvonis; Sue Whitesides (GD, 1996)

The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. - Peter Eades; Sue Whitesides (Algorithmica, 1996)

Folding Rulers Inside Triangles. - Marc J. van Kreveld; Jack Snoeyink; Sue Whitesides (Discret. Comput. Geom., 1996)

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

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

On folding rulers in regular polygons. - Naixun Pei; Sue Whitesides (CCCG, 1997)

Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (GD, 1997)

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

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

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

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

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). - Pankaj K. Agarwal; Therese Biedl; Sylvain Lazard; Steve Robbins; Subhash Suri; Sue Whitesides (SCG, 1998)

Graph Multidrawing: Finding Nice Drawings Without Defining Nice. - Therese Biedl; Joe Marks; Kathy Ryall; Sue Whitesides (GD, 1998)

Universal 3-dimensional visibility representations for graphs. - Helmut Alt; Michael Godau; Sue Whitesides (Comput. Geom., 1998)

The largest k-ball in a d-dimensional box. - Hazel Everett; Ivan Stojmenovic; Pavel Valtr 001; Sue Whitesides (Comput. Geom., 1998)

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

A Visibility Representation for Graphs in Three Dimensions. - 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 (J. Graph Algorithms Appl., 1998)

Localizing a Robot with Minimum Travel. - Gregory Dudek; Kathleen Romanik; Sue Whitesides (SIAM J. Comput., 1998)

Locked and Unlocked Polygonal Chains in 3D. - Therese 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 (SODA, 1999)

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

Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). - Giuseppe Di Battista; Giuseppe Liotta; Anna Lubiw; Sue Whitesides (GD, 2000)

Three-dimensional orthogonal graph drawing algorithms. - Peter Eades; Antonios Symvonis; Sue Whitesides (Discret. Appl. Math., 2000)

Guest Editors' Foreword. - Giuseppe Liotta; Sue Whitesides (J. Graph Algorithms Appl., 2000)

On the Parameterized Complexity of Layered Graph Drawing. - 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 (ESA, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - 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 (GD, 2001)

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

On validating planar worlds. - Vida Dujmovic; Sue Whitesides (SODA, 2001)

Locked and Unlocked Polygonal Chains in Three Dimensions. - Therese 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 (Discret. Comput. Geom., 2001)

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

A note on reconfiguring tree linkages: trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Appl. Math., 2002)

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

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

Transversals to line segments in R3. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CCCG, 2003)

The complexity of (un)folding. - Helmut Alt; Christian Knauer; Günter Rote; Sue Whitesides (SCG, 2003)

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

A complete and effective move set for simplified protein folding. - Neal Lesh; Michael Mitzenmacher; Sue Whitesides (RECOMB, 2003)

Rectangle Visibility Graphs: Characterization, Construction, and Compaction. - Ileana Streinu; Sue Whitesides (STACS, 2003)

The number of transversals to line segments in R^3 - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CoRR, 2003)

The number of lines tangent to arbitrary convex polyhedra in 3D. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (SCG, 2004)

The Three Dimensional Logic Engine. - Matthew Kitching; Sue Whitesides (GD, 2004)

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

Tuning and comparing spatial normalization methods. - Steven M. Robbins; Alan C. Evans; D. Louis Collins; Sue Whitesides (Medical Image Anal., 2004)

05191 Open Problem Session Report. - Sue Whitesides (Graph Drawing, 2005)

Minimum Distance Localization for a Robot with Limited Visibility. - Malvika Rao; Gregory Dudek; Sue Whitesides (ICRA, 2005)

Transversals to Line Segments in Three-Dimensional Space. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (Discret. Comput. Geom., 2005)

Separating Point Sets in Polygonal Environments. - Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Mark H. Overmars; Sue Whitesides (Int. J. Comput. Geom. Appl., 2005)

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

Discrete mathematics for computer science. - Gary Haggard; John S. Schlipf; Sue Whitesides (Thomson Brooks/Cole, 2006)

On Computing Shortest External Watchman Routes for Convex Polygons. - Rafa Absar; Sue Whitesides (CCCG, 2006)

A Fixed-Parameter Approach to 2-Layer Planarization. - 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 (Algorithmica, 2006)

The strength of weak proximity. - Giuseppe Di Battista; Giuseppe Liotta; Sue Whitesides (J. Discrete Algorithms, 2006)

On Bus Graph Realizability. - 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 (CCCG, 2007)

A Note on Drawing Direction-constrained Paths in 3D. - Ethan Kim; Sue Whitesides; Giuseppe Liotta (CCCG, 2007)

Towards an implementation of the 3D visibility skeleton. - Linqiao Zhang; Hazel Everett; Sylvain Lazard; Sue Whitesides (SCG, 2007)

A Discrete Differential Operator for Direction-based Surface Morphometry. - Maxime Boucher; Sue Whitesides; Oliver Lyttleton; Alan C. Evans (ICCV, 2007)

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

Randomized Algorithms for Minimum Distance Localization. - Malvika Rao; Gregory Dudek; Sue Whitesides (Int. J. Robotics Res., 2007)

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

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

Embeddability Problems for Upward Planar Digraphs. - Francesco Giordano; Giuseppe Liotta; Sue Whitesides (GD, 2008)

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

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

Parameterized Complexity of Geometric Problems. - Panos Giannopoulos; Christian Knauer; Sue Whitesides (Comput. J., 2008)

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

Sampled medial loci and boundary differential geometry. - Svetlana Stolpner; Sue Whitesides; Kaleem Siddiqi (ICCV Workshops, 2009)

Medial Axis Approximation with Bounded Error. - Svetlana Stolpner; Sue Whitesides (ISVD, 2009)

Intractability in Graph Drawing and Geometry: FPT Approaches. - Sue Whitesides (IWOCA, 2009)

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

Depth potential function for folding pattern representation, registration and analysis. - Maxime Boucher; Sue Whitesides; Alan C. Evans (Medical Image Anal., 2009)

On the Computation of 3D Visibility Skeletons. - Sylvain Lazard; Christophe Weibel; Sue Whitesides; Linqiao Zhang (COCOON, 2010)

The Sentinel Problem for a Multi-hop Sensor Network. - Dimitri Marinakis; Sue Whitesides (CRV, 2010)

Collaborative problem solving: integrating theory and practice in the classroom. - Mantis Cheng; Erin Delisle; Alejandro Erickson; Sudhakar Ganti; Fieran Mason; Nicholas Vining; Sue Whitesides (WCCCE, 2010)

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

A Succinct 3D Visibility Skeleton. - Sylvain Lazard; Christophe Weibel; Sue Whitesides; Linqiao Zhang (Discret. Math. Algorithms Appl., 2010)

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

Range-based Navigation System for a Mobile Robot. - Neil MacMillan; River Allen; Dimitri Marinakis; Sue Whitesides (CRV, 2011)

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

Embedding Plane 3-Trees in ℝ2 and ℝ3. - Stephane Durocher; Debajyoti Mondal; Rahnuma Islam Nishat; Md. Saidur Rahman 001; Sue Whitesides (GD, 2011)

Simultaneous localization and environmental mapping with a sensor network. - Dimitri Marinakis; Neil MacMillan; River Allen; Sue Whitesides (ICRA, 2011)

Acyclic Colorings of Graph Subdivisions. - Debajyoti Mondal; Rahnuma Islam Nishat; Sue Whitesides; Md. Saidur Rahman 001 (IWOCA, 2011)

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

Sampled medial loci for 3D shape representation. - Svetlana Stolpner; Sue Whitesides; Kaleem Siddiqi (Comput. Vis. Image Underst., 2011)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Kinetic and Stationary Point-Set Embeddability for Plane Graphs. - Zahed Rahmati; Sue Whitesides; Valerie King (GD, 2012)

On Three-Dimensional Graph Drawing and Embedding. - Sue Whitesides (WALCOM, 2012)

Indexing Reverse Top-k Queries - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (CoRR, 2012)

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

The Shape of Orthogonal Cycles in Three Dimensions. - Giuseppe Di Battista; Ethan Kim; Giuseppe Liotta; Anna Lubiw; Sue Whitesides (Discret. Comput. Geom., 2012)

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

Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks. - Dimitri Marinakis; Kui Wu 001; Ning Ye; Sue Whitesides (IEEE Trans. Wirel. Commun., 2012)

Grid Proximity Graphs: LOGs, GIGs and GIRLs. - River Allen; Laurie J. Heyer; Rahnuma Islam Nishat; Sue Whitesides (CCCG, 2013)

Map Folding. - Rahnuma Islam Nishat; Sue Whitesides (CCCG, 2013)

Kinetic Data Structures on The Move. - Sue Whitesides (CCCG, 2013)

Kinetic data structures for all nearest neighbors and closest pair in the plane. - Zahed Rahmati; Valerie King; Sue Whitesides (SoCG, 2013)

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

Acyclic coloring with few division vertices. - Debajyoti Mondal; Rahnuma Islam Nishat; Md. Saidur Rahman 001; Sue Whitesides (J. Discrete Algorithms, 2013)

A Note on Minimum-Segment Drawings of Planar Graphs. - Stephane Durocher; Debajyoti Mondal; Rahnuma Islam Nishat; Sue Whitesides (J. Graph Algorithms Appl., 2013)

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. - Zahed Rahmati; Mohammad Ali Abam; Valerie King; Sue Whitesides (CCCG, 2014)

The Range Beacon Placement Problem for Robot Navigation. - River Allen; Neil MacMillan; Dimitri Marinakis; Rahnuma Islam Nishat; Rayhan Rahman; Sue Whitesides (CRV, 2014)

Kinetic Reverse k-Nearest Neighbor Problem. - Zahed Rahmati; Valerie King; Sue Whitesides (IWOCA, 2014)

(Reverse) k-nearest neighbors for moving objects. - Zahed Rahmati; Valerie King; Sue Whitesides (MIG, 2014)

Kinetic $k$-Semi-Yao Graph and its Applications. - Zahed Rahmati; Mohammad Ali Abam; Valerie King; Sue Whitesides (CoRR, 2014)

Computing k-Regret Minimizing Sets. - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (Proc. VLDB Endow., 2014)

Reconfiguring a Chain of Cubes. - Laurie J. Heyer; Anna Lubiw; Debajyoti Mondal; Ulrike Stege; Sue Whitesides (CCCG, 2015)

Open Problems from CCCG 2014. - Sue Whitesides (CCCG, 2015)

A simple, faster method for kinetic proximity problems. - Zahed Rahmati; Mohammad Ali Abam; Valerie King; Sue Whitesides; Alireza Zarei (Comput. Geom., 2015)

Computing upward topological book embeddings of upward planar digraphs. - Francesco Giordano; Giuseppe Liotta; Tamara Mchedlidze; Antonios Symvonis; Sue Whitesides (J. Discrete Algorithms, 2015)

Constrained Light Deployment for Reducing Energy Consumption in Buildings. - Huamei Tian; Kui Wu 001; Sue Whitesides; Cuiying Feng (COCOA, 2016)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

Bend Complexity and Hamiltonian Cycles in Grid Graphs. - Rahnuma Islam Nishat; Sue Whitesides (COCOON, 2017)

Sliding Local Planners for Sampling-Based Path Planning. - S. M. Rayhan Rahman; Sue Whitesides (IRC, 2017)

Connectivity Graphs of Uncertainty Regions. - Erin W. Chambers; Alejandro Erickson; Sándor P. Fekete; Jonathan Lenchner; Jeff Sember; S. Venkatesh 001; Ulrike Stege; Svetlana Stolpner; Christophe Weibel; Sue Whitesides (Algorithmica, 2017)

On the Planar Split Thickness of Graphs. - David Eppstein; Philipp Kindermann; Stephen G. Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen K. Wismath (Algorithmica, 2018)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

Connecting a set of circles with minimum sum of radii. - Erin W. Chambers; Sándor P. Fekete; Hella-Franziska Hoffmann; Dimitri Marinakis; Joseph S. B. Mitchell; Srinivasan Venkatesh 001; Ulrike Stege; Sue Whitesides (Comput. Geom., 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. - Rahnuma Islam Nishat; Sue Whitesides (WG, 2019)

Kinetic k-Semi-Yao graph and its applications. - Zahed Rahmati; Mohammad Ali Abam; Valerie King; Sue Whitesides (Comput. Geom., 2019)

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. - Rahnuma Islam Nishat; Srinivasan Venkatesh 001; Sue Whitesides (IWOCA, 2021)

1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (WALCOM, 2022)

Closed space-filling curves with controlled orientation for 3D printing. - A. Bedel; Yoann Coudert-Osmont; Jonàs Martínez; Rahnuma Islam Nishat; Sue Whitesides; Sylvain Lefebvre 001 (Comput. Graph. Forum, 2022)

1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (J. Graph Algorithms Appl., 2023)

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. - Katrin Casel; Henning Fernau; Alexander Grigoriev; Markus L. Schmid; Sue Whitesides (Discret. Comput. Geom., 2023)

Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs. - Rahnuma Islam Nishat; Sue Whitesides (Int. J. Found. Comput. Sci., 2023)

On 3-layered Cornerhedra: Optimum Box Partitions for Niches. - Ulrike Stege; Sue Whitesides; Laurie J. Heyer; William J. Lenhart (CCCG, 2024)

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (J. Comb. Optim., 2024)