|
Journals in DBLP
- 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]
- 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]
- 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]
- 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]
- 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]
|