| 2011 |
|---|
| 44 | Indexing for Vector Projections. Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides. DASFAA (2) 2011, 367-376. Web SearchBibTeXDownload |
| 43 | Stochastic Scheduling for Underwater Sensor Networks. Dimitri Marinakis, Kui Wu, Sue Whitesides. Networking (1) 2011, 134-146. Web SearchBibTeXDownload |
| 2008 |
|---|
| 42 | On the Parameterized Complexity of Layered Graph Drawing. Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Matthew Kitching, Catherine McCartin, Catherine McCartin, Naomi Nishimura, Frances A. Rosamond, Frances A. Rosamond, David R. Wood, Sue Whitesides, David R. Wood. Algorithmica (52): 267-292 (2008). Web SearchBibTeXDownload |
| 41 | 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 (52): 167-176 (2008). Web SearchBibTeXDownload |
| 40 | Realizing partitions respecting full and partial order information. Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides. J. Discrete Algorithms (6): 51-58 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 39 | 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. (37): 522-551 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 38 | 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 (45): 159-182 (2006). Web SearchBibTeXDownload |
| 37 | The strength of weak proximity. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides. J. Discrete Algorithms (4): 384-400 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 36 | Transversals to Line Segments in Three-Dimensional Space. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. Discrete & Computational Geometry (34): 381-390 (2005). Web SearchBibTeXDownload |
| 35 | Separating Point Sets in Polygonal Environments. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides. Int. J. Comput. Geometry Appl. (15): 403-420 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 34 | 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. ESA 2004, 311-322. Web SearchBibTeXDownload |
| 33 | 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. Symposium on Computational Geometry 2004, 46-55. Web SearchBibTeXDownload |
| 32 | Separating point sets in polygonal environments. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides. Symposium on Computational Geometry 2004, 10-16. Web SearchBibTeXDownload |
| 2003 |
|---|
| 31 | Transversals to line segments in R3. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. CCCG 2003, 174-177. Web SearchBibTeX |
| 30 | The number of transversals to line segments in R^3. Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides. CoRR (math.MG/0306401) (2003). Web SearchBibTeXDownload |
| 29 | A complete and effective move set for simplified protein folding. Neal Lesh, Michael Mitzenmacher, Sue Whitesides. RECOMB 2003, 188-195. Web SearchBibTeXDownload |
| 2002 |
|---|
| 28 | 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, 113-117. Web SearchBibTeXDownload |
| 27 | A note on reconfiguring tree linkages: trees can lock. 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. Discrete Applied Mathematics (117): 293-297 (2002). Web SearchBibTeXDownload |
| 26 | Curvature-Constrained Shortest Paths in a Convex Polygon. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. SIAM J. Comput. (31): 1814-1851 (2002). Web SearchBibTeXDownload |
| 25 | Embedding problems for paths with direction constrained edges. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Theor. Comput. Sci. (289): 897-917 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 24 | Locked and Unlocked Polygonal Chains in Three Dimensions. 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. Discrete & Computational Geometry (26): 269-281 (2001). Web SearchBibTeXDownload |
| 23 | On the Parameterized Complexity of Layered Graph Drawing. Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Matthew Kitching, Catherine McCartin, Catherine McCartin, Naomi Nishimura, Frances A. Rosamond, Frances A. Rosamond, David R. Wood, Sue Whitesides, David R. Wood. ESA 2001, 488-499. Web SearchBibTeXDownload |
| 22 | 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. Graph Drawing 2001, 1-15. Web SearchBibTeXDownload |
| 2000 |
|---|
| 21 | Embedding Problems for Paths with Direction Constrained Edges. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. COCOON 2000, 64-73. Web SearchBibTeXDownload |
| 20 | Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. Graph Drawing 2000, 272-283. Web SearchBibTeXDownload |
| 19 | Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. J. Graph Algorithms Appl. (4): 1-3 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 18 | On Reconfiguring Tree Linkages: Trees can Lock. 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. CoRR (cs.CG/9910024) (1999). Web SearchBibTeXDownload |
| 17 | Locked and Unlocked Polygonal Chains in 3D. 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. SODA (cs.CG/9910009): 866-867 (1999). Web SearchBibTeXDownload |
| 1998 |
|---|
| 16 | Unfolding some classes of orthogonal polyhedra. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides. CCCG 1998. Web SearchBibTeXDownload |
| 15 | On reconfiguring tree linkages: Trees can lock. 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. CCCG 1998. Web SearchBibTeXDownload |
| 14 | Locked and Unlocked Polygonal Chains in 3D. 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. CoRR (cs.CG/9811019) (1998). Web SearchBibTeXDownload |
| 13 | 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. (2) (1998). Web SearchBibTeXDownload |
| 12 | Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. Symposium on Computational Geometry 1998, 392-401. Web SearchBibTeXDownload |
| 1997 |
|---|
| 11 | The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. Sándor P. Fekete, Michael E. Houle, Sue Whitesides. Graph Drawing 1997, 272-283. Web SearchBibTeXDownload |
| 1996 |
|---|
| 10 | Folding Rulers Inside Triangles. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides. Discrete & Computational Geometry (15): 265-285 (1996). Web SearchBibTeXDownload |
| 1995 |
|---|
| 9 | New Results on a Visibility Representation of Graphs in 3D. Sándor P. Fekete, Michael E. Houle, Sue Whitesides. Graph Drawing 1995, 234-241. Web SearchBibTeXDownload |
| 8 | The Strength of Weak Proximity. Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides. Graph Drawing 1995, 178-189. Web SearchBibTeXDownload |
| 1993 |
|---|
| 7 | Dominance Drawings of Bipartite Graphs. Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides. CCCG 1993, 187-191. Web SearchBibTeX |
| 6 | Folding Rulers inside Triangles. Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides. CCCG 1993, 1-6. Web SearchBibTeX |
| 1988 |
|---|
| 5 | Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Discrete & Computational Geometry (3): 281-293 (1988). Web SearchBibTeXDownload |
| 1987 |
|---|
| 4 | Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Symposium on Computational Geometry 1987, 1-10. Web SearchBibTeXDownload |
| 1985 |
|---|
| 3 | On the Movement of Robot Arms in 2-Dimensional Bounded Regions. John E. Hopcroft, Deborah Joseph, Sue Whitesides. SIAM J. Comput. (14): 315-333 (1985). Web SearchBibTeXDownload |
| 1984 |
|---|
| 2 | Movement Problems for 2-Dimensional Linkages. John E. Hopcroft, Deborah Joseph, Sue Whitesides. SIAM J. Comput. (13): 610-629 (1984). Web SearchBibTeXDownload |
| 1982 |
|---|
| 1 | On the Movement of Robot Arms in 2-Dimensional Bounded Regions. John E. Hopcroft, Deborah Joseph, Sue Whitesides. FOCS 1982, 280-289. Web SearchBibTeXDownload |
