Results 1-9 of 9 (Search time: 0.002 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 1997 | Finding Rectilinear Paths Among Obstacles in a Two-layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | International Journal of Computational Geometry and Applications 7, 581-598 | |||
2 | 1997 | The Smallest Pair of Non-crossing Paths in a Rectilinear Polygon | Yang, C. D.; Lee, D. T. ; Wong, C. K. | IEEE Trans. Comput. 46, 930-941 | |||
3 | 1996 | Rectilinear Paths Among Rectilinear Obstacles | Lee, D. T. ; Yang, C. D.; Wong, C. K. | Discrete Applied Mathematics 70, 185-215 | |||
4 | 1995 | Rectilinear Path Problems among Rectilinear Obstacles Revisited | Yang, C. D.; Lee, D. T. ; Wong, C. K. | SIAM J. Computing 24, 457-472 | |||
5 | 1994 | On Bends and Distances of Paths among Obstacles in Two-Layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | IEEE Trans. Comput. 43, 711-724 | |||
6 | 1992 | On Bends and Length of Rectilinear Paths: A Graph-Theoretic Approach | Yang, C. D.; Lee, D. T. ; Wong, C. K. | International Journal of Computational Geometry and Applications 2, 61-74 | |||
7 | 1992 | 1-segment Center Problems | Imai, H.; Lee, D. T. ; Yang, C. D. | ORSA J. Computing. 4, 426-434 | |||
8 | 1991 | Shortest Rectilinear Paths among Weighted Obstacles | Lee, D. T. ; Yang, C. D.; Chen, T. H. | International Journal of Computational Geometry and Applications 1, 109-124 | |||
9 | 1990 | Shortest Rectilinear Paths among Weighted Rectangles | Yang, C. D.; Chen, T. H.; Lee, D. T. | J. Information Processing 13, 456-462 |