| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2005 | Labeling Points on a Single Line | Chen, Y. S.; Lee, D. T. ; Liao, C. S. | International Journal of Computational Geometry and Applications 15, 261-277 | | | |
| 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 | | | |
| 1979 | Location of Multiple Points in Planar Subdivision | Lee, D. T. ; Yang, C. C. | Information Processing Letters 9(4), 190-193 | | | |
| 2007 | Maximizing the Number of Independent Labels in the Plane | Yu, K. L.; Liao, C. S.; Lee, D. T. | | | | |
| 2010 | Maximum Detour and Spanning Ratio on Rectilinear Path in L_1 Plane | Gruene, A.; Lin, Tien-Chin; Yu, Teng-Kai; Klein, Rolf; Langetepe, Elmar; Lee, D. T. ; Poon, Sheung-Hung | | | | |
| 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 | | | |
| 1982 | Medial Axis Transformation of a Planar Shape | Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 4, 363-369 | | | |
| 1993 | Minimal Link Visibility Paths inside a Simple Polygon | Alsuwaiyel, M. H.; D. T. Lee | Computational Geometry: Theory and Applications 3, 1-26 | | | |
| 1990 | Minimum Cut for Circular-arc Graphs | Lee, D. T. ; Sarrafzadeh, M.; Wu, Y. F. | SIAM J. Computing 19, 1041-1050 | | | |
| 1989 | Minimum Delay Networks | Ho, Jan-Ming ; Lee, D. T. | | | | |
| 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 | | | |
| 1993 | Minimum Spanning Trees with Bounded Number of Bends | Ho, Jan-Ming ; Lee, D. T. ; Wong, C. K. | | | | |
| 2001 | Modeling Automatic Assembly and Disassembly Operations for Virtual Manufacturing | Mok, S. M.; Wu, C. H.; Lee, D. T. | IEEE Trans. on Systems, Man, and Cybernetics, PART A: Systems and Humans 31, 223-232 | | | |
| 2011 | Multiple-Instance Learning: Multiple Feature Selection on Instance Representation | Jhuo, I-Hong; Lee, D. T. | | | | |
| 2004 | Non-Detrimental Web Application Security Auditing | Huang, Y. W.; Tsai, C. H.; Lee, D. T. ; Kuo, S. Y. | | | | |
| 1981 | Number of Vias: A Control Parameter for Global Wiring of High Density Chips | Lee, D. T. ; Hong, S. J.; Wong, C. K. | IBM J. Res. and Develop. 25, 261-271 | | | |
| 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 | | | |
