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. Vida Dujmovic, Will Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, and Steve Wismath. On Point-sets that Support Planar Graphs. Computational Geometry, 43(1):29--50, 2013. [WWW ] [bibtex-entry]



4. 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]



5. 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]



6. 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]

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. William Lenhart, Giuseppe Liotta, Debajyoti Mondal, and Rahnuma Islam Nishat. Planar and Plane Slope Number of Partial 2-Trees. In Graph Drawing, pages 412-423, 2013. [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. Fabrizio Frati, Marc Glisse, William Lenhart, Giuseppe Liotta, Tamara Mchedlidze, and Rahnuma Islam Nishat. Point-Set Embeddability of 2-Colored Trees. In Graph Drawing, 2012. [bibtex-entry]



5. Vida Dujmovic, Will Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, and Steve Wismath. On Point-sets that Support Planar Graphs. In Graph Drawing, 2011. [WWW ] [bibtex-entry]



6. Vida Dujmovic, William Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, and Steve Wismath. On Graphs Supported by Line Sets. In Graph Drawing, pages 177-182, 2010. [bibtex-entry]



7. Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, and Steve Wismath. A note on alpha-drawable k-trees. In CCCG, 2008. [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