| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ☆ ☆ This research was supported in part by the National Science Foundation under grants CCR-9623585 and CCR-9988468.
|
Chen, Danny Z.
|
|
2001
|
18 |
3 |
p. 155-166
12 p.
|
article
|
| 2 |
Author index of Volume 18 (2001)
|
|
|
2001
|
18 |
3 |
p. 189-
1 p.
|
article
|
| 3 |
Convexity recognition of the union of polyhedra
|
Bemporad, Alberto
|
|
2001
|
18 |
3 |
p. 141-154
14 p.
|
article
|
| 4 |
Parallel searching on m rays ☆ ☆ This research is supported by the DFG-Project “Diskrete Probleme”, No. Ot 64/8-3.
|
Hammar, Mikael
|
|
2001
|
18 |
3 |
p. 125-139
15 p.
|
article
|
| 5 |
The DFS-heuristic for orthogonal graph drawing ☆ ☆ Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1].
|
Biedl, Therese
|
|
2001
|
18 |
3 |
p. 167-188
22 p.
|
article
|
Journal description