Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2014 | Efficien Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | | | |
1982 | Efficient Algorithms for Interval Graphs and Circular-arc Graphs | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | Networks 12(4), 459-467 | | | |
2010 | Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem | Lin, T. -C.; Lee, D. T. | Theoretical Comput. Sci. 411, 986-994 | | | |
2014 | Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | | | |
1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | | | |
2009 | Fast Algorithms for the Density Finding Problem | Lee, D. T. ; Lin, T. C.; Lu, H. I. | Algorithmica 53, 298--313 | | | |
1995 | Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon | Alsuwaiyel, M. H.; Lee, D. T. | Info. Processing Letters 55, 75-79 | | | |
1981 | Finding Intersection of Rectangles by Range Search | Lee, D. T. ; Wong, C. K. | J. Algorithms 2, 337-347 | | | |
2011 | Finding Maximum Sum Segments in Sequences with Uncertainty | Hung-I Yu; Tien-Ching Lin; D. T. Lee | | | | |
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 | | | |
1985 | Finding the diameter of a set of lines | Ching, Y. T.; Lee, D. T. | Pattern Recognition 18(3-4), 249-255 | | | |
1983 | (g0, g1,..., gk)-Trees and Unary 0L Systems | Lee, D. T. ; Liu, C. L.; Wong, C. K. | Theoretical Comput. Sci. 22, 209-217 | | | |
1981 | Generalization of Voronoi Diagram in the Plane | Lee, D. T. ; Drysdale, R. L. | SIAM J. Computing 10, 73-87 | | | |
1986 | Generalized Delaunay Triangulation for Planar Graphs | Lee, D. T. ; Lin, A. K. | Discrete & Computational Geometry 1, 201-217 | | | |
1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | | | |
2009 | GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing | Wei, J. D.; Tsai, M. H.; Lee, G. C.; Huang, J. H.; Lee, D. T. | IEEE Transactions on Visualization and Computer Graphics 15(2), 234-248 | | | |
1985 | Geometric Complexity and Related Problems | Lee, D. T. | TR-85-001 | | | |
1986 | Geometric Complexity of Some Location Problems | Lee, D. T. ; Wu, Y. F. | Algorithmica 1, 193 | | | |
2009 | Geometric Minimum Diameter Minimum Cost Spanning Problem | Seo, Dae Young; Lee, D. T. ; Lin, T. -C. | | | | |
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 | | | |