The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2001, volume: 31, number: 4

  1. Peter A. Beling
    Exact Algorithms for Linear Programming over Algebraic Extensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:4, pp:459-478 [Journal]
  2. Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du
    Grade of Service Steiner Minimum Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:4, pp:479-500 [Journal]
  3. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
    Relaxed Balance Using Standard Rotations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:4, pp:501-512 [Journal]
  4. Ruy Luiz Milidiú, Eduardo Sany Laber
    Bounding the Inefficiency of Length-Restricted Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:4, pp:513-529 [Journal]
  5. B. Das, Michael C. Loui
    Reconstructing a Minimum Spanning Tree after Deletion of Any Node. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:4, pp:530-547 [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