The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2000, volume: 27, number: 2

  1. Luca Trevisan
    Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming''. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:115-119 [Journal]
  2. Sanjiv Kapoor, H. Ramesh
    An Algorithm for Enumerating All Spanning Trees of a Directed Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:120-130 [Journal]
  3. Reuven Bar-Yehuda
    One for the Price of Two: a Unified Approach for Approximating Covering Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:131-144 [Journal]
  4. Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto
    Binary Searching with Nonuniform Costs and Its Application to Text Retrieval. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:145-169 [Journal]
  5. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
    Smallest Enclosing Cylinders. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:170-186 [Journal]
  6. G. Sajith, Sanjeev Saxena
    Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:187-197 [Journal]
  7. Nili Guttmann-Beck, Refael Hassin
    Approximation Algorithms for Minimum K-Cut. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:2, pp:198-207 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002