The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
1997, volume: 19, number: 4

  1. Gary L. Miller, Shang-Hua Teng
    Tree-Based Parallel Algorithm Design. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:369-389 [Journal]
  2. Boris V. Cherkassky, Andrew V. Goldberg
    On Implementing the Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:390-410 [Journal]
  3. Shun-Shii Lin, Kwei-Jay Lin
    A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:411-426 [Journal]
  4. Therese C. Biedl, Goos Kant, Michael Kaufmann
    On Triangulating Planar Graphs Under the Four-Connectivity Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:427-446 [Journal]
  5. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:447-460 [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