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