The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2001, volume: 31, number: 1

  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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
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