The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
2001, volume: 41, number: 1

  1. Jørgen Bang-Jensen, Anders Yeo
    The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:1-19 [Journal]
  2. Zhi-Zhong Chen
    Approximation Algorithms for Independent Sets in Map Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:20-40 [Journal]
  3. Andrzej Lingas, Hans Olsson, Anna Östlin
    Efficient Merging and Construction of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:41-51 [Journal]
  4. Gabriela Jeronimo, Susana Puddu, Juan Sabia
    Computing Chow Forms and Some Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:52-68 [Journal]
  5. Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
    Deterministic Dictionaries. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:69-85 [Journal]
  6. Peter Sanders, Roberto Solis-Oba
    How Helpers Hasten h-Relations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:86-98 [Journal]
  7. Michael Krivelevich, Ram Nathaniel, Benny Sudakov
    Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:99-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