Results 1-7 of 7 (Search time: 0.001 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 1995 | An Optimal Algorithm for Roundness Determination on Convex Polygons | Swanson, K.; Lee, D. T. ; Wu, V. L. | Computational Geometry: Theory and Applications 5, 225-235 | |||
2 | 1995 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications | Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 14, 429-441 | |||
3 | 1995 | Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon | Alsuwaiyel, M. H.; Lee, D. T. | Info. Processing Letters 55, 75-79 | |||
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 | 1995 | On Steiner Tree Problem with 45° Routing | Lee, D. T. ; Shen, C. F.; Ding, C. L. | ||||
6 | 1995 | Point Set pattern matching ind-dimensions | deRezende, P. J.; Lee, D. T. | Algorithmica 13, 387-404 | |||
7 | 1995 | Parallel Algorithms on Circular-Arc Graphs | Andrews, M. G.; Lee, D. T. | Computational Geometry: Theory and Applications 5, 117-141 |