The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2004, volume: 39, number: 3

  1. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:189-208 [Journal]
  2. Petr Kolman, Christian Scheideler
    Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:209-233 [Journal]
  3. David R. Wood
    Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:235-253 [Journal]
  4. Jianjun Zhou, Martin Müller 0003
    Solving Systems of Difference Constraints Incrementally with Bidirectional Search. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:255-274 [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