Journal of Algorithms, Volume 61

Volume 61, Number 1, September 2006

• Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
  A heuristic for the Stacker Crane Problem on trees which is almost surely exact. 1-19
  Electronic Edition (link) BibTeX
• Petr Kolman, Christian Scheideler:
  Improved bounds for the unsplittable flow problem. 20-44
  Electronic Edition (link) BibTeX

Volume 61, Number 2, November 2006

• Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski:
  Reconstructing noisy polynomial evaluation in residue rings. 47-59
  Electronic Edition (link) BibTeX
• Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
  Distance and routing labeling schemes for non-positively curved plane graphs. 60-88
  Electronic Edition (link) BibTeX