1. David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, and Stephen Wismath. Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. Discrete Mathematics and Theoretical Computer Science, 20(1):1-11, January 2018. [WWW ] [PDF ]
   Keywords: algorithm, point hyperplane duality, graph drawing, high-dimensional space. [bibtex-entry]



2. David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, and Stephen K. Wismath. On the Planar Split Thickness of Graphs. Algorithmica, 80(3):977--994, 2018. [WWW ] [bibtex-entry]



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



4. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity graphs of uncertainty regions. CoRR, abs/1009.3469, 2010. [bibtex-entry]



5. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity graphs of uncertainty regions. CoRR, abs/1009.3469, 2010. [bibtex-entry]



6. Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, and Nathan Yu. Abstract Milling with Turn Costs. CoRR, abs/0912.1050, 2009. [bibtex-entry]



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



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



9. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. SIAM Journal on Computing, 37:522--551, 2007. [WWW ] [bibtex-entry]



10. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, and Steve Wismath. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Internat. J. Comput. Geom. Appl., 17:297--304, 2007. [WWW ] [bibtex-entry]



11. 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, and David R. Wood. A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica, 45(2):159-182, 2006. [bibtex-entry]



12. H. Brönnimann, H. Everett, S. Lazard, F. Sottile, and S. Whitesides. Transversals to line segments in three-dimensional space. Discrete and Computational Geometry, 34(3):381--390, 2005. [bibtex-entry]

1. David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, and Stephen Wismath. On the Planar Split Thickness of Graphs. In LATIN 2014: Theoretical Informatics - 13th Latin American Symposium. Proceedings, volume 9644 of Lecture Notes in Computer Science, 2016. Springer.
   Note: On print. [bibtex-entry]



2. Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, and Sue Whitesides. Reconfiguring a Chain of Cubes. In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015. [WWW ] [bibtex-entry]



3. David Bremner, William Evans, Fabrizio Frati, Laurie Heyer, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, David Rappaport, and Sue Whitesides. On Representing Graphs by Touching Cuboids. In Graph Drawing, 2012. [bibtex-entry]



4. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity Graphs of Uncertainty Regions. In ISAAC, pages 434-445, 2010. [bibtex-entry]



5. Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. Connectivity Graphs of Uncertainty Regions. In ISAAC, pages 434-445, 2010. [bibtex-entry]



6. Mike R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, and Nathan Yu. Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. In WG, pages 123-134, 2010. [bibtex-entry]



7. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, and Steve Wismath. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. In 17th Canad. Conf. Comput. Geom., pages 302--305, 2005. [WWW ] [bibtex-entry]



8. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D. In 20th Symposium on Computational Geometry -- SoCG'04, pages 46--59, 2004. [WWW ] [bibtex-entry]



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



10. Hervé Bronnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, and Sue Whitesides. Transversals to Line Segments in R3. In 15th Canadian Conference on Computational Geometry - CCCG'2003, pages 4 p, 2003. [WWW ] [bibtex-entry]



11. H. Brönnimann, O. Devillers, Vida Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides. On the Number of Lines Tangent to Four Convex Polyhedra. In 8th Canad. Conf. Comput. Geom., pages 113--117, 2002. [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html