Journal of Algorithms, Volume 47

Volume 47, Number 1, April 2003

• Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou:
  A 2-approximation algorithm for path coloring on a restricted class of trees of rings. 1-13
  Electronic Edition (link) BibTeX
• Claudia Iturriaga, Anna Lubiw:
  Elastic labels around the perimeter of a map. 14-39
  Electronic Edition (link) BibTeX
• Konstantin Skodinis:
  Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. 40-59
  Electronic Edition (link) BibTeX
• Hatem M. Bahig, Ken Nakamula:
  Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316]. 60-61
  Electronic Edition (link) BibTeX

Volume 47, Number 2, July 2003

• Rolf Niedermeier, Peter Rossmanith:
  On efficient fixed-parameter algorithms for weighted vertex cover. 63-77
  Electronic Edition (link) BibTeX
• D. L. J. Alexander, D. W. Bulger, G. R. Wood:
  Expected search duration for finite backtracking adaptive search. 78-86
  Electronic Edition (link) BibTeX
• Noga Alon, Asaf Shapira:
  Testing satisfiability. 87-103
  Electronic Edition (link) BibTeX
• Boaz Tsaban:
  Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. 104-121
  Electronic Edition (link) BibTeX
• Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
  Approximation algorithms for MAX-MIN tiling. 122-134
  Electronic Edition (link) BibTeX