| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Characterization of Planar Graphs by Pseudo-Line Arrangements
|
Tamaki, Hisao
|
|
Inc.
|
35 |
3 |
p. 269-285
|
artikel
|
| 2 |
A Characterization of Planar Graphs by Pseudo-Line Arrangements
|
Tamaki, Hisao
|
|
2002
|
35 |
3 |
p. 269-285
|
artikel
|
| 3 |
An Approximation Algorithm for a Large-Scale Facility Location Problem
|
Hidaka, Kazuyoshi
|
|
Inc.
|
35 |
3 |
p. 216-224
|
artikel
|
| 4 |
An Approximation Algorithm for a Large-Scale Facility Location Problem
|
Hidaka, Kazuyoshi
|
|
2002
|
35 |
3 |
p. 216-224
|
artikel
|
| 5 |
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
|
Keung Poon, Chung
|
|
Inc.
|
35 |
3 |
p. 257-268
|
artikel
|
| 6 |
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
|
Keung Poon, Chung
|
|
2002
|
35 |
3 |
p. 257-268
|
artikel
|
| 7 |
Efficient Parallel Algorithms for Planar st-Graphs
|
Atallah,
|
|
Inc.
|
35 |
3 |
p. 194-215
|
artikel
|
| 8 |
Efficient Parallel Algorithms for Planar st-Graphs
|
Atallah,
|
|
2002
|
35 |
3 |
p. 194-215
|
artikel
|
| 9 |
Finding a Region with the Minimum Total L1 Distance from Prescribed Terminals
|
Kusakari, Yoshiyuki
|
|
Inc.
|
35 |
3 |
p. 225-256
|
artikel
|
| 10 |
Finding a Region with the Minimum Total L1 Distance from Prescribed Terminals
|
Kusakari, Yoshiyuki
|
|
2002
|
35 |
3 |
p. 225-256
|
artikel
|
| 11 |
Guest Editors' Foreword
|
Leong,
|
|
2002
|
35 |
3 |
p. 193
|
artikel
|
Tijdschrift beschrijving