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
Petr Kolman, Christian Scheideler:
Improved bounds for the unsplittable flow problem. 20-44

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
Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance and routing labeling schemes for non-positively curved plane graphs. 60-88

Last update Fri May 24 20:31:19 2013 CET by the DBLP Team —

This material is Open Data

Data released under the ODC-BY 1.0 license — See also our legal information page