![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
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 Gómez-Pérez
, Jaime Gutierrez
, Igor E. 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
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.