The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2001, volume: 38, number: 4

  1. Ananth V. Iyer, Jianming Ye
    A network based model of a promotion-sensitive grocery logistics system. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:169-18 [Journal]
  2. Richard D. McBride, John W. Mamer
    Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:181-188 [Journal]
  3. Amir Averbuch, Iris Gaber, Yehuda Roditty
    Low-cost minimum-time line-broadcasting schemes in complete binary trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:189-193 [Journal]
  4. Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
    Maximizing residual flow under an arc destruction. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:194-198 [Journal]
  5. Shimon Even
    Area efficient layouts of the Batcher sorting networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:199-208 [Journal]
  6. Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma
    The clique partitioning problem: Facets and patching facets. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:209-226 [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