Journal of Graph Algorithms and Applications, Volume 8

Volume 8, Numberr 1, 2004

Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Planar Graphs with Large Vertices and Thick Edges. 3-20
Electronic Edition (link) BibTeX
Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood:
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. 21-26
Electronic Edition (link) BibTeX
Adrian Dumitrescu, Sumanta Guha:
Extreme Distances in Multicolored Point Sets. 27-38
Electronic Edition (link) BibTeX
David Eppstein, Joseph Wang:
Fast Approximation of Centrality. 39-45
Electronic Edition (link) BibTeX
Anil Maheshwari, Norbert Zeh:
I/O-Optimal Algorithms for Outerplanar Graphs. 47-87
Electronic Edition (link) BibTeX
Hans L. Bodlaender, Gerard Tel:
A Note on Rectilinearity and Angular Resolution. 89-94
Electronic Edition (link) BibTeX
Javed A. Aslam, Ekaterina Pelekhov, Daniela Rus:
The Star Clustering Algorithm for Static and Dynamic Information Organization. 95-129
Electronic Edition (link) BibTeX

Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing, GD 2002

Xin He:
Guest Editor's Foreword. 133-134
Electronic Edition (link) BibTeX
Ashim Garg, Adrian Rusu:
Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio. 135-160
Electronic Edition (link) BibTeX
Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines. 161-177
Electronic Edition (link) BibTeX
Wilhelm Barth, Petra Mutzel, Michael Jünger:
Simple and Efficient Bilayer Cross Counting. 179-194
Electronic Edition (link) BibTeX
David Harel, Yehuda Koren:
Graph Drawing by High-Dimensional Embedding. 195-214
Electronic Edition (link) BibTeX
Sabine Bachl, Franz-Josef Brandenburg, Daniel Gmach:
Computing and Drawing Isomorphic Subgraphs. 215-238
Electronic Edition (link) BibTeX

John M. Boyer, Wendy J. Myrvold:
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. 241-273
Electronic Edition (link) BibTeX
Amit M. Bhosle, Teofilo F. Gonzalez:
Algorithms for Single Link Failure Recovery and Related Problems. 275-294
Electronic Edition (link) BibTeX
Kim Marriott, Peter J. Stuckey:
NP-Completeness of Minimal Width Unordered Tree Layout. 295-312
Electronic Edition (link) BibTeX
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook:
Algorithm and Experiments in Testing Planar Graphs for Isomorphism. 313-356
Electronic Edition (link) BibTeX
Pat Morin, David R. Wood:
Three-Dimensional 1-Bend Graph Drawings. 357-366
Electronic Edition (link) BibTeX