EPrints .org

Subject: Z.999 Others


Number of records: 34.

Jéron, Thierry and Jard, Claude (1995) 3D Layout of Reachability Graphs of Communicating Processes. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 25-32, Princeton.

Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 350-359, Colonial Williamsburg.

Patrignani, Maurizio (2004) A Note on the Self-similarity of Some Orthogonal Drawings. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 389-394, New York.

Dujmovic, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 118-129, Irvine, CA, USA.

Dean, Alice M. and Evans, William and Gethner, Ellen and Laison, Joshua D. and Safari, Mohammad Ali and Trotter, William T. (2006) Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 73-82, Limerick, Ireland.

Hirsch, Michael and Meijer, Henk and Rappaport, David (2007) Biclique Edge Cover Graphs and Confluent Drawings. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 405-416, Karlsruhe, Germany.

Stola, Jan (2008) Colorability in Orthogonal Graph Drawing. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 327-338, Sidney, Australia.

Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 238-245, Montréal, Canada.

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1996) Crossing Numbers of Meshes. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 463-471, Passau, Germany.

Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 1-14, Montréal, Canada.

Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (2002) Fractional Lengths and Crossing Numbers. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 186-192, Irvine, CA, USA.

Pach, János and Pinchasi, Rom and Tardos, Gábor and Tóth, Géza (2003) Geometric Graphs with No Self-intersecting Path of Length Three. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 295-311, Irvine, CA, USA.

Pach, János and Tóth, Géza (1997) Graphs Drawn with Few Crossings per Edge. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 345-354, Berkeley, California, USA.

Lenhart, William and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 373-384, Passau, Germany.

Jensen, David (2001) Knowledge Discovery from Graphs (Invited Talk). In Marks, Joe, Eds. Proceedings Graph Drawing, pages 170, Colonial Williamsburg.

Wood, David R. (2001) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 259-271, Colonial Williamsburg.

Lenhart, William and Liotta, Giuseppe (2001) Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 338-349, Colonial Williamsburg.

Bose, Prosenjit and Dean, Alice M. and Hutchinson, Joan P. and Shermer, Thomas (1997) On Rectangle Visibility Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 25-44, Berkeley, California, USA.

Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 519-521, Limerick, Ireland.

Fox, Jacob and Toth, Csaba D. (2007) On the Decay of Crossing Numbers. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 174-183, Karlsruhe, Germany.

de Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. Discrete Mathematics 229(1-3):pp. 57-72.

Biedl, Therese and Brandenburg, Franz J. (2007) Partitions of Graphs into Trees. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 430-439, Karlsruhe, Germany.

Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 150-161, Karlsruhe, Germany.

Bose, Prosenjit and Di Battista, Giuseppe and Lenhart, William and Liotta, Giuseppe (1995) Proximity Constraints and Representable Trees (extended abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 340-351, Princeton.

de Fraysseix, Hubert and Ossona de Mendez, Patrice (1995) Regular Orientations, Arboricity, and Augmentation. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 111-118, Princeton.

Felsner, Stefan and Zickfeld, Florian (2007) Schnyder Woods and Orthogonal Surfaces. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 417-429, Karlsruhe, Germany.

Eppstein, David (2002) Separating Thickness from Geometric Thickness. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 150-161, Irvine, CA, USA.

Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 320-331, Irvine, CA, USA.

Soss, Michael (1998) The Size of the Open Sphere of Influence Graph in $L_\infty$ Metric Spaces. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 458-459, Montréal, Canada.

Massow, Mareike and Felsner, Stefan (2007) Thickness of Bar 1-Visibility Graphs. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 330-342, Karlsruhe, Germany.

Biedl, Therese and Thiele, Torsten and Wood, David R. (2001) Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 284-295, Colonial Williamsburg.

de Castro, N. and Cobos, F. J. and Dana, J. C. and Márquez, A. and Noy, M. (1999) Triangle-Free Planar Graphs as Segments Intersection Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 341-350, Stirín Castle, Czech Republic.

Pach, János and Tóth, Géza (2001) Unavoidable Configurations in Complete Topological Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 328-337, Colonial Williamsburg.

Abello, James and Kumar, Krishna (1995) Visibility Graphs and Oriented Matroids (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 147-158, Princeton.

This list was generated on Fri Jun 27 09:37:12 CEST 2008.