Journal of Graph Algorithms and Applications, Volume 2

Volume 2, Number 1, 1998

• Kelly A. Lyons, Henk Meijer, David Rappaport:
  Algorithms for Cluster Busting in Anchored Graph Drawing.
  

Volume 2, Number 2, 1998

• Leqiang Bai, Hajime Maeda, Hiroyuki Ebara, Hideo Nakano:
  A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs.
  
• 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, Christian Zelle:
  A Visibility Representation for Graphs in Three Dimensions.
  
• Joseph Naor, Ariel Orda, Raphael Rom:
  Scheduled Hot-Potato Routing.
  
• Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller:
  Treewidth and Minimum Fill-in on d-Trapezoid Graphs.
  
• Esteban Feuerstein, Alberto Marchetti-Spaccamela:
  Memory Paging for Connectivity and Path Problems in Graphs.
  
• Therese C. Biedl:
  New Lower Bounds For Orthogonal Drawings.
  
• Alice M. Dean, Joan P. Hutchinson:
  Rectangle-visibility Layouts of Unions and Products of Trees.
  

Last update Sat May 18 20:41:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page