The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Algorithmica
1998, volume: 21, number: 2

  1. Pierre Fraigniaud, Cyril Gavoille
    Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:155-182 [Journal]
  2. Arvind Gupta, Naomi Nishimura
    Finding Largest Subtrees and Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:183-210 [Journal]
  3. Liang-Fang Chao, Andrea S. LaPaugh
    Finding All Minimal Shapes in a Routing Channel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:211-244 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002