| 2008 |
|---|
| 101 | EE | Linqiao Zhang,
Hazel Everett,
Sylvain Lazard,
Christophe Weibel,
Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results.
ESA 2008: 805-816 |
| 100 | EE | Francesco Giordano,
Giuseppe Liotta,
Sue Whitesides:
Embeddability Problems for Upward Planar Digraphs.
Graph Drawing 2008: 242-253 |
| 99 | EE | 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) |
| 98 | EE | 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) |
| 97 | EE | Panos Giannopoulos,
Christian Knauer,
Sue Whitesides:
Parameterized Complexity of Geometric Problems.
Comput. J. 51(3): 372-384 (2008) |
| 96 | EE | 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) |
| 2007 |
|---|
| 95 | | Ethan Kim,
Sue Whitesides,
Giuseppe Liotta:
A Note on Drawing Direction-constrained Paths in 3D.
CCCG 2007: 193-196 |
| 94 | | Anil Ada,
Melanie Coggan,
Paul Di Marco,
Alain Doyon,
Liam Flookes,
Samuli Heilala,
Ethan Kim,
Jonathan Li On Wing,
Louis-Francois Preville-Ratelle,
Sue Whitesides,
Nuo Yu:
On Bus Graph Realizability.
CCCG 2007: 229-232 |
| 93 | EE | Maxime Boucher,
Sue Whitesides,
Oliver Lyttleton,
Alan C. Evans:
A Discrete Differential Operator for Direction-based Surface Morphometry.
ICCV 2007: 1-8 |
| 92 | EE | Linqiao Zhang,
Hazel Everett,
Sylvain Lazard,
Sue Whitesides:
Towards an implementation of the 3D visibility skeleton.
Symposium on Computational Geometry 2007: 131-132 |
| 91 | EE | 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) |
| 90 | EE | 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) |
| 2006 |
|---|
| 89 | EE | Rafa Absar,
Sue Whitesides:
On Computing Shortest External Watchman Routes for Convex Polygons.
CCCG 2006 |
| 88 | EE | 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) |
| 87 | EE | Anil Ada,
Melanie Coggan,
Paul Di Marco,
Alain Doyon,
Liam Flookes,
Samuli Heilala,
Ethan Kim,
Jonathan Li On Wing,
Louis-Francois Preville-Ratelle,
Sue Whitesides,
Nuo Yu:
On Bus Graph Realizability
CoRR abs/cs/0609127: (2006) |
| 86 | EE | Giuseppe Di Battista,
Giuseppe Liotta,
Sue Whitesides:
The strength of weak proximity.
J. Discrete Algorithms 4(3): 384-400 (2006) |
| 2005 |
|---|
| 85 | EE | 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 |
| 84 | EE | Sue Whitesides:
05191 Open Problem Session Report.
Graph Drawing 2005 |
| 83 | | Malvika Rao,
Gregory Dudek,
Sue Whitesides:
Minimum Distance Localization for a Robot with Limited Visibility.
ICRA 2005: 2438-2445 |
| 82 | EE | 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) |
| 81 | EE | 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) |
| 80 | EE | Matthew Suderman,
Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization.
J. Graph Algorithms Appl. 9(1): 149-163 (2005) |
| 2004 |
|---|
| 79 | EE | 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 |
| 78 | EE | Matthew Kitching,
Sue Whitesides:
The Three Dimensional Logic Engine.
Graph Drawing 2004: 329-339 |
| 77 | EE | 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 |
| 76 | EE | 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 |
| 75 | EE | Vida Dujmovic,
Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
Algorithmica 40(1): 15-31 (2004) |
| 2003 |
|---|
| 74 | | Hervé Brönnimann,
Hazel Everett,
Sylvain Lazard,
Frank Sottile,
Sue Whitesides:
Transversals to line segments in R3.
CCCG 2003: 174-177 |
| 73 | EE | Matthew Suderman,
Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization.
Graph Drawing 2003: 345-356 |
| 72 | EE | Steven Robbins,
Sue Whitesides:
On the Reliability of Triangle Intersection in 3D.
ICCSA (3) 2003: 923-930 |
| 71 | EE | Steven Robbins,
Alan C. Evans,
D. Louis Collins,
Sue Whitesides:
Tuning and Comparing Spatial Normalization Methods.
MICCAI (2) 2003: 910-917 |
| 70 | EE | Neal Lesh,
Michael Mitzenmacher,
Sue Whitesides:
A complete and effective move set for simplified protein folding.
RECOMB 2003: 188-195 |
| 69 | EE | Ileana Streinu,
Sue Whitesides:
Rectangle Visibility Graphs: Characterization, Construction, and Compaction.
STACS 2003: 26-37 |
| 68 | EE | Helmut Alt,
Christian Knauer,
Günter Rote,
Sue Whitesides:
The complexity of (un)folding.
Symposium on Computational Geometry 2003: 164-170 |
| 67 | EE | 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) |
| 2002 |
|---|
| 66 | EE | 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 |
| 65 | EE | Vida Dujmovic,
Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
Graph Drawing 2002: 118-129 |
| 64 | | 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) |
| 63 | EE | 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) |
| 62 | | 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) |
| 2001 |
|---|
| 61 | EE | 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 |
| 60 | EE | 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 |
| 59 | EE | Sue Whitesides:
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages.
ISAAC 2001: 1-13 |
| 58 | EE | Vida Dujmovic,
Sue Whitesides:
On validating planar worlds.
SODA 2001: 791-792 |
| 57 | EE | 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) |
| 2000 |
|---|
| 56 | EE | Giuseppe Di Battista,
Giuseppe Liotta,
Anna Lubiw,
Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges.
COCOON 2000: 64-73 |
| 55 | EE | Giuseppe Di Battista,
Giuseppe Liotta,
Anna Lubiw,
Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract).
Graph Drawing 2000: 272-283 |
| 54 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms.
Discrete Applied Mathematics 103(1-3): 55-87 (2000) |
| 53 | EE | Giuseppe Liotta,
Sue Whitesides:
Guest Editors' Foreword.
J. Graph Algorithms Appl. 4(3): 1-3 (2000) |
| 1999 |
|---|
| 52 | EE | 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 |
| 51 | EE | 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) |
| 50 | EE | 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) |
| 49 | EE | 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) |
| 1998 |
|---|
| 48 | | Sue Whitesides:
Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings
Springer 1998 |
| 47 | EE | Hazel Everett,
Sylvain Lazard,
Steven M. Robbins,
H. Schröder,
Sue Whitesides:
Convexifying star-shaped polygons.
CCCG 1998 |
| 46 | EE | 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 |
| 45 | EE | 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 |
| 44 | EE | Therese C. Biedl,
Joe Marks,
Kathy Ryall,
Sue Whitesides:
Graph Multidrawing: Finding Nice Drawings Without Defining Nice.
Graph Drawing 1998: 347-355 |
| 43 | EE | 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 |
| 42 | EE | 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) |
| 41 | | Giuseppe Liotta,
Anna Lubiw,
Henk Meijer,
Sue Whitesides:
The rectangle of influence drawability problem.
Comput. Geom. 10(1): 1-22 (1998) |
| 40 | | Hazel Everett,
Ivan Stojmenovic,
Pavel Valtr,
Sue Whitesides:
The largest k-ball in a d-dimensional box.
Comput. Geom. 11(2): 59-67 (1998) |
| 39 | | Helmut Alt,
Michael Godau,
Sue Whitesides:
Universal 3-dimensional visibility representations for graphs.
Comput. Geom. 9(1-2): 111-125 (1998) |
| 38 | EE | 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) |
| 37 | | Gregory Dudek,
Kathleen Romanik,
Sue Whitesides:
Localizing a Robot with Minimum Travel.
SIAM J. Comput. 27(2): 583-604 (1998) |
| 1997 |
|---|
| 36 | | Naixun Pei,
Sue Whitesides:
On folding rulers in regular polygons.
CCCG 1997 |
| 35 | | 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 |
| 34 | | Therese C. Biedl,
Thomas C. Shermer,
Sue Whitesides,
Stephen K. Wismath:
Orthogonal 3-D Graph Drawing.
Graph Drawing 1997: 76-86 |
| 1996 |
|---|
| 33 | | Naixun Pei,
Sue Whitesides:
On the Reachable Regions of Chains.
CCCG 1996: 161-166 |
| 32 | | Sue Whitesides,
Naixun Pei:
On the Reconfiguration of Chains (Extended Abstract).
COCOON 1996: 381-390 |
| 31 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing.
Graph Drawing 1996: 139-154 |
| 30 | | Peter Eades,
Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.
Algorithmica 16(1): 60-82 (1996) |
| 29 | EE | Marc J. van Kreveld,
Jack Snoeyink,
Sue Whitesides:
Folding Rulers Inside Triangles.
Discrete & Computational Geometry 15(3): 265-285 (1996) |
| 28 | EE | 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) |
| 27 | EE | Peter Eades,
Sue Whitesides:
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs.
Theor. Comput. Sci. 169(1): 23-37 (1996) |
| 1995 |
|---|
| 26 | | Giuseppe Di Battista,
Giuseppe Liotta,
Sue Whitesides:
The Strength of Weak Proximity.
Graph Drawing 1995: 178-189 |
| 25 | | Sándor P. Fekete,
Michael E. Houle,
Sue Whitesides:
New Results on a Visibility Representation of Graphs in 3D.
Graph Drawing 1995: 234-241 |
| 24 | | Helmut Alt,
Michael Godau,
Sue Whitesides:
Universal 3-Dimensional Visibility Representations for Graphs.
Graph Drawing 1995: 8-19 |
| 23 | | Peter Eades,
Sue Whitesides:
Nearest Neighbour Graph Realizability is NP-hard.
LATIN 1995: 245-256 |
| 22 | | Gregory Dudek,
Kathleen Romanik,
Sue Whitesides:
Localizing a Robot with Minimum Travel.
SODA 1995: 437-446 |
| 21 | | William Lenhart,
Sue Whitesides:
Reconfigurating Closed Polygonal Chains in Euclidean d-Space.
Discrete & Computational Geometry 13: 123-140 (1995) |
| 1994 |
|---|
| 20 | | Hossam A. ElGindy,
Giuseppe Liotta,
Anna Lubiw,
Henk Meijer,
Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs.
Graph Drawing 1994: 352-363 |
| 19 | | Sue Whitesides:
Poster Gallery Report.
Graph Drawing 1994: 461-469 |
| 18 | EE | Peter Eades,
Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
Symposium on Computational Geometry 1994: 49-56 |
| 17 | | Peter Eades,
Sue Whitesides:
Drawing Graphs in Two Layers.
Theor. Comput. Sci. 131(2): 361-374 (1994) |
| 1993 |
|---|
| 16 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro,
Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings
Springer 1993 |
| 15 | | Marc J. van Kreveld,
Jack Snoeyink,
Sue Whitesides:
Folding Rulers inside Triangles.
CCCG 1993: 1-6 |
| 14 | | Hossam A. ElGindy,
Michael E. Houle,
William Lenhart,
Mirka Miller,
David Rappaport,
Sue Whitesides:
Dominance Drawings of Bipartite Graphs.
CCCG 1993: 187-191 |
| 13 | EE | S. Bellantoni,
Irith Ben-Arroyo Hartman,
Teresa M. Przytycka,
Sue Whitesides:
Grid intersection graphs and boxicity.
Discrete Mathematics 114(1-3): 41-49 (1993) |
| 1992 |
|---|
| 12 | | Sue Whitesides,
Rongyao Zhao:
Algorithmic and Complexity Results for Drawing Euclidian Trees.
Advanced Visual Interfaces 1992: 395-408 |
| 11 | | Sue Whitesides:
Algorithmic Issues in the Geometry of Planar Linkage Movement.
Australian Computer Journal 24(2): 42-50 (1992) |
| 1988 |
|---|
| 10 | | 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) |
| 1987 |
|---|
| 9 | EE | 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 |
| 1985 |
|---|
| 8 | | 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) |
| 1984 |
|---|
| 7 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
Movement Problems for 2-Dimensional Linkages.
SIAM J. Comput. 13(3): 610-629 (1984) |
| 1983 |
|---|
| 6 | EE | Sue Whitesides:
Edge-colored complete graphs with alternating cycles.
Discrete Mathematics 46(3): 299-304 (1983) |
| 1982 |
|---|
| 5 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
FOCS 1982: 280-289 |
| 4 | EE | Sue Whitesides:
A classification of certain graphs with minimal imperfection properties.
Discrete Mathematics 38(2-3): 303-310 (1982) |
| 1981 |
|---|
| 3 | | Sue Whitesides:
An Algorithm for Finding Clique Cut-Sets.
Inf. Process. Lett. 12(1): 31-32 (1981) |
| 1979 |
|---|
| 2 | | Sue Whitesides:
Collineations of Projective Planes of Order 10, Part I.
J. Comb. Theory, Ser. A 26(3): 249-268 (1979) |
| 1 | | Sue Whitesides:
Collineations of Projective Planes of Order 10, Part II.
J. Comb. Theory, Ser. A 26(3): 269-277 (1979) |
