Volume 2, no. 1, 1998

• DOI: 10.7155/jgaa.00004
  Algorithms for Cluster Busting in Anchored Graph Drawing
  Kelly A. Lyons , Henk Meijer , and David Rappaport
  Vol. 2, no. 1, pp. 1-24, 1998. Regular paper
  

Volume 2, no. 2, 1998

• DOI: 10.7155/jgaa.00005
  A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
  Leqiang Bai , Hajime Maeda , Hiroyuki Ebara , and Hideo Nakano
  Vol. 2, no. 2, pp. 1-17, 1998. Regular paper
  

Volume 2, no. 3, 1998

• DOI: 10.7155/jgaa.00006
  A Visibility Representation for Graphs in Three Dimensions
  Prosenjit Bose , Hazel Everett , Sándor P. Fekete , Michael E. Houle , Anna Lubiw , Henk Meijer , Kathleen Romanik , Günter Rote , Thomas C. Shermer , Sue Whitesides , and Christian Zelle
  Vol. 2, no. 3, pp. 1-16, 1998. Regular paper
  

Volume 2, no. 4, 1998

• DOI: 10.7155/jgaa.00007
  Scheduled Hot-Potato Routing
  Joseph(Seffi) Naor , Ariel Orda , and Raphael Rom
  Vol. 2, no. 4, pp. 1-20, 1998. Regular paper
  

Volume 2, no. 5, 1998

• DOI: 10.7155/jgaa.00008
  Treewidth and Minimum Fill-in on d-Trapezoid Graphs
  Hans L. Bodlaender , Ton Kloks , Dieter Kratsch , and Haiko Müller
  Vol. 2, no. 5, pp. 1-23, 1998. Regular paper
  

Volume 2, no. 6, 1998

• DOI: 10.7155/jgaa.00009
  Memory Paging for Connectivity and Path Problems in Graphs
  Esteban Feuerstein and Alberto Marchetti-Spaccamela
  Vol. 2, no. 6, pp. 1-22, 1998. Regular paper
  

Volume 2, no. 7, 1998

• DOI: 10.7155/jgaa.00010
  New Lower Bounds For Orthogonal Drawings
  Therese C. Biedl
  Vol. 2, no. 7, pp. 1-31, 1998. Regular paper
  

Volume 2, no. 8, 1998

• DOI: 10.7155/jgaa.00011
  Rectangle-visibility Layouts of Unions and Products of Trees
  Alice M. Dean and Joan P. Hutchinson
  Vol. 2, no. 8, pp. 1-21, 1998. Regular paper