Volume 5, no. 1, 2001

• DOI: 10.7155/jgaa.00032
  Planarizing Graphs - A Survey and Annotated Bibliography
  Annegret Liebers
  Vol. 5, no. 1, pp. 1-74, 2001. Regular paper
  

Volume 5, no. 2, 2001

• DOI: 10.7155/jgaa.00033
  Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
  M. Closson , S. Gartshore , J. Johansen , and S. K. Wismath
  Vol. 5, no. 2, pp. 1-34, 2001. Regular paper
  

Volume 5, no. 3, 2001

• DOI: 10.7155/jgaa.00034
  1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
  Therese Biedl
  Vol. 5, no. 3, pp. 1-15, 2001. Regular paper
  

Volume 5, no. 4, 2001

• DOI: 10.7155/jgaa.00035
  Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
  Reuven Bar-Yehuda , Guy Even , Jon Feldman , and Joseph(Seffi) Naor
  Vol. 5, no. 4, pp. 1-27, 2001. Regular paper
  

Volume 5, no. 5, 2001
Selected Papers from the 1998 Dagstuhl Seminar on Graph Algorithms and Applications

• DOI: 10.7155/jgaa.00036
  Guest Editors' Foreword
  Takao Nishizeki , Roberto Tamassia , and Dorothea Wagner
  Vol. 5, no. 5, pp. 1-1, 2001.
• DOI: 10.7155/jgaa.00037
  Carrying Umbrellas: an Online Relocation Game on a Graph
  Jae-Ha Lee , Chong-Dae Park , and Kyung-Yong Chwa
  Vol. 5, no. 5, pp. 3-16, 2001. Regular paper
  
• DOI: 10.7155/jgaa.00038
  New Bounds for Oblivious Mesh Routing
  Kazuo Iwama , Yahiko Kambayashi , and Eiji Miyano
  Vol. 5, no. 5, pp. 17-38, 2001. Regular paper
  
• DOI: 10.7155/jgaa.00039
  Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
  Enrico Nardelli , Guido Proietti , and Peter Widmayer
  Vol. 5, no. 5, pp. 39-57, 2001. Regular paper
  
• DOI: 10.7155/jgaa.00040
  Shelling Hexahedral Complexes for Mesh Generation
  Matthias Müller-Hannemann
  Vol. 5, no. 5, pp. 59-91, 2001. Regular paper
  
• DOI: 10.7155/jgaa.00041
  Connectivity of Planar Graphs
  Hubert de Fraysseix and Patrice Ossona de Mendez
  Vol. 5, no. 5, pp. 93-105, 2001. Regular paper