| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2018 | The (1|1)-Centroid Problem in the Plane with Distance Constraints | Hung-I Yu; Tien-Ching Lin; D. T. Lee | International Journal of Computational Geometry and Applications 28, 81-109 | | | |
| 2016 | The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints | Hung-I Yu; Tien-Ching Lin; D. T. Lee | | | | |
| 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | | | |
| 1993 | The All-Pairs-Quickest Path Problem | Lee, D. T. ; Papadopoulou, E. | Info. Processing Letters 45, 261-267 | | | |
| 2011 | The Density Maximization Problem in Graphs | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Rutter, Ignaz; Wagner, Dorothea | | | | |
| 2013 | The Density Maximization Problem in Graphs | Mong-Jen Kao; Bastian Katz; Marcus Krug; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Journal of Combinatorial Optimization 26(4), 723-754 | | | |
| 2003 | The Extension and Contraction Rules of Graceful Trees | Yu, T. K.; Lee, D. T. | | | | |
| 2004 | The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry and Applications 14, 421-452 | | | |
| 2015 | The k-Nearest-Neighbor Voronoi Diagram Revisited | Chih-Hung Liu; Evanthia Papadopoulou; D. T. Lee | Algorithmica 71(2), 429-449 | | | |
| 2001 | The L∞ Voronoi Diagram of Segments and VLSI Applications | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry & Applications 11(5), 503-528 | | | |
| 2002 | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing | Papadopoulou, E.; Lee, D. T. | | | | |
| 2018 | The multi-service center problem | Hung-I Yu; Cheng-Chung Li; D.T. Lee | Theoretical Computer Science 705, 58-74 | | | |
| 1985 | The Power of Geometric Duality | Chazelle, B.; Guibas, L. J.; Lee, D. T. | BIT 25, 76-90 | | | |
| 1985 | The Power of Geometric Duality Revisited | Lee, D. T. ; Ching, Y. T. | Info. Processing Letters 21, 117-122 | | | |
| 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 | | | |
| 1996 | The Steiner Minimal Tree Problem in the λ-geometry Plane | Lee, D. T. ; Shen, C. F. | | | | |
| 2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities | Jia-Yau Shiao; Mong-Jen Kao; Ching-Chi Lin; D. T. Lee | | | | |
| 2007 | Time Convex Hull with a Highway | Yu, T. K.; Lee, D. T. | | | | |
| 2004 | Time-based Voronoi Diagrams | Lee, D. T. ; Liao, C. S.; Wang, W. B. | | | | |
| 1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | | | |
