Results 1-44 of 44 (Search time: 0.004 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 1999 | Critical area computation via Voronoi diagrams | Papadopoulou, E.; Lee, D. T. | IEEE Trans. Computer-Aided Design 18, 463-474 | |||
2 | 1999 | Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization | Farrahi, A. H.; Lee, D. T. ; Sarrafzadeh, M. | Algorithmica 23, 187-210 | |||
3 | 1999 | Skew Voronoi Diagram | Aichholzer, O.; Aurenhammer, F.; Chen, D. Z.; Lee, D. T. ; Papadopoulou, E. | International Journal of Computational Geometry and Applications 9, 235-247 | |||
4 | 1999 | A Muscular-like Compliance Control for Active Vehicle Suspension | Chang, S. L.; Wu, C. H.; Lee, D. T. | ||||
5 | 1998 | Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs | Chen, D. Z.; Lee, D. T. ; Sridhar, R.; Sekharan, C. N. | Networks 32, 249-257 | |||
6 | 1998 | On Crossing Minimization Problem | Chen, H. F. S.; Lee, D. T. | IEEE Trans. Computer-Aided Design 17, 406-418 | |||
7 | 1998 | GeoSheet: A Distributed Visualization Tool for Geometric Algorithms | Lee, D. T. ; Shen, C. F.; Sheu, S. M. | International Journal of Computational Geometry and Applications 8, 119-155 | |||
8 | 1998 | A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains | Papadopoulou, E.; Lee, D. T. | Algorithmica 20, 319-352 | |||
9 | 1998 | Two Guard Walkability of Simple Polygons | Tseng, L. H.; Lee, D. T. ; Heffernan, P. | International Journal of Computational Geometry and Applications 8, 85-116 | |||
10 | 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 | |||
11 | 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 | |||
12 | 1997 | K-best Cuts for Circular-arc Graphs | Tsai, K. H.; Lee, D. T. | Algorithmica 18, 198-216 | |||
13 | 1996 | The Steiner Minimal Tree Problem in the λ-geometry Plane | Lee, D. T. ; Shen, C. F. | ||||
14 | 1996 | Rectilinear Paths Among Rectilinear Obstacles | Lee, D. T. ; Yang, C. D.; Wong, C. K. | Discrete Applied Mathematics 70, 185-215 | |||
15 | 1996 | Steiner Problems on Directed Acyclic Graphs | Tsan-sheng Hsu ; Kuo-Hui Tsai; Da-Wei Wang ; D.T. Lee | ||||
16 | 1996 | Computational Geometry | Lee, D. T. | ACM Computing Surveys 28(1), 27-31 | |||
17 | 1996 | A Faster Algorithm for Rubber-band Equivalent Transformation for Planar VLSI Layouts | Chen, H. F. S.; Lee, D. T. | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(2), 217-227 | |||
18 | 1996 | A Study of Neuromuscular-like Control in Rehabilitation Robot | Wu, C. H.; Chang, S. L.; Lee, D. T. | ||||
19 | 1996 | Steiner Problem on Directed Acyclic Graphs | Hsu, T. S.; Tsai, K. H.; Wang, D. W.; Lee, D. T. | ||||
20 | 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 | |||
21 | 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 | |||
22 | 1995 | Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon | Alsuwaiyel, M. H.; Lee, D. T. | Info. Processing Letters 55, 75-79 | |||
23 | 1995 | Rectilinear Path Problems among Rectilinear Obstacles Revisited | Yang, C. D.; Lee, D. T. ; Wong, C. K. | SIAM J. Computing 24, 457-472 | |||
24 | 1995 | On Steiner Tree Problem with 45° Routing | Lee, D. T. ; Shen, C. F.; Ding, C. L. | ||||
25 | 1995 | Point Set pattern matching ind-dimensions | deRezende, P. J.; Lee, D. T. | Algorithmica 13, 387-404 | |||
26 | 1995 | Parallel Algorithms on Circular-Arc Graphs | Andrews, M. G.; Lee, D. T. | Computational Geometry: Theory and Applications 5, 117-141 | |||
27 | 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 | |||
28 | 1994 | Restricted Track Assignment with Applications | Sarrafzadeh, M.; Lee, D. T. | International Journal of Computational Geometry and Applications 4, 53-68 | |||
29 | 1993 | Maximum Independent Set of a Permutation Graph in K Tracks | Lee, D. T. ; Sarrafzadeh, M. | International Journal of Computational Geometry & Applications 3(3), 291-304 | |||
30 | 1993 | Minimum Spanning Trees with Bounded Number of Bends | Ho, Jan-Ming ; Lee, D. T. ; Wong, C. K. | ||||
31 | 1993 | Minimal Link Visibility Paths inside a Simple Polygon | Alsuwaiyel, M. H.; D. T. Lee | Computational Geometry: Theory and Applications 3, 1-26 | |||
32 | 1993 | The All-Pairs-Quickest Path Problem | Lee, D. T. ; Papadopoulou, E. | Info. Processing Letters 45, 261-267 | |||
33 | 1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | |||
34 | 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 | |||
35 | 1992 | 1-segment Center Problems | Imai, H.; Lee, D. T. ; Yang, C. D. | ORSA J. Computing. 4, 426-434 | |||
36 | 1992 | Parallel Enclosing Rectangle on SIMD Machines | Jeong, C. S.; Choi, J. J.; Lee, D. T. | Parallel Computing 18, 21-229 | |||
37 | 1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | |||
38 | 1991 | Minimum Diameter Spanning Trees and Related Problems | Ho, Jan-Ming ; Lee, D. T. ; Chang, C. H.; Wong, C. K. | SIAM Journal on Computing 20(5), 987-997 | |||
39 | 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 | |||
40 | 1991 | Out-of-Roundness Problem Revisited | Le, V. B.; Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 13, 217-223 | |||
41 | 1990 | Minimum Cut for Circular-arc Graphs | Lee, D. T. ; Sarrafzadeh, M.; Wu, Y. F. | SIAM J. Computing 19, 1041-1050 | |||
42 | 1990 | Planar Subset of Multi-terminal Nets | Liao, K. F.; Lee, D. T. ; Sarrafzadeh, M. | Integration, the VLSI Journal 10, 19-37 | |||
43 | 1990 | Parallel Geometric Algorithms on a Mesh Connected Computer | Jeong, C. S.; Lee, D. T. | Algorithmica 5, 155-177 | |||
44 | 1990 | Shortest Rectilinear Paths among Weighted Rectangles | Yang, C. D.; Chen, T. H.; Lee, D. T. | J. Information Processing 13, 456-462 |