Volume 8,
no. 1,
2004
- 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.
Submitted: September 2003.
Revised: March 2004. Communicated by Joseph S. B. Mitchell.
- 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.
Submitted: April 2003.
Revised: March 2004. Communicated by Giuseppe Liotta.
- Extreme Distances in Multicolored Point Sets
Adrian Dumitrescu and Sumanta Guha
Vol. 8,
no. 1,
pp.
27-38,
2004.
Regular paper.
Submitted: January 2003.
Revised: March 2004. Communicated by Michael T. Goodrich.
- Fast Approximation of Centrality
David Eppstein and Joseph Wang
Vol. 8,
no. 1,
pp.
39-45,
2004.
Concise paper.
Submitted: March 2001.
Revised: March 2004. Communicated by Martin Fürer.
- I/O-Optimal Algorithms for Outerplanar Graphs
Anil Maheshwari and Norbert Zeh
Vol. 8,
no. 1,
pp.
47-87,
2004.
Regular paper.
Submitted: October 2001.
Revised: April 2004. Communicated by Michael T. Goodrich.
- A Note on Rectilinearity and Angular Resolution
Hans L. Bodlaender and Gerard Tel
Vol. 8,
no. 1,
pp.
89-94,
2004.
Concise paper.
Submitted: November 2003.
Revised: April 2004. Communicated by Dorothea Wagner.
- 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.
Submitted: December 2003.
Revised: August 2004. Communicated by Samir Khuller.
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
- Guest Editor's Foreword
Xin He
Vol. 8,
no. 2,
pp.
133-134,
2004.
- 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.
Submitted: April 2003.
Revised: May 2004. Communicated by Xin He.
- Drawing Graphs on Two and Three Lines
Sabine Cornelsen, Thomas Schank and Dorothea Wagner
Vol. 8,
no. 2,
pp.
161-177,
2004.
Regular paper.
Submitted: March 2003.
Revised: January 2004. Communicated by Xin He.
- Simple and Efficient Bilayer Cross Counting
Wilhelm Barth, Petra Mutzel and Michael Jünger
Vol. 8,
no. 2,
pp.
179-194,
2004.
Regular paper.
Submitted: March 2003.
Revised: October 2004. Communicated by Xin He.
- Graph Drawing by High-Dimensional Embedding
David Harel and Yehuda Koren
Vol. 8,
no. 2,
pp.
195-214,
2004.
Regular paper.
Submitted: March 2003.
Revised: November 2003. Communicated by Xin He.
- Computing and Drawing Isomorphic Subgraphs
Sabine Bachl, Franz J. Brandenburg and Daniel Gmach
Vol. 8,
no. 2,
pp.
215-238,
2004.
Regular paper.
Submitted: April 2003.
Revised: October 2004. Communicated by Xin He.
Volume 8,
no. 3,
2004
- 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.
Submitted: September 2003.
Revised: October 2004. Communicated by Peter Eades.
- 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.
Submitted: October 2003.
Revised: July 2004. Communicated by Balaji Raghavachari.
- NP-Completeness of Minimal Width Unordered Tree Layout
Kim Marriott and Peter J. Stuckey
Vol. 8,
no. 3,
pp.
295-312,
2004.
Regular paper.
Submitted: May 2003.
Revised: June 2005. Communicated by Michael Kaufmann.
- 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.
Submitted: September 2003.
Revised: February 2005. Communicated by Giuseppe Liotta.
- Three-Dimensional 1-Bend Graph Drawings
Pat Morin and David R. Wood
Vol. 8,
no. 3,
pp.
357-366,
2004.
Concise paper.
Submitted: April 2004.
Revised: March 2005. Communicated by Giuseppe Liotta.
|