The SCEAS System
Navigation Menu

Journals in DBLP

Nord. J. Comput.
1998, volume: 5, number: 2

  1. Stefan Dobrev, Peter Ruzicka
    On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:87-104 [Journal]
  2. Peter Høyer, Kim S. Larsen
    Parametric Permutation Routing via Matchings. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:105-114 [Journal]
  3. Joseph L. Ganley, Jeffrey S. Salowe
    The Power-p Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:115-127 [Journal]
  4. Pinar Heggernes, Jan Arne Telle
    Partitioning Graphs into Generalized Dominating Sets. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:128-142 [Journal]
  5. Mika Johnsson, Gábor Magyar, Olli Nevalainen
    On the Euclidean 3-Matching Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:143-0 [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