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

Journals in DBLP

J. Algorithms
2005, volume: 56, number: 2

  1. Hiroshi Nagamochi
    A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:2, pp:77-95 [Journal]
  2. Christine E. Heitsch
    Insufficiency of four known necessary conditions on string unavoidability. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:2, pp:96-123 [Journal]
  3. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
    Transposition invariant string matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:2, pp:124-153 [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