|
Journals in DBLP
Algorithmica 2001, volume: 31, number: 1
- Alon Efrat, Alon Itai, Matthew J. Katz
Geometry Helps in Bottleneck Matching and Related Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:1-28 [Journal]
- Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
On-Line Competitive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:29-43 [Journal]
- J. C. Cogolludo, Sanguthevar Rajasekaran
Permutation Routing on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:44-57 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:58-78 [Journal]
- Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
Inapproximability Results for Guarding Polygons and Terrains. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:79-113 [Journal]
|