Volume 7, no. 1, 2003

• DOI: 10.7155/jgaa.00059
  Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry
  Chris Barrett , Achla Marathe , Madhav Marathe , Doug Cook , Gregory Hicks , Vance Faber , Aravind Srinivasan , Yoram Sussmann , and Heidi Thornquist
  Vol. 7, no. 1, pp. 3-31, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00060
  Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
  David R. Wood
  Vol. 7, no. 1, pp. 33-77, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00061
  Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
  Douglas W. Bass and I. Hal Sudborough
  Vol. 7, no. 1, pp. 79-98, 2003. Regular paper
  

Volume 7, no. 2, 2003
Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001

• DOI: 10.7155/jgaa.00062
  Guest Editors' Foreword
  Giuseppe Liotta and Ioannis G. Tollis
  Vol. 7, no. 2, pp. 101-103, 2003.
• DOI: 10.7155/jgaa.00063
  On External-Memory Planar Depth First Search
  Lars Arge , Ulrich Meyer , Laura Toma , and Norbert Zeh
  Vol. 7, no. 2, pp. 105-129, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00064
  Small Maximal Independent Sets and Faster Exact Graph Coloring
  David Eppstein
  Vol. 7, no. 2, pp. 131-140, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00065
  Deciding Clique-Width for Graphs of Bounded Tree-Width
  Wolfgang Espelage , Frank Gurski , and Egon Wanke
  Vol. 7, no. 2, pp. 141-180, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00066
  Visual Ranking of Link Structures
  Ulrik Brandes and Sabine Cornelsen
  Vol. 7, no. 2, pp. 181-201, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00067
  An Approach for Mixed Upward Planarization
  Markus Eiglsperger , Michael Kaufmann , and Frank Eppinger
  Vol. 7, no. 2, pp. 203-220, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00068
  Upward Embeddings and Orientations of Undirected Planar Graphs
  Walter Didimo and Maurizio Pizzonia
  Vol. 7, no. 2, pp. 221-241, 2003. Regular paper
  

Volume 7, no. 3, 2003

• DOI: 10.7155/jgaa.00069
  Crossing Numbers and Cutwidths
  Hristo N. Djidjev and Imrich Vrťo
  Vol. 7, no. 3, pp. 245-251, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00070
  A Multilevel Algorithm for Force-Directed Graph-Drawing
  Chris Walshaw
  Vol. 7, no. 3, pp. 253-285, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00071
  Finding Shortest Paths With Computational Geometry
  Po-Shen Loh
  Vol. 7, no. 3, pp. 287-303, 2003. Regular paper
  

Volume 7, no. 4, 2003
Advances in Graph Drawing. Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing, GD 2001

• DOI: 10.7155/jgaa.00072
  Guest Editors' Foreword
  Petra Mutzel and Michael Jünger
  Vol. 7, no. 4, pp. 307-309, 2003.
• DOI: 10.7155/jgaa.00073
  Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
  Christian Duncan and Stephen Kobourov
  Vol. 7, no. 4, pp. 311-333, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00074
  Orthogonal Drawings of Plane Graphs Without Bends
  Md. Saidur Rahman , Takao Nishizeki , and Mahmuda Naznin
  Vol. 7, no. 4, pp. 335-362, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00075
  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
  Stefan Felsner , Giuseppe Liotta , and Stephen Wismath
  Vol. 7, no. 4, pp. 363-398, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00076
  Low-Distortion Embeddings of Trees
  Robert Babilon , Jirí Matoušek , Jana Maxová , and Pavel Valtr
  Vol. 7, no. 4, pp. 399-409, 2003. Regular paper
  
• DOI: 10.7155/jgaa.00077
  On Cotree-Critical and DFS Cotree-Critical Graphs
  Hubert de Fraysseix and Patrice Ossona de Mendez
  Vol. 7, no. 4, pp. 411-427, 2003. Regular paper