Stop the war!
Остановите войну!
for scientists:
default search action
Journal of Algorithms, Volume 49
Volume 49, Number 1, October 2003
- Gianfranco Bilardi, Giuseppe F. Italiano:
Preface. 1 - Michael Krivelevich, Benny Sudakov:
Approximate coloring of uniform hypergraphs. 2-12 - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu:
Finding an optimal path without growing the tree. 13-41 - Johan Håstad, Lars Ivansson, Jens Lagergren:
Fitting points on the real line and its application to RH mapping. 42-62 - Bala Kalyanasundaram, Kirk Pruhs:
Maximizing job completions online. 63-85 - Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully dynamic shortest paths in digraphs with arbitrary arc weights. 86-113 - Ulrich Meyer, Peter Sanders:
[Delta]-stepping: a parallelizable shortest path algorithm. 114-152 - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky:
The moving-target traveling salesman problem. 153-174 - Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for scheduling with rejection. 175-191 - Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
Analogs & duals of the MAST problem for sequences & trees. 192-216
Volume 49, Number 2, November 2003
- Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir:
Dispatching in perfectly-periodic schedules. 219-239 - Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. 240-261 - Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk:
Matching planar maps. 262-283 - Sergei Bespamyatnikh:
Computing homotopic shortest paths in the plane. 284-303
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.