Journal of Graph Algorithms and Applications, Volume 10

Volume 10, Number 1, 2006

• Tomasz Radzik:
  Guest Editor's Foreword. 3-4
  
• Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster:
  Contraction and Treewidth Lower Bounds. 5-49
  
• Robert Elsässer, Burkhard Monien, Stefan Schamberger:
  Distributing Unit Size Workload Packages in Heterogeneous Networks. 51-68
  
• Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck:
  Finding Dominators in Practice. 69-94
  

Volume 10, Number 2, 2006

• Feodor F. Dragan, Chenyu Yan, Derek G. Corneil:
  Collective Tree Spanners and Routing in AT-free Related Graphs. 97-122
  
• Reuven Bar-Yehuda, Irad Yavneh:
  A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping. 123-139
  
• Thomas Eschbach, Wolfgang Günther, Bernd Becker:
  Orthogonal Hypergraph Drawing for Improved Visibility. 141-157
  
• Grant A. Cheston, Tjoen Seng Jap:
  A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs. 159-190
  
• Pascal Pons, Matthieu Latapy:
  Computing Communities in Large Networks Using Random Walks. 191-218
  
• Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn:
  Algorithms and Experiments for the Webgraph. 219-236
  
• Ilya Safro, Dorit Ron, Achi Brandt:
  A Multilevel Algorithm for the Minimum 2-sum Problem. 237-258
  
• Walter Didimo:
  Upward Planar Drawings and Switch-regularity Heuristics. 259-285
  
• Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath:
  Drawing Kn in Three Dimensions with One Bend per Edge. 287-295
  
• Marc Demange, Tinaz Ekim, Dominique de Werra:
  On the approximation of Min Split-coloring and Min Cocoloring. 297-315
  
• Junichiro Fukuyama:
  NP-completeness of the Planar Separator Problems. 317-328
  
• David Auber, Maylis Delest, Jean-Philippe Domenger, Serge Dulucq:
  Efficient drawing of RNA secondary structure. 329-351
  
• Sergio Cabello:
  Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. 353-363
  
• Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
  Small Stretch Spanners on Dynamic Graphs. 365-385
  
• Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa, Lev Zakrevski:
  A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph. 387-420
  

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