The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2000, volume: 36, number: 2

  1. Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
    A polyhedral study of the asymmetric traveling salesman problem with time windows. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:69-79 [Journal]
  2. Mark E. T. Horn
    Efficient modeling of travel in networks with time-varying link speeds. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:80-90 [Journal]
  3. Guy Even, Shimon Even
    Embedding interconnection networks in grids via the layered cross product. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:91-95 [Journal]
  4. Petrisor Panaite, Andrzej Pelc
    Impact of topographic information on graph exploration efficiency. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:96-103 [Journal]
  5. Konrad J. Swanepoel
    The local Steiner problem in normed planes. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:104-113 [Journal]
  6. Colin McDiarmid, Bruce A. Reed
    Channel assignment and weighted coloring. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:114-117 [Journal]
  7. Guillaume Fertin, Roger Labahn
    Compounding of gossip graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:126-137 [Journal]
  8. Celso C. Ribeiro, Maurício C. Souza
    Tabu search for the Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:138-146 [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