The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2004, volume: 41, number: 2

  1. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
    Graph Searching, Elimination Trees, and a Generalization of Bandwidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:73-87 [Journal]
  2. Gonzalo Navarro, Mathieu Raffinot
    New Techniques for Regular Expression Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:89-116 [Journal]
  3. Jochen Könemann, Asaf Levin, Amitabh Sinha
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:117-129 [Journal]
  4. Cees Duin
    A Branch-Checking Algorithm for All-Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:131-145 [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