The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
1995, volume: 19, number: 1

  1. Pilar de la Torre, Clyde P. Kruskal
    Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:1-24 [Journal]
  2. Murray Sherk
    Self-Adjusting k-ary Search Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:25-44 [Journal]
  3. Greg N. Frederickson
    Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:45-85 [Journal]
  4. Prosenjit Bose, Godfried T. Toussaint
    Growing a Tree from Its Branches. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:86-103 [Journal]
  5. Philip N. Klein, R. Ravi
    A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:104-115 [Journal]
  6. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:116-143 [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