Volume 31, Number 1, 2001
- Alon Efrat, Alon Itai, Matthew J. Katz:
Geometry Helps in Bottleneck Matching and Related Problems.
1-28

- Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks.
29-43

- J. C. Cogolludo, Sanguthevar Rajasekaran:
Permutation Routing on Reconfigurable Meshes.
44-57

- R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
58-78

- Stephan Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability Results for Guarding Polygons and Terrains.
79-113

Volume 31, Number 2, 2001
Volume 31, Number 3, 2001
Volume 31, Number 4, 2001
Last update Thu May 23 18:14:41 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page