Volume 8, 2004
|
Volume 8, no. 1, 2004
|
-
DOI: 10.7155/jgaa.00078
Drawing Planar Graphs with Large Vertices and Thick Edges
Gill Barequet
,
Michael T. Goodrich
, and
Chris Riley
Vol. 8, no. 1, pp. 3-20, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00079
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Prosenjit Bose
,
Jurek Czyzowicz
,
Pat Morin
, and
David R. Wood
Vol. 8, no. 1, pp. 21-26, 2004.
Concise paper
-
DOI: 10.7155/jgaa.00080
Extreme Distances in Multicolored Point Sets
Adrian Dumitrescu
and
Sumanta Guha
Vol. 8, no. 1, pp. 27-38, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00081
Fast Approximation of Centrality
David Eppstein
and
Joseph Wang
Vol. 8, no. 1, pp. 39-45, 2004.
Concise paper
-
DOI: 10.7155/jgaa.00082
I/O-Optimal Algorithms for Outerplanar Graphs
Anil Maheshwari
and
Norbert Zeh
Vol. 8, no. 1, pp. 47-87, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00083
A Note on Rectilinearity and Angular Resolution
Hans L. Bodlaender
and
Gerard Tel
Vol. 8, no. 1, pp. 89-94, 2004.
Concise paper
-
DOI: 10.7155/jgaa.00084
The Star Clustering Algorithm for Static and Dynamic Information Organization
Javed A. Aslam
,
Ekaterina Pelekhov
, and
Daniela Rus
Vol. 8, no. 1, pp. 95-129, 2004.
Regular paper
|
Volume 8, no. 2, 2004
Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing, GD 2002
Guest Editor(s):
Xin He
|
-
DOI: 10.7155/jgaa.00085
Guest Editor's Foreword
Xin He
Vol. 8, no. 2, pp. 133-134, 2004.
-
DOI: 10.7155/jgaa.00086
Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
Ashim Garg
and
Adrian Rusu
Vol. 8, no. 2, pp. 135-160, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00087
Drawing Graphs on Two and Three Lines
Sabine Cornelsen
,
Thomas Schank
, and
Dorothea Wagner
Vol. 8, no. 2, pp. 161-177, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00088
Simple and Efficient Bilayer Cross Counting
Wilhelm Barth
,
Petra Mutzel
, and
Michael Jünger
Vol. 8, no. 2, pp. 179-194, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00089
Graph Drawing by High-Dimensional Embedding
David Harel
and
Yehuda Koren
Vol. 8, no. 2, pp. 195-214, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00090
Computing and Drawing Isomorphic Subgraphs
Sabine Bachl
,
Franz J. Brandenburg
, and
Daniel Gmach
Vol. 8, no. 2, pp. 215-238, 2004.
Regular paper
|
Volume 8, no. 3, 2004
|
-
DOI: 10.7155/jgaa.00091
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
John M. Boyer
and
Wendy J. Myrvold
Vol. 8, no. 3, pp. 241-273, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00092
Algorithms for Single Link Failure Recovery and Related Problems
Amit M. Bhosle
and
Teofilo F. Gonzalez
Vol. 8, no. 3, pp. 275-294, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00093
NP-Completeness of Minimal Width Unordered Tree Layout
Kim Marriott
and
Peter J. Stuckey
Vol. 8, no. 3, pp. 295-312, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00094
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
Jacek P. Kukluk
,
Lawrence B. Holder
, and
Diane J. Cook
Vol. 8, no. 3, pp. 313-356, 2004.
Regular paper
-
DOI: 10.7155/jgaa.00095
Three-Dimensional 1-Bend Graph Drawings
Pat Morin
and
David R. Wood
Vol. 8, no. 3, pp. 357-366, 2004.
Concise paper
|