Journal of Graph Algorithms and Applications, Volume 12

Volume 12, Number 1, 2008

• Michael Kaufmann, Dorothea Wagner:
  Guest Editor's Foreword. 3-4
  
• Stefan Felsner, Mareike Massow:
  Parameters of Bar k-Visibility Graphs. 5-27
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
  k-colored Point-set Embeddability of Outerplanar Graphs. 29-49
  
• David Eppstein:
  Upright-Quad Drawing of st-Planar Learning Spaces. 51-72
  
• Carsten Gutwenger, Karsten Klein, Petra Mutzel:
  Planarity Testing and Optimal Edge Insertion with Embedding Constraints. 73-95
  
• Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
  Drawing Bipartite Graphs on Two Parallel Convex Curves. 97-112
  
• Stephen G. Kobourov, Matthew Landis:
  Morphing Planar Graphs in Spherical Space. 113-127
  

Volume 12, Number 2, 2008

• Adrian Rusu, Confesor Santiago:
  Grid Drawings of Binary Trees: An Experimental Study. 131-195
  
• Kazuyuki Miura, Akira Kamada, Takao Nishizeki:
  Convex Grid Drawings of Plane Graphs with Rectangular Contours. 197-224
  
• Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia:
  C-Planarity of C-Connected Clustered Graphs. 225-262
  

Volume 12, Number 3, 2008

• Seok-Hee Hong:
  Guest Editor's Foreword. 265-266
  
• Walter Didimo, Francesco Giordano, Giuseppe Liotta:
  Overlapping Cluster Planarity. 267-291
  
• Martin Harrigan, Patrick Healy:
  Using a Significant Spanning Tree to Draw a Directed Graph. 293-317
  
• Chun-Cheng Lin, Hao-Jen Kao, Hsu-Chun Yen:
  Many-to-One Boundary Labeling. 319-356
  
• Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
  Efficient Labeling of Collinear Sites. 357-380