nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximating call-scheduling makespan in all-optical networks
|
Becchetti, Luca |
|
2004 |
2 |
4 |
p. 501-515 15 p. |
artikel |
2 |
Approximating schedules for dynamic process graphs efficiently
|
Jakoby, Andreas |
|
2004 |
2 |
4 |
p. 471-500 30 p. |
artikel |
3 |
Author Index
|
|
|
2004 |
2 |
4 |
p. 531-532 2 p. |
artikel |
4 |
Budget constrained minimum cost connected medians
|
Konjevod, Goran |
|
2004 |
2 |
4 |
p. 453-469 17 p. |
artikel |
5 |
Computing input multiplicity in anonymous synchronous networks with dynamic faults
|
Dobrev, Stefan |
|
2004 |
2 |
4 |
p. 425-438 14 p. |
artikel |
6 |
Editorial board
|
|
|
2004 |
2 |
4 |
p. v-vi nvt p. |
artikel |
7 |
Foreword
|
Brandes, Ulrik |
|
2004 |
2 |
4 |
p. 381- 1 p. |
artikel |
8 |
Networks with small stretch number
|
Cicerone, Serafino |
|
2004 |
2 |
4 |
p. 383-405 23 p. |
artikel |
9 |
Optimal fault-tolerant routings with small routing tables for k-connected graphs
|
Wada, Koichi |
|
2004 |
2 |
4 |
p. 517-530 14 p. |
artikel |
10 |
Optimizing cost flows by edge cost and capacity upgrade
|
Demgensky, I. |
|
2004 |
2 |
4 |
p. 407-423 17 p. |
artikel |
11 |
Recognizing graphs without asteroidal triples
|
Köhler, Ekkehard |
|
2004 |
2 |
4 |
p. 439-452 14 p. |
artikel |
12 |
Subject Index
|
|
|
2004 |
2 |
4 |
p. 533-536 4 p. |
artikel |