 | 1997 |
|---|
| 10 |       | Chung-Do Yang,
D. T. Lee,
C. K. Wong:
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon.
IEEE Trans. Computers 46(8): 930-941 (1997) |
| 9 | | D. T. Lee,
Chung-Do Yang,
C. K. Wong:
Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model.
Int. J. Comput. Geometry Appl. 7(6): 581-598 (1997) |
| 1996 |
|---|
| 8 |  | D. T. Lee,
Chung-Do Yang,
C. K. Wong:
Rectilinear Paths Among Rectilinear Obstacles.
Discrete Applied Mathematics 70(3): 185-215 (1996) |
| 1995 |
|---|
| 7 | | Chung-Do Yang,
D. T. Lee,
C. K. Wong:
Rectilinear Path Problems among Rectilinear Obstacles Revisited.
SIAM J. Comput. 24(3): 457-472 (1995) |
| 1994 |
|---|
| 6 | | D. T. Lee,
Chung-Do Yang,
C. K. Wong:
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model.
IEEE Trans. Computers 43(6): 711-724 (1994) |
| 1992 |
|---|
| 5 | | Hiroshi Imai,
D. T. Lee,
Chung-Do Yang:
1-Segment Center Problems.
INFORMS Journal on Computing 4(4): 426-434 (1992) |
| 4 | | Chung-Do Yang,
D. T. Lee,
C. K. Wong:
On bends and lengths of rectilinear paths: a graph theoretic approach.
Int. J. Comput. Geometry Appl. 2(1): 61-74 (1992) |
| 1991 |
|---|
| 3 | | Chung-Do Yang,
D. T. Lee,
C. K. Wong:
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.
WADS 1991: 320-330 |
| 2 | | D. T. Lee,
Chung-Do Yang,
T. H. Chen:
Shortest rectilinear paths among weighted obstacles.
Int. J. Comput. Geometry Appl. 1(2): 109-124 (1991) |
| 1990 |
|---|
| 1 | | D. T. Lee,
T. H. Chen,
Chung-Do Yang:
Shortest Rectilinear Paths among Weighted Obstacles.
Symposium on Computational Geometry 1990: 301-310 |
