|
|
Journals in DBLP
J. Algorithms
2003, volume: 49, number: 1
- Gianfranco Bilardi, Giuseppe F. Italiano
Preface. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:1- [Journal]
- Michael Krivelevich, Benny Sudakov
Approximate coloring of uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:2-12 [Journal]
- Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
Finding an optimal path without growing the tree. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:13-41 [Journal]
- Johan Håstad, Lars Ivansson, Jens Lagergren
Fitting points on the real line and its application to RH mapping. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:42-62 [Journal]
- Bala Kalyanasundaram, Kirk Pruhs
Maximizing job completions online. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:63-85 [Journal]
- Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully dynamic shortest paths in digraphs with arbitrary arc weights. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:86-113 [Journal]
- Ulrich Meyer, Peter Sanders
[Delta]-stepping: a parallelizable shortest path algorithm. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:114-152 [Journal]
- Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
The moving-target traveling salesman problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:153-174 [Journal]
- Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
Techniques for scheduling with rejection. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:175-191 [Journal]
- Michael R. Fellows, Michael T. Hallett, Ulrike Stege
Analogs & duals of the MAST problem for sequences & trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:192-216 [Journal]
|
