The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1999, volume: 34, number: 1

  1. Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
    Deferred-query: An efficient approach for some problems on interval graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:1-10 [Journal]
  2. Lior Shabtay, Adrian Segall
    On the memory overhead of distributed snapshots. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:11-17 [Journal]
  3. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi
    Path problems in networks with vector-valued edge weights. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:19-35 [Journal]
  4. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    Lower bounds for linear interval routing. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:37-46 [Journal]
  5. Michele Flammini
    Deadlock-free interval routing schemes. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:47-60 [Journal]
  6. J. Gómez, M. Escudero
    Optimal edge coloring of large graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:61-65 [Journal]
  7. Priyalal Kulasinghe, Saïd Bettayeb
    An optimal algorithm for layered wheel floorplan designs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:67-72 [Journal]
  8. Shlomi Dolev, Michael Kate, Jennifer L. Welch
    A competitive analysis for retransmission timeout. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:73-80 [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