Journals in DBLP

Algorithmica
2002, volume: 33, number: 2

1. Béchir el Ayeb
   Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n²sqrt(tau/log n) Algorithm. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:129-149 [Journal]
   
2. Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
   Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:150-167 [Journal]
   
3. Madhukar R. Korupolu, Vijaya Ramachandran
   Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:168-182 [Journal]
   
4. Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato
   Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:183-200 [Journal]
   
5. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
   Exact and Approximation Algorithms for Clustering. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:201-226 [Journal]
   
6. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
   Computing Approximate Shortest Paths on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:227-242 [Journal]
   
7. Victor Chepoi, Yann Vaxès
   Augmenting Trees to Meet Biconnectivity and Diameter Constraints. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:243-262 [Journal]
   
8. Sergei Bespamyatnikh, Michael Segal
   Fast Algorithms for Approximating Distances. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2002, v:33, n:2, pp:263-269 [Journal]