The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2006, volume: 48, number: 1

  1. Walid Ben-Ameur, Luis Gouveia
    Further contributions to network optimization. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:1-6 [Journal]
  2. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Route discovery with constant memory in oriented planar geometric networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:7-15 [Journal]
  3. Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl
    A linear time algorithm for the reverse 1-median problem on a cycle. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:16-23 [Journal]
  4. Fan Wang, Andrew Lim, Zhou Xu
    The one-commodity pickup and delivery travelling salesman problem on a path or a tree. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:24-35 [Journal]
  5. Ethan D. Bolker, Thomas Zaslavsky
    A simple algorithm that proves half-integrality of bidirected network programming. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:36-38 [Journal]
  6. D. A. Thomas, J. F. Weng
    Minimum cost flow-dependent communication networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:39-46 [Journal]
  7. Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson
    Fault-tolerant routings with minimum optical index. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:47-55 [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