The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2003, volume: 36, number: 4

  1. Satoru Iwata
    Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:331-341 [Journal]
  2. Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
    Escaping a Grid by Edge-Disjoint Paths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:343-359 [Journal]
  3. Anna Galluccio, Guido Proietti
    Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:361-374 [Journal]
  4. Hans L. Bodlaender, Udi Rotics
    Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:375-408 [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