The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Optim.
2000, volume: 4, number: 3

  1. Jieliang Zhou, Patrick W. Dymond, Xiaotie Deng
    Graph Algorithms with Small Communication Costs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:291-305 [Journal]
  2. Piotr Berman, Bhaskar DasGupta
    Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:307-323 [Journal]
  3. H. Edwin Romeijn, Nanda Piersma
    A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:325-355 [Journal]
  4. Bing Lu, Lu Ruan
    Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:357-363 [Journal]
  5. Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty
    Facets of an Assignment Problem with 0-1 Side Constraint. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:365-388 [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