The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sue Whitesides: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sue Whitesides, Rongyao Zhao
    Algorithmic and Complexity Results for Drawing Euclidian Trees. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 1992, pp:395-408 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  5. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to line segments in R3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:174-177 [Conf]
  6. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
  7. Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
    Dominance Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:187-191 [Conf]
  8. Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides
    Convexifying star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  9. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
    Folding Rulers inside Triangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:1-6 [Conf]
  10. Naixun Pei, Sue Whitesides
    On the Reachable Regions of Chains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:161-166 [Conf]
  11. Naixun Pei, Sue Whitesides
    On folding rulers in regular polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  12. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding Problems for Paths with Direction Constrained Edges. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:64-73 [Conf]
  13. Sue Whitesides, Naixun Pei
    On the Reconfiguration of Chains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:381-390 [Conf]
  14. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:392-401 [Conf]
  15. Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
    The complexity of (un)folding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:164-170 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  17. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  18. Peter Eades, Sue Whitesides
    The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:49-56 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  20. Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue Whitesides
    Towards an implementation of the 3D visibility skeleton. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:131-132 [Conf]
  21. Sue Whitesides
    05191 Open Problem Session Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:- [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  24. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    On the Movement of Robot Arms in 2-Dimensional Bounded Regions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:280-289 [Conf]
  25. Therese C. Biedl, Joe Marks, Kathy Ryall, Sue Whitesides
    Graph Multidrawing: Finding Nice Drawings Without Defining Nice. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:347-355 [Conf]
  26. Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
    Orthogonal 3-D Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:76-86 [Conf]
  27. Helmut Alt, Michael Godau, Sue Whitesides
    Universal 3-Dimensional Visibility Representations for Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:8-19 [Conf]
  28. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:272-283 [Conf]
  29. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
    The Strength of Weak Proximity. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:178-189 [Conf]
  30. Peter Eades, Antonios Symvonis, Sue Whitesides
    Two Algorithms for Three Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:139-154 [Conf]
  31. Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    Recognizing Rectangle of Influence Drawable Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:352-363 [Conf]
  32. Sándor P. Fekete, Michael E. Houle, Sue Whitesides
    New Results on a Visibility Representation of Graphs in 3D. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:234-241 [Conf]
  33. Sándor P. Fekete, Michael E. Houle, Sue Whitesides
    The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:272-283 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  35. Vida Dujmovic, Sue Whitesides
    An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:118-129 [Conf]
  36. Matthew Kitching, Sue Whitesides
    The Three Dimensional Logic Engine. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:329-339 [Conf]
  37. Matthew Suderman, Sue Whitesides
    Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:345-356 [Conf]
  38. Sue Whitesides
    Poster Gallery Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:461-469 [Conf]
  39. Steven Robbins, Sue Whitesides
    On the Reliability of Triangle Intersection in 3D. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2003, pp:923-930 [Conf]
  40. Sue Whitesides
    Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:1-13 [Conf]
  41. Peter Eades, Sue Whitesides
    Nearest Neighbour Graph Realizability is NP-hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:245-256 [Conf]
  42. Steven Robbins, Alan C. Evans, D. Louis Collins, Sue Whitesides
    Tuning and Comparing Spatial Normalization Methods. [Citation Graph (0, 0)][DBLP]
    MICCAI (2), 2003, pp:910-917 [Conf]
  43. Neal Lesh, Michael Mitzenmacher, Sue Whitesides
    A complete and effective move set for simplified protein folding. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:188-195 [Conf]
  44. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  45. Gregory Dudek, Kathleen Romanik, Sue Whitesides
    Localizing a Robot with Minimum Travel. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:437-446 [Conf]
  46. Vida Dujmovic, Sue Whitesides
    On validating planar worlds. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:791-792 [Conf]
  47. Ileana Streinu, Sue Whitesides
    Rectangle Visibility Graphs: Characterization, Construction, and Compaction. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:26-37 [Conf]
  48. Sue Whitesides
    Algorithmic Issues in the Geometry of Planar Linkage Movement. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1992, v:24, n:2, pp:42-50 [Journal]
  49. Vida Dujmovic, Sue Whitesides
    An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:1, pp:15-31 [Journal]
  50. Peter Eades, Sue Whitesides
    The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:60-82 [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  52. Helmut Alt, Michael Godau, Sue Whitesides
    Universal 3-dimensional visibility representations for graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:1-2, pp:111-125 [Journal]
  53. Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
    The largest k-ball in a d-dimensional box. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:59-67 [Journal]
  54. Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    The rectangle of influence drawability problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:1-22 [Journal]
  55. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  56. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  57. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  58. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    The number of transversals to line segments in R^3 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  60. Peter Eades, Antonios Symvonis, Sue Whitesides
    Three-dimensional orthogonal graph drawing algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:55-87 [Journal]
  61. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  62. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
    Transversals to Line Segments in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:381-390 [Journal]
  63. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides
    Folding Rulers Inside Triangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:3, pp:265-285 [Journal]
  64. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  65. William Lenhart, Sue Whitesides
    Reconfigurating Closed Polygonal Chains in Euclidean d-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:123-140 [Journal]
  66. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  67. Peter Eades, Charles Stirk, Sue Whitesides
    The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:2, pp:97-103 [Journal]
  68. Sue Whitesides
    An Algorithm for Finding Clique Cut-Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:31-32 [Journal]
  69. Sue Whitesides
    Collineations of Projective Planes of Order 10, Part I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:3, pp:249-268 [Journal]
  70. Sue Whitesides
    Collineations of Projective Planes of Order 10, Part II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:3, pp:269-277 [Journal]
  71. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
    The strength of weak proximity. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:384-400 [Journal]
  72. Giuseppe Liotta, Sue Whitesides
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:1-3 [Journal]
  73. Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
    Bounds for Orthogonal 3-D Graph Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:63-79 [Journal]
  74. 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. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  75. Matthew Suderman, Sue Whitesides
    Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:149-163 [Journal]
  76. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1814-1851 [Journal]
  77. Gregory Dudek, Kathleen Romanik, Sue Whitesides
    Localizing a Robot with Minimum Travel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:583-604 [Journal]
  78. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    Movement Problems for 2-Dimensional Linkages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:610-629 [Journal]
  79. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    On the Movement of Robot Arms in 2-Dimensional Bounded Regions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:315-333 [Journal]
  80. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding problems for paths with direction constrained edges. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:897-917 [Journal]
  81. Peter Eades, Sue Whitesides
    Drawing Graphs in Two Layers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:361-374 [Journal]
  82. Peter Eades, Sue Whitesides
    The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:169, n:1, pp:23-37 [Journal]
  83. Rafa Absar, Sue Whitesides
    On Computing Shortest External Watchman Routes for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  84. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:229-232 [Conf]
  85. Ethan Kim, Sue Whitesides, Giuseppe Liotta
    A Note on Drawing Direction-constrained Paths in 3D. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:193-196 [Conf]
  86. Malvika Rao, Gregory Dudek, Sue Whitesides
    Minimum Distance Localization for a Robot with Limited Visibility. [Citation Graph (0, 0)][DBLP]
    ICRA, 2005, pp:2438-2445 [Conf]
  87. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  88. Sue Whitesides
    A classification of certain graphs with minimal imperfection properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:303-310 [Journal]
  89. Sue Whitesides
    Edge-colored complete graphs with alternating cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:3, pp:299-304 [Journal]
  90. S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides
    Grid intersection graphs and boxicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:41-49 [Journal]
  91. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  92. On the Computation of 3D Visibility Skeletons. [Citation Graph (, )][DBLP]


  93. On the Size of the 3D Visibility Skeleton: Experimental Results. [Citation Graph (, )][DBLP]


  94. Embeddability Problems for Upward Planar Digraphs. [Citation Graph (, )][DBLP]


  95. A Discrete Differential Operator for Direction-based Surface Morphometry. [Citation Graph (, )][DBLP]


  96. Medial Axis Approximation with Bounded Error. [Citation Graph (, )][DBLP]


  97. Intractability in Graph Drawing and Geometry: FPT Approaches. [Citation Graph (, )][DBLP]


  98. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  99. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  100. Parameterized Complexity of Geometric Problems. [Citation Graph (, )][DBLP]


  101. Abstract Milling with Turn Costs [Citation Graph (, )][DBLP]


Search in 0.091secs, Finished in 0.097secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002