公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 |
2016 | O(f) Bi-approximation for Capacitated Covering with Hard Capacities | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | | | | |
2019 | O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities(AACT 2019 Best Journal Paper Award) | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | Algorithmica 81, 1800-1817 | | | |
2012 | Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm | Liu, Chih-Hung; Kuo, Sy-Yen; Lee, D. T. ; Lin, Chun-Syun; Weng, Jung-Hung; Yuan, Shih-Yi | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 31(7), 1050-1060 | | | |
1984 | On 2-Dimensional Channel Assignment Problem | Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 33, 2-6 | | | |
1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 | | | |
1984 | On a Circle-Cover Minimization Problem | Lee, C. C.; Lee, D. T. | Info. Processing Letters 18 | | | |
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 | | | |
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 | | | |
1998 | On Crossing Minimization Problem | Chen, H. F. S.; Lee, D. T. | IEEE Trans. Computer-Aided Design 17, 406-418 | | | |
1983 | On Finding the Convex Hull of a Simple Polygon | Lee, D. T. | International Journal of Computer & Information Sciences 12, 87-98 | | | |
1982 | On k-Nearest Neighbor Voronoi Diagrams in the Plane | Lee, D. T. | IEEE Trans. Comput. 31, 478-487 | | | |
1995 | On Steiner Tree Problem with 45° Routing | Lee, D. T. ; Shen, C. F.; Ding, C. L. | | | | |
2004 | On the Crossing Distribution Problem in Two Regions | Yu, T. K.; Lee, D. T. | Journal of Information Science and Engineering 20, 1-25 | | | |
1984 | On the maximum empty rectangle problem | Naamad, A.; Lee, D. T. ; Hsu, W. L. | Discrete Applied Mathematics 8(3), 267-277 | | | |
1983 | On the X-Y Convex Hull of a Set of X-Y polygons | Nicholl, T. M.; Lee, D. T. ; Liao, Y. Z.; Wong, C. K. | BIT 23, 456-471 | | | |
1989 | On-Line Bin Packing in Linear Time | Ramanan, P.; Brown, D. J.; Lee, C. C.; Lee, D. T. | J. Algorithms 10, 305-326 | | | |
2014 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D. T. Lee ; Ignaz Rutter; Dorothea Wagner | | | | |
2015 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Theoretical Comput. Sci. 595, 46-64 | | | |
2009 | Optimal Randomized Algorithm for the Density Selection Problem | Lin, T. -C.; Lee, D. T. | | | | |
2016 | Optimal Time-Convex Hull for a Straight-Line Highway in Lp-Metrics | B.-S. Dai; Mong-Jen Kao; D.T. Lee | Computational Geometry: Theory and Applications 53, 1-20 | | | |