@article{Coja-Oghlan-Krumke-Nierhoff/06,
AUTHOR = {Coja-Oghlan, Amin and Krumke, Sven O. and Nierhoff, Till},
TITLE = {A heuristic for the Stacker Crane Problem on trees which is almost surely exact},
JOURNAL = {J. Algorithms},
VOLUME = {61},
NUMBER = {1},
PAGES = {1-19},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4DFBSY7-1/2/206610aae9f7a0f7f9ddd12f8f9c57ad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Kolman-Scheideler/06,
AUTHOR = {Kolman, Petr and Scheideler, Christian},
TITLE = {Improved bounds for the unsplittable flow problem},
JOURNAL = {J. Algorithms},
VOLUME = {61},
NUMBER = {1},
PAGES = {20-44},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4DB57J3-1/2/85465d98792994b04a881e5725ce22d9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Blackburn-Gomez-Perez-Gutierrez-Shparlinski/06,
AUTHOR = {Blackburn, Simon R. and Gomez-Perez, Domingo and Gutierrez, Jaime and Shparlinski, Igor E.},
TITLE = {Reconstructing noisy polynomial evaluation in residue rings},
JOURNAL = {J. Algorithms},
VOLUME = {61},
NUMBER = {2},
PAGES = {47-59},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {noisy interpolation, lattice basis reduction, polynomial congruences, predicting pseudorandom generators},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4D34K4S-1/2/8e035692bcec6bf2f0eb071343e5ecc8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Chepoi-Dragan-Vaxes/06,
AUTHOR = {Chepoi, Victor and Dragan, Feodor F. and Vax{\`e}s, Yann},
TITLE = {Distance and routing labeling schemes for non-positively curved plane graphs},
JOURNAL = {J. Algorithms},
VOLUME = {61},
NUMBER = {2},
PAGES = {60-88},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {distance labeling scheme, routing labeling scheme, planar graphs, efficient algorithms},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4DB57J3-3/2/a5deac26a689fe5b7431ac43f195d0ea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}