
Distinguished Research Fellow  Lee, Der Tsai 





Publications 

Journal Articles  
1. 
HungI Yu, TienChing Lin, and D. T. Lee, "The (11)Centroid Problem in the Plane with Distance Constraints," to appear in International Journal of Computational Geometry and Applications. 
2. 
HungI Yu, ChengChung Li, and D.T. Lee, "The multiservice center problem," Theoretical Computer Science, volume 705, pages 5874, January 2018. ::: ::: 
3. 
YuHsuan Su, ChingChi Lin, D. T. Lee, "Broadcasting in Weighted Trees under the Postal Model," Theoretical Comput. Sci., volume 621, pages 7381, March 2016. ::: ::: 
4. 
B.S. Dai, MongJen Kao and D.T. Lee, "Optimal TimeConvex Hull for a StraightLine Highway in LpMetrics," Computational Geometry: Theory and Applications, volume 53, pages 120, February 2016. ::: ::: 
5. 
JianJia Chen, MongJen Kao, D.T. Lee, Ignaz Rutter and Dorothea Wagner, "Online Dynamic Power Management with Hard RealTime Guarantees," Theoretical Comput. Sci., volume 595, pages 4664, August 2015. ::: ::: 
6. 
ChihHung Liu, Evanthia Papadopoulou, and D. T. Lee, "The kNearestNeighbor Voronoi Diagram Revisited," Algorithmica, volume 71, number 2, pages 429449, April 2015. ::: ::: 
7. 
MongJen Kao, HanLin Chen, and D.T. Lee, "Capacitated Domination: Problem Complexity and Approximation Algorithms," Algorithmica, volume 72, number 1, pages 143, April 2015, DOI 10.1007/s0045301398446 ::: ::: 
8. 
ChihHung Liu, ChunXun Lin, IChe Chen, D. T. Lee, and TingChi Wang, "Efficien Multilayer ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction," IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, volume 33, number 12, pages 19281941, December 2014. ::: 
9. 
KunMao Chao, Tsansheng Hsu and D. T. Lee, Ed.,, "Preface Algorithms and Computation (ISAAC 2012)," Algorithmica, volume 70, number 4, pages 694695, December 2014, Preface, Guest editors 
10. 
KunMao Chao, Tsansheng Hsu and D. T. Lee, Ed.,, "Algorithms and Computation (ISAAC 2012)," Theoretical Comput. Sci., volume 544, number 7, pages 12, August 2014, Preface, Guest Editors 
11. 
WeiChun Chung, ChienChih Chen, JanMing Ho, ChungYen Lin, WenLian Hsu, YuChun Wang, DerTsai Lee, Feipei Lai, ChihWei Huang and YuJung Chang, "CloudDOE: A UserFriendly Tool for Deploying Hadoop Clouds and Analyzing HighThroughput Sequencing Data with MapReduce," PLoS One, volume 9, number 6, pages 10.1371/journal.pone.0098146, June 2014, http://clouddoe.iis.sinica.edu.tw/ (IF: 3.730，Journal ranking: Multidisciplinary Sciences/Q1: 7/56, 12.5%) ::: 
12. 
I.Hong Jhuo, Guangnan Ye, Shenghua Gao, Dong Liu, YuGang Jiang, D. T. Lee and ShihFu Chang, "Discovering joint audio–visual codewords for video event detection," Machine Vision and Applications, volume 25, number 1, pages 3347, January 2014, http://www.springerlink.com. ::: 
13. 
MongJen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Ignaz Rutter, and Dorothea Wagner, "Density Maximization Problem in Graphs," Journal of Combinatorial Optimization, volume 26, number 4, pages 723754, November 2013. ::: ::: 
14. 
ChungShou Liao and D. T. Lee, "Power Domination in Circulararc Graphs," Algorithmica, volume 65, number 2, pages 443466, February 2013, http://dx.doi.org/10.1007/s004530119599x ::: ::: 
15. 
ChihHung Liu, SyYen Kuo, D. T. Lee, ChunSyun Lin, JungHung Weng, and ShihYi Yuan, "ObstacleAvoiding Rectilinear Steiner Tree Construction: A SteinerPoint Based Algorithm," IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, volume 31, number 7, pages 10501060, July 2012. 
16. 
C. WulffNilsen, A. Grüne, R. Klein, E. Langetepe, D.T. Lee, T.C. Lin, S.H. Poon, and T.K. Yu, "Computing the Stretch Factor and Maximum Detour of Paths, Trees, and Cycles in the Normed Space," International Journal of Computational Geometry and Applications, volume 22, number 1, pages 4560, February 2012. ::: ::: 
17. 
M. J. Kao, C. S. Liao and D. T. Lee, "Capacitated domination problem," Algorithmica, volume 60, number 2, pages 274300, July 2011. ::: ::: 
18. 
T.C. Lin and D. T. Lee, "Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem," Theoretical Comput. Sci., volume 411, number 79, pages 986994, February 2010. 
19. 
J. D. Wei, M. H. Tsai, G. C. Lee, J. H. Huang and D. T. Lee, "GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing," IEEE Transactions on Visualization and Computer Graphics, volume 15, number 2, pages pp. 234248, March 2009. ::: ::: 
20. 
D. T. Lee, T. C. Lin and H. I. Lu, "Fast Algorithms for the Density Finding Problem," Algorithmica, volume 53, number 3, pages 298313, February 2009. ::: ::: 
21. 
TeChin Chu, Tsunglin Liu, D.T. Lee, Greg C. Lee, and Arthur ChunChieh Shih, "GRAligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events," Bioinformatics, volume 25, number 17, pages 21882193, 2009. ::: 
22. 
T. L. Huang and D. T. Lee, "A Distributed Multicast Routing Algorithm for RealTime Applications in Wide Area Networks," Journal Parallel and Distributed Computing, volume 67, number 5, pages 516530, May 2007. ::: 
23. 
T. C. Lin and D. T. Lee, "Randomized Algorithm for the Sum Selection Problem," Theoretical Comput. Sci., volume 377, number 13, pages 151156, May 2007. ::: ::: 
24. 
D. T. Lee, S. J. Shiah, C. M. Lee and Y. C. Wang, "State of Charge Estimation for Electric Scooters by Using Learning Mechanisms," IEEE Trans. Vehicular Technology, volume 56, number 2, pages 544556, March 2007. 
25. 
Arthur ChunChieh Shih, D.T. Lee, ChinLin Peng , and YuWei Wu, "PhylomLogo: An interactive multiplelogo visualization tool for largenumber sequence alignments," BMC Bioinformatics, volume 8:63, February 2007. ::: 
26. 
ChunNan Hsu, JinMei Lai, ChiaHung Liu,HueiHun Tseng, ChihYun Lin, KuanTing Lin, HsuHua Yeh, TingYi Sung, WenLian Hsu, LiJen Su, ShengAn Lee, ChanHan Chen, GenCher Lee, D.T. Lee, YowLing Shiue, ChangWei Yeh, ChaoHui Chang, ChengYan Kao, ChiYing F. Huang, "Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online)," BMC Bioinformatics, volume 8, number 66, pages 14712105, February 2007. 
27. 
T. L. Huang and D. T. Lee, "An iterative distributed algorithm for multiconstraint multicast routing," Computer Communications, volume 29, number 17, pages 36473661, November 2006. 
28. 
Arthur ChunChieh Shih, D.T. Lee, Laurent Lin, ChinLin Peng , ShiangHeng Chen, YuWei Wu, ChunYi Wong, MengYuan Chou, TzeChang Shiao, and MuFen Hsieh, "SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools," BMC Bioinformatics, volume 7:103, pages 14712105, March 2006. ::: 
29. 
Jinn Ho, WenLiang Hwang, Henry HornShing Lu, and D.T. Lee, "Gridding Spot Centers of Smoothly Distorted Microarray Images," IEEE Transactions on Image Processing, volume 15, number 2, pages 342353, February 2006. ::: 
30. 
Y. C. Wang, C. J. Chien and D. T. Lee, "A Hybrid Adaptive Scheme of FuzzyNeural Iterative Learning Controller for Nonlinear Dynamic Systems," Int'l J. Fuzzy Systems, volume 7, number 4, pages 147157, December 2005. 
31. 
T. L. Huang and D. T. Lee, "Comments and an improvement on 'A distributed algorithm of delaybounded multicast routing for multimedia applications in wide area networks'," IEEE/ACM Trans. Networking, volume 13, number 6, pages 14101411, December 2005. 
32. 
T. Y. Ho, Y. W. Chang, S. J. Chen and D. T. Lee, "Crosstalk and performancedriven multilevel fullchip routing," IEEE Trans. ComputerAided Design, volume 24, number 6, pages 869878, June 2005. 
33. 
Y. S. Chen, D. T. Lee and C. S. Liao, "Labeling Points on a Single Line," International Journal of Computational Geometry and Applications, volume 15, number 3, pages 261277, June 2005. 
34. 
Y. W. Huang, C. H. Tsai, T. P. Lin, S. K. Huang, D. T. Lee and S. Y. Kuo, "A testing framework for web application security assessment," Computer Networks, volume 48, number 5, pages 739761, June 2005. 
35. 
T.s. Hsu, K.H. Tsai, D.W. Wang, and D. T. Lee, "Two variations of the minimum," Journal of Combinatorial Optimization, volume 9, pages 101120, 2005. 
36. 
C. H. Wu, JanMing Ho and D. T. Lee, "Travel Time Prediction with Support Vector Regression," IEEE Trans. Intelligent Transportation Systems, volume 5, number 4, pages 276281, December 2004, its ::: 
37. 
E. Papadopoulou and D. T. Lee, "The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach," International Journal of Computational Geometry and Applications, volume 14, number 6, pages 421452, December 2004. 
38. 
T. K. Yu and D. T. Lee, "On the Crossing Distribution Problem in Two Regions," Journal of Information Science and Engineering, volume 20, number 1, pages 125, 2004. 
39. 
H. C. Lai, J. S. Liu, L. S. Wang and D. T. Lee, "Design Parameters Study on the Stability and Perception of Riding Comfort of the Electrical Motorcycles under Rider Leaning," Mechatronics, volume 13, number 1, pages 4976, February 2003. ::: 
40. 
D. T. Lee, G. C. Lee and Y. W. Huang, "Knowledge Management for Computational Problem Solving," Journal of Universal Computer Science, volume 9, number 6, pages 563570, January 2003, also in Proc. 3rd Int'l Conference on Knowledge Management, Graz, Austria, July 2003 
41. 
E. Papadopoulou and D. T. Lee, "The L∞ Voronoi Diagram of Segments and VLSI Applications," International Journal of Computational Geometry and Applications, volume 11, number 5, pages 503528, October 2001. 
42. 
S. M. Mok, C. H. Wu and D. T. Lee, "Modeling Automatic Assembly and Disassembly Operations for Virtual Manufacturing," IEEE Trans. on Systems, Man, and Cybernetics, PART A: Systems and Humans, volume 31, number 3, pages 223232, May 2001. 
43. 
K. Aoki and D. T. Lee, "Towards WebBased Computing," International Journal of Computational Geometry and Applications, volume 11, number 1, pages 71104, February 2001. 
44. 
H. F. S. Chen and D. T. Lee, "A Faster OneDimensional Topological Compaction Algorithm," Algorithmica, volume 28, number 4, pages 390421, December 2000. 
45. 
J. M. Ho, S. K. Huang, T. R. Chuang and D. T. Lee, "典藏數位化資訊環境之探討On Creation and Management of Digital Libraries: System Environment, HumanComputer Interface and Research Issues," J. Library & Information Science, volume 26, number 2, pages 3848, October 2000. 
46. 
J. Tao and D. T. Lee, "Computing and Combinatorics: Foreword," Theoretical Comput. Sci., volume 240, number 2, pages 255, June 2000. 
47. 
M. G. Andrews, M. J. Atallah, D. Z. Chen and D. T. Lee, "Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems," Algorithmica, volume 26, number 2, pages 263289, February 2000. 
48. 
E. Papadopoulou and D. T. Lee, "Critical area computation via Voronoi diagrams," IEEE Trans. ComputerAided Design, volume 18, number 4, pages 463474, April 1999. 
49. 
A. H. Farrahi, D. T. Lee and M. Sarrafzadeh, "TwoWay and MultiWay Partitioning a Set of Intervals for CliqueWidth Maximization," Algorithmica, volume 23, number 3, pages 187210, March 1999. 
50. 
O. Aichholzer, F. Aurenhammer, D. Z. Chen, D. T. Lee and E. Papadopoulou, "Skew Voronoi Diagram," International Journal of Computational Geometry and Applications, volume 9, number 3, pages 235247, January 1999. 
51. 
D. Z. Chen, D. T. Lee, R. Sridhar and C. N. Sekharan, "Solving the Allpair Shortest Path Query Problem on Interval and Circulararc Graphs," Networks, volume 32, number 4, pages 249257, December 1998. 
52. 
H. F. S. Chen and D. T. Lee, "On Crossing Minimization Problem," IEEE Trans. ComputerAided Design, volume 17, number 5, pages 406418, May 1998. 
53. 
D. T. Lee, C. F. Shen and S. M. Sheu, "GeoSheet: A Distributed Visualization Tool for Geometric Algorithms," International Journal of Computational Geometry and Applications, volume 8, number 2, pages 119155, April 1998. 
54. 
E. Papadopoulou and D. T. Lee, "A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains," Algorithmica, volume 20, number 4, pages 319352, April 1998. 
55. 
L. H. Tseng, D. T. Lee and P. Heffernan, "Two Guard Walkability of Simple Polygons," International Journal of Computational Geometry and Applications, volume 8, number 1, pages 85116, February 1998. 
56. 
D. T. Lee, C. D. Yang and C. K. Wong, "Finding Rectilinear Paths Among Obstacles in a Twolayer Interconnection Model," International Journal of Computational Geometry and Applications, volume 7, number 6, pages 581598, December 1997. 
57. 
C. D. Yang, D. T. Lee and C. K. Wong, "The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon," IEEE Trans. Comput., volume 46, number 8, pages 930941, August 1997. 
58. 
K. H. Tsai and D. T. Lee, "Kbest Cuts for Circulararc Graphs," Algorithmica, volume 18, number 2, pages 198216, June 1997. 
59. 
D. T. Lee, C. D. Yang and C. K. Wong, "Rectilinear Paths Among Rectilinear Obstacles," Discrete Applied Mathematics, volume 70, number 3, pages 185215, October 1996. 
60. 
D. T. Lee, "Computational Geometry," ACM Computing Surveys, volume 28, number 1, pages 2731, March 1996, invited paper 
61. 
H. F. S. Chen and D. T. Lee, "A Faster Algorithm for Rubberband Equivalent Transformation for Planar VLSI Layouts," IEEE Trans. ComputerAided Design, volume 15, number 2, pages 217227, February 1996. 
62. 
K. Swanson, D. T. Lee and V. L. Wu, "An Optimal Algorithm for Roundness Determination on Convex Polygons," Computational Geometry: Theory and Applications, volume 5, number 4, pages 225235, November 1995. 
63. 
M. J. Atallah, D. Z. Chen and D. T. Lee, "An Optimal Algorithm for Shortest Paths on Weighted Interval and Circulararc Graphs with Applications," Algorithmica, volume 14, number 5, pages 429441, November 1995. 
64. 
M. H. Alsuwaiyel and D. T. Lee, "Finding an Approximate MinimumLink Visibility Path Inside a Simple Polygon," Info. Processing Letters, volume 55, pages 7579, July 1995. 
65. 
C. D. Yang, D. T. Lee and C. K. Wong, "Rectilinear Path Problems among Rectilinear Obstacles Revisited," SIAM J. Computing, volume 24, number 3, pages 457472, June 1995. 
66. 
P. J. deRezende and D. T. Lee, "Dot Pattern Matching in dDimensions," Algorithmica, volume 13, number 4, pages 387404, April 1995. 
67. 
M. G. Andrews and D. T. Lee, "Parallel Algorithms on CircularArc Graphs," Computational Geometry: Theory and Applications, volume 5, number 3, pages 117141, 1995. 
68. 
D. T. Lee, C. D. Yang and C. K. Wong, "On Bends and Distances of Paths among Obstacles in TwoLayer Interconnection Model," IEEE Trans. Comput., volume 43, number 6, pages 711724, June 1994. 
69. 
M. Sarrafzadeh and D. T. Lee, "Restricted Track Assignment with Applications," International Journal of Computational Geometry and Applications, volume 4, number 1, pages 5368, March 1994. 
70. 
D. T. Lee and M. Sarrafzadeh, "Maximum Independent Set of a Permutation Graph in K Tracks," International Journal of Computational Geometry and Applications, volume 3, number 3, pages 291304, September 1993. 
71. 
M. H. Alsuwaiyel and D. T. Lee, "Minimal Link Visibility Paths inside a Simple Polygon," Computational Geometry: Theory and Applications, volume 3, number 1, pages 126, June 1993. 
72. 
D. T. Lee and E. Papadopoulou, "The AllPairsQuickest Path Problem," Info. Processing Letters, volume 45, number 5, pages 261267, April 1993. 
73. 
R. D. Lou, M. Sarrafzadeh and D. T. Lee, "An Optimal Algorithm for the Maximum TwoChain Problem," SIAM J. Discrete Algorithms, volume 5, number 2, pages 285304, May 1992. 
74. 
C. D. Yang, D. T. Lee and C. K. Wong, "On Bends and Length of Rectilinear Paths: A GraphTheoretic Approach," International Journal of Computational Geometry and Applications, volume 2, number 1, pages 6174, March 1992. 
75. 
H. Imai, D. T. Lee and C. D. Yang, "1segment Center Problems," ORSA J. Computing., volume 4, number 4, pages 426434, 1992. 
76. 
C. S. Jeong, J. J. Choi and D. T. Lee, "Parallel Enclosing Rectangle on SIMD Machines," Parallel Computing, volume 18, number 2, pages 21229, 1992. 
77. 
M. Sarrafzadeh and D. T. Lee, "Topological Via Minimization Revisited," IEEE Trans. Comput., volume 40, number 11, pages 13071312, November 1991. 
78. 
D. T. Lee, C. D. Yang and T. H. Chen, "Shortest Rectilinear Paths among Weighted Obstacles," International Journal of Computational Geometry and Applications, volume 1, number 2, pages 109124, June 1991. 
79. 
V. B. Le and D. T. Lee, "OutofRoundness Problem Revisited," IEEE Trans. Pattern Analysis & Machine Intelligence, volume 13, number 3, pages 217223, March 1991. 
80. 
JanMing Ho, D. T. Lee, C. H. Chang and C. K. Wong, "Minimum Diameter Spanning Trees and Related Problems," SIAM J. on Computin, volume 20, number 5, pages 987997, January 1991, cg 
81. 
D. T. Lee, M. Sarrafzadeh and Y. F. Wu, "Minimum Cut for Circulararc Graphs," SIAM J. Computing, volume 19, number 6, pages 10411050, December 1990. 
82. 
K. F. Liao, D. T. Lee and M. Sarrafzadeh, "Planar Subset of Multiterminal Nets," Integration, the VLSI Journal, volume 10, number 1, pages 1937, September 1990. 
83. 
C. D. Yang, T. H. Chen and D. T. Lee, "Shortest Rectilinear Paths among Weighted Rectangles," J. Information Processing, volume 13, number 4, pages 456462, 1990. 
84. 
C. S. Jeong and D. T. Lee, "Parallel Geometric Algorithms on a Mesh Connected Computer," Algorithmica, volume 5, number 2, pages 155177, 1990. 
85. 
D. T. Lee, F. P. Preparata, "Parallel Batched Planar Point Location on the CCC," Info. Processing Letters, volume 33, number 4, pages 175179, December 1989. 
86. 
P. Ramanan, D. J. Brown, C. C. Lee and D. T. Lee, "OnLine Bin Packing in Linear Time," J. Algorithms, volume 10, number 3, pages 305326, September 1989. 
87. 
M. Sarrafzadeh and D.T. Lee, "A New Approach to Topological Via Minimization," IEEE Trans. ComputerAided Design, volume 8, number 8, pages 890900, August 1989. 
88. 
P. J. de Rezende, D. T. Lee and Y. F. Wu, "Rectilinear Shortest Paths with Rectangular Barriers," Discrete & Comput. Geom., volume 4, number 1, pages 4153, 1989. 
89. 
T. M. Nicholl, P. T. Lee and R. A. Nicholl, "An Efficient New Algorithm for 2D line Clipping: Its Development and Analysis," ACM SIGGRAPH Computer Graphics, volume 21, number 4, pages 253262, July 1987. 
90. 
C. C. Lee, D. T. Lee and C. K. Wong, "Generating Binary Trees of Bounded Height," Acta Informatica, volume 23, number 5, pages 529544, September 1986. 
91. 
D. T. Lee and A. K. Lin, "Computing the Visibility Polygon from an Edge," Computer Vision, Graphics, and Image Processing , volume 34, number 1, pages 119, April 1986. 
92. 
D. T. Lee and A. K. Lin, "Computational Complexity of Art Gallery Problems," IEEE Trans. Infor. Theory, volume 32, number 2, pages 276282, March 1986. 
93. 
D. T. Lee and Y. F. Wu, "Geometric Complexity of Some Location Problems," Algorithmica, volume 1, number 1, pages 193211, March 1986. 
94. 
D. T. Lee and A. K. Lin, "Generalized Delaunay Triangulation for Planar Graphs," Discrete & Comput. Geom., volume 1, number 1, pages 201217, 1986. 
95. 
B. Chazelle, R. L. Drysdale and D. T. Lee, "Computing the Largest Empty Rectangle," SIAM J. Computing, volume 15, number 1, pages 300315, 1986. 
96. 
B. M. Chazelle and D. T. Lee, "On a Circle Placement Problem," Computing, volume 36, number 12, pages 116, 1986. 
97. 
C. C. Lee and D. T. Lee, "A Simple OnLine Bin Packing Algorithm," J. ACM, volume 32, number 3, pages 562572, July 1985. 
98. 
D. T. Lee, "Computing the Relative Neighborhood Graph in the L1metric," Pattern Recognition, volume 18, number 5, pages 327332, 1985. 
99. 
B. Chazelle, L. J. Guibas and D. T. Lee, "The Power of Geometric Duality," BIT, volume 25, number 1, pages 7690, 1985. 
100. 
D. T. Lee and Y. T. Ching, "The Power of Geometric Duality Revisited," Info. Processing Letters, volume 21, number 3, pages 117122, 1985. 
101. 
Y. T. Ching and D. T. Lee, "On Finding the Diameter of a Set of Lines," Pattern Recognition, volume 18, number 34, pages 249255, 1985. 
102. 
D. T. Lee and F. P. Preparata, "Computational Geometry: A Survey," IEEE Trans. Comput., volume 33, number 12, pages 10721101, December 1984. 
103. 
D. T. Lee, "An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems," Int'l J. Comput. and Info. Sci., volume 13, number 1, pages 2332, February 1984. 
104. 
C. C. Lee and D. T. Lee, "On a CircleCover Minimization Problem," Info. Processing Letters, volume 18, number 2, pages 109115, February 1984. 
105. 
D. T. Lee and J. Y. T. Leung, "On 2Dimensional Channel Assignment Problem," IEEE Trans. Comput., volume 33, number 1, pages 26, January 1984. 
106. 
D. Y. Yeh and D. T. Lee, "Graph Algorithms on a TreeStructured Parallel Computer," BIT, volume 24, number 3, pages 333340, 1984. 
107. 
D. T. Lee and F. P. Preparata, "Euclidean Shortest Paths in the Presence of Rectilinear Barriers," Networks, volume 14, pages 393410, 1984. 
108. 
A. Naamad, W. L. Hsu and D. T. Lee, "On Maximum Empty Rectangle Problem," Discrete Applied Mathematics, volume 8, pages 267277, 1984. 
109. 
T. M. Nicholl, D. T. Lee, Y. Z. Liao and C. K. Wong, "On the XY Convex Hull of a Set of XY polygons," BIT, volume 23, number 4, pages 456471, December 1983. 
110. 
I. G. Gowda, D. G. Kirkpatrick, D. T. Lee and A. Naamad, "Dynamic Voronoi Diagrams," IEEE Trans. Infor. Theory, volume 29, number 5, pages 724731, September 1983. 
111. 
D. T. Lee, "Visibility of a Simple Polygon," Computer Vision, Graphics, and Image Processing , volume 22, number 2, pages 207221, May 1983. 
112. 
D. T. Lee, "On Finding the Convex Hull of a Simple Polygon," Int'l J. Comput. and Info. Sci., volume 12, number 2, pages 8798, April 1983. 
113. 
U. I. Gupta, D. T. Lee and C. K. Wong, "Ranking and Unranking of BTrees," J. Algorithms, volume 4, number 1, pages 5160, March 1983. 
114. 
D. T. Lee, C. L. Liu and C. K. Wong, "(g0, g1,..., gk)Trees and Unary 0L Systems," Theoretical Comput. Sci., volume 22, number 12, pages 209217, January 1983. 
115. 
D. T. Lee and C. B. Silio Jr, "An Optimal Illumination Region Algorithm for Convex Polygons," IEEE Trans. Comput., volume 31, number 12, pages 12251227, December 1982. 
116. 
D. T. Lee and F. P. Preparata, "An Improved Algorithm for the Rectangle Enclosure Problem," J. Algorithms, volume 3, number 3, pages 218224, September 1982. 
117. 
U. I. Gupta, D. T. Lee and C. K. Wong, "Ranking and Unranking of 23 Trees," SIAM J. Computing, volume 11, number 3, pages 582590, August 1982. 
118. 
D. T. Lee, "Medial Axis Transformation of a Planar Shape," IEEE Trans. Pattern Analysis & Machine Intelligence, volume 4, number 4, pages 363369, July 1982. 
119. 
D. T. Lee, "On kNearest Neighbor Voronoi Diagrams in the Plane," IEEE Trans. Comput., volume 31, number 6, pages 478487, June 1982. 
120. 
U. I. Gupta, D. T. Lee and J. Y. T. Leung, "Efficient Algorithms for Interval Graphs and Circulararc Graphs," Networks, volume 12, pages 459467, 1982. 
121. 
D. T. Lee, S. J. Hong and C. K. Wong, "Number of Vias: A Control Parameter for Global Wiring of High Density Chips," IBM J. Res. and Develop., volume 25, number 4, pages 261271, July 1981. 
122. 
D. T. Lee, H. Chang and C. K. Wong, "An OnChip Compare/Steer Bubble Sorter," IEEE Trans. Comput., volume 30, number 6, pages 396405, June 1981. 
123. 
D. T. Lee and R. L. Drysdale, "Generalization of Voronoi Diagram in the Plane," SIAM J. Computing, volume 10, number 1, pages 7387, February 1981. 
124. 
J. M. Smith, D. T. Lee and J. S. Liebman, "An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric," Networks, volume 11, number 1, pages 2329, 1981. 
125. 
U. I. Gupta, D. T. Lee, J. Y. T. Leung, J. W. Pruitt and C. K. Wong, "Record Allocation for Minimizing Expected Seek Delay Time," Theoretical Comput. Sci., volume 16, pages 307319, 1981. 
126. 
D. T. Lee and C. K. Wong, "Finding Intersection of Rectangles by Range Search," J. Algorithms, volume 2, number 4, pages 337347, 1981. 
127. 
D. T. Lee, "Two Dimensional Voronoi Diagrams in the Lpmetric," J. ACM, volume 27, number 4, pages 604618, October 1980. 
128. 
D. T. Lee and C. K. Wong, "Quintary Trees: A File Structure for Multidimensional Database Systems," ACM Trans. Database System, volume 1, number 3, pages 339353, September 1980. 
129. 
D. T. Lee and B. J. Schacter, "Two Algorithms for Constructing Delaunay Triangulations," Int'l J. Comput. and Info. Sci., volume 9, number 3, pages 219242, June 1980. 
130. 
D. T. Lee and C. K. Wong, "Voronoi Diagrams in L1 (L∞) Metrics with 2Dimensional Storage Applications," SIAM J. Computing, volume 9, number 1, pages 200211, February 1980. 
131. 
J. M. Smith, D. T. Lee and J. S. Liebman, "An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem," Engineering Optimization, volume 4, number 4, pages 179192, 1980. 
132. 
U. I. Gupta, D. T. Lee and J. Y.T. Leung, "An Optimal Solution for the ChannelAssignment Problem," IEEE Trans. Comput., volume 28, number 11, pages 807810, November 1979. 
133. 
D. T. Lee and C. C. Yang, "Location of Multiple Points in Planar Subdivision," Info. Processing Letters, volume 9, number 4, pages 190193, November 1979. 
134. 
D. T. Lee and F. P. Preparata, "An Optimal Algorithm for Finding the Kernel of a polygon," J. ACM, volume 26, number 3, pages 415421, July 1979. 
135. 
C. C. Yang and D. T. Lee, "A Note on the All Nearest Neighbor Problem for Convex Polygons," Info. Processing Letters, volume 8, number 4, pages 193194, April 1979. 
136. 
D. T. Lee and F. P. Preparata, "The All Nearest Neighbor Problem for Convex Polygons," Info. Processing Letters, volume 7, number 4, pages 189192, June 1978. 
137. 
D. T. Lee and F. P. Preparata, "Location of a Point in a Planar Subdivision and Its Applications," SIAM J. Computing, volume 6, number 3, pages 594606, September 1977. 
138. 
D. T. Lee and C. K. Wong, "Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees," Acta Informatica, volume 9, pages 2329, 1977. 
139. 
D. T. Lee and S. J. Hong, "An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function," IEEE Trans. Comput., volume 25, number 11, pages 11171123, November 1976. 


Conference Papers  
1. 
JiaYau Shiao, MongJen Kao, ChingChi Lin, and D. T. Lee, "Tight Approximation for Partial Vertex Cover with Hard Capacities," Proceedings, 28th International Symposium on Algorithms and Computation, Dec. 912, 2017, Phuket, Thailand, volume 92, Leibniz International Proceedings in Informatics (LIPIcs), Yoshio Okamoto and Takeshi Tokuyama, editor, Schloss DagstuhlLeibnizZentrum fuer Informatik, pages 64:1 64:13, Dagstuhl, Germany, December 2017, LIPIcs, ISBN 9783959770545, doi: 10.4230/LIPIcs.ISAAC.2017.64 ::: 
2. 
MongJen Kao, HaiLun Tu, and D.T. Lee, "O(f) Biapproximation for Capacitated Covering with Hard Capacities," Proceedings, 27th International Symposium on Algorithms and Computation, Dec. 1214, 2016, Sydney, Australia, volume 64, Leibniz International Proceedings in Informatics (LIPIcs), SeokHee Hong, editor, Schloss DagstuhlLeibnizZentrum fuer Informatik, pages 40:1  40:12, Dagstuhl, Germany, December 2016, LIPIcs 64, ISBN 9783959770262, doi: 10.4230/LIPIcs.ISAAC.2016.40 ::: 
3. 
HungI Yu, TienChing Lin, and D. T. Lee, "The (11)Centroid Problem on the Plane Concerning Distance Constraints," Proceedings, 27th International Symposium on Algorithms and Computation, Dec. 1214, 2016, Sydney, Australia, Lecture Notes in Computer Science, volume 64, LIPIcs, ISBN 9783959770262,, pages 64:1  64:12, Schloss Dagstuhl  LeibnizZentrum fuer Informatik, December 2016, LIPIcs 64, Schloss Dagstuhl  LeibnizZentrum fuer Informatik 2016, ISBN 9783959770262, 64:164:12, 2016. ::: 
4. 
WeiChun Chung, YuJung Chang, D. T. Lee, and JanMing Ho, "Using Geometric Structures to Improve the Error Correction Algorithm of HighThroughput Sequencing Data on MapReduce Framework," Proceedings IEEE BigData 2014, pages 784789, IEEE, October 2014, 10.1109/BigData.2014.7004306 ::: 
5. 
IHong Jhuo and D.T. Lee, "Video Event Detection via Multimodality Deep Learning," Proc. 22nd Int'l Conference on Pattern Recognition, Aug. 2428, 2014, Stockholm, Sweden, IEEE, pages 666671, August 2014, 10.1109/ICPR.2014.125 ::: ::: 
6. 
ChunXun Lin, ChihHung Liu, IChe Chen, D.T. Lee, and TsungYi Ho, "An Efficient Bicriteria Flow Channel Routing Algorithm For Flowbased Microfluidic Biochips," Proceedings of 2014 IEEE/ACM Design Automation Conference (DAC14), San Francisco, June 15. 2014, IEEE, pages 16, June 2014. ::: 
7. 
JianJia Chen, MongJen Kao, D. T. Lee, Ignaz Rutter, and Dorothea Wagner, "Online Dynamic Power Management with Hard RealTime Guarantees," 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), volume 25, Leibniz International Proceedings in Informatics (LIPIcs), Ernst W. Mayr and Natacha Portier, editor, Schloss DagstuhlLeibnizZentrum fuer Informatik, pages 226238, Dagstuhl, Germany, March 2014. ::: ::: 
8. 
DerTsai Lee, "Reviving Globally Stagnant Careers of Postdoctorates," The 7th Forum on Internationalization of Sciences and Humanities, pages 1719, Alexander von Humboldt Stiftung/Foundation, November 2013. ::: 
9. 
ChienChih Chen, YuJung Chang, WeiChun Chung, DerTsai Lee, and JanMing Ho, "CloudRS: An Error Correction Algorithm of HighThroughput Sequencing Data," Proceedings IEEE BigData 2013, October 2013. 
10. 
WeiChun Chung, YuJung Chang, ChienChih Chen, DerTsai Lee, and JanMing Ho, "Optimizing a MapReduce Module of Preprocessing HighThroughput DNA Sequencing Data," 2013 IEEE International Conference on Big Data (IEEE Big Data 2013), the First Workshop on Benchmarks, Performance Optimization, and Emerging hardware of Big Data Systems and Applications (BPOE 2013), October 2013. 
11. 
BangSin Dai, MongJen Kao and D. T. Lee, "Optimal TimeConvex Hull under the L_p Metrics," Proc. 2013 Algorithms and Data Structures Symposium, Aug. 1214, 2013, Ontario, Canada, Lecture Notes in Computer Science, August 2013. ::: 
12. 
ChihHung Liu and D. T. Lee, "HigherOrder Geodesic Voronoi Diagrams in a Polygonal Domain with Hole," Proceedings of the 2013 ACMSIAM Symposium on Discrete Algorithms (SODA13), Lecture Notes in Computer Science, pages 16331645, January 2013, Jan. 68, New Orleans, LA 
13. 
WeiChun Chung, ChiJen Wu, Ku Chin Fu, D. T. Lee, and JanMing Ho, "DR. ION: Disaster Rescue over InformationOriented Network," Proceedings RITMAN Workshop 2012, In conjunction with IEEE International Conference on SOCA 2012, December 2012. 
14. 
Andreas Gemsa, D. T. Lee, ChihHung Liu and Dorothea Wagner, "Higher Order City Voronoi Diagrams," Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT12), pages 5970, July 2012. 
15. 
Guangnan Ye, IHong Jhuo, Dong Liu, YuGang Jiang, D. T. Lee, ShihFu Chang, "Joint AudioVisual BiModal Codewords for Video Event Detection," ACM ICMR 2012  International Conference on Multimedia Retrieval, Jun. 5  8, 2012, Hong Kong, June 2012. 
16. 
ChihHung Liu, IChe Chen, and D. T. Lee, "An Efficient Algorithm for MultiLayer ObstacleAvoiding Rectilinear Steiner Tree Construction," Proceedings of the 49th Annual Design Automation Conference (DAC12), pages 613622, June 2012. 
17. 
HungI Yu, TienChing Lin and D. T. Lee, "Finding Maximum Sum Segments in Sequences with Uncertainty," Proc. International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, volume 7074, Takao Asano, ShinIchi Nakano and Yoshio Okamoto, editors, pages 734743, December 2011, Yokohama, Japan, Dec. 58, 2011 
18. 
MongJen Kao and D.T. Lee, "Capacitated Domination: Constant Factor Approximations for Planar Graphs," Proc. International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, volume 7074, Takao Asano, ShinIchi Nakano and Yoshio Okamoto, editors, pages 494503, December 2011, Yokohama, Japan, Dec. 58, 2011 ::: 
19. 
HungI Yu, TienChing Lin, D. T. Lee, "Finding Maximum Sum Segments in Sequences with Uncertainty," Proceedings of the 22nd International Symposium, ISAAC 2011, Lecture Notes in Computer Science, 7074, Takao Asano, ShinIchi Nakano, Yoshio Okamoto and Osamu Watanabe, editors, pages 734743, December 2011. ::: 
20. 
ChihHung Liu, Evanthia Papadopoulou and D. T. Lee, "An OutputSensitive Approach for the L_1/L_infinity k Nearest Neighbor Voronoi Diagram," Proc. 19th Annual European Symposium on Algorithms, LNCS, SpringerVerlag Heidelberg., Lecture Notes in Computer Science, September 2011, Sept. 57, Saarbrücken, Germany, 2011 ::: ::: 
21. 
MongJen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Ignaz Rutter, Dorothea Wagner, "The Density Maximization Problem in Graphs," 17th Annual International Computing and Combinatorics Conference(COCOON 2011), Lecture Notes in Computer Science, August 2011, Dallas, Texas, USA, August 1416, 2011. ::: 
22. 
IHong Jhuo and D. T. Lee, "MultipleInstance Learning: Multiple Feature Selection on Instance Representation," TwentyFifth Conference on Artificial Intelligence (AAAI11), August 2011, San Francisco, California, August 7~11, 2011 ::: 
23. 
MongJen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Martin Noellenburg, and Ignaz Rutter, "Connecting Two Trees with Optimal Routing Cost," Proc. 23rd Canadian Conference on Computational Geometry (CCCG'11), August 2011, August 1012, 2011, Toronto, Canada ::: ::: 
24. 
R. Klein, M. Krug, E. Langetepe, D. T. Lee and D. Wagner, "Constructing Optimal Shortcuts in Directed Weighted Paths," 27th European Workshop on Computational Geometry (EuroCG), March 2011, March 2830, 2011, Antoniushaus Morschach, Switzerland. ::: ::: 
25. 
A. Gruene, TienChin Lin, TengKai Yu, Rolf Klein, Elmar Langetepe, D.T. Lee and SheungHung Poon, "Maximum Detour and Spanning Ratio on Rectilinear Path in L_1 Plane," Proc. International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, volume LNCS 6507, number Part II, O. Cheong and K.Y. Chwa and Kunsoo Park, editors, SpringerVerlag, pages 121131, December 2010, Jeju Island, Korea, December 1517, 2010. ::: ::: 
26. 
IHong Jhuo and D. T. Lee, "Boostingbased Multiple Kernel Learning for Image Reranking," Proc. ACM Multimedia 2010 Int'l Conference, Firenze, Italy, October 2010, poster ::: 
27. 
TengKai Yu, D.T. Lee and ShihMing Chang, "MultiParty kMeans Clustering with Privacy Consideration," Proc. Int'l Symposium on Parallel and Distributed Processing with Applications (ISPA10), IEEE, pages 200207, Taipei, Taiwan, September 2010. ::: ::: 
28. 
IHong Jhuo and D. T. Lee, "Boosted Multiple Kernel Learning for Scene Category Recognition," Proc. Twentieth Conf. of the Int'l Assoc. for Pattern Recognition, Lecture Notes in Computer Science, Istanbul, Turkey, August 2010. ::: ::: 
29. 
YuHsuan Su, ChingChi Lin and D. T. Lee, "Broadcasting in Heterogeneous Tree Networks," Proc. 16th Annual International Computing and Combinatorics Conference (COCOON 2010), Lecture Notes in Computer Science, Springer, Nha Trang, Vietnam, July 2010. ::: ::: 
30. 
T.C. Lin and D. T. Lee, "Optimal Randomized Algorithm for the Density Selection Problem," Proc. 20th International Symposium on Algorithms and Computation, Lecture Notes on Computer Science, Lecture Notes in Computer Science, volume 5878, pages 10041013, Hawaii, USA, December 2009. ::: ::: 
31. 
Dae Young Seo, D. T. Lee and T.C. Lin, "Geometric Minimum Diameter Minimum Cost Spanning Problem," Proc. 20th International Symposium on Algorithms and Computation, Lecture Notes on Computer Science, Lecture Notes in Computer Science, volume 5878, pages 283292, Hawaii, USA, December 2009. ::: ::: 
32. 
TeChin Chu, Tsunglin Liu, D.T. Lee, Greg C. Lee, and Arthur ChunChieh Shih, "Analyzing the breakpoint regions of genomic rearrangement events at nucleotide level by sequence alignment," The 10th International Conference on Systems Biology, 2009, poster 
33. 
J. D. Wei, T. Y. Chen, T.Y. Tung and D. T. Lee, "Integration of a Concept Map Generator and a KnowledgePortalBased ELearning System," Proc. 2009 World Congress on Computer Science and Information Engineering (CSIE 2009), IEEE Computer Society Washington, DC, USA, pages 356360, 2009. ::: 
34. 
Y.C. Wang, C.J. Chien and D.T. Lee, "A Fuzzy Neural Network Direct Adaptive Iterative Learning Controller for Robot Manipulators," 17th IFAC World Congress, 2008. 
35. 
Y.C. Wang, C.J. Chien and D.T. Lee, "An Output Recurrent Fuzzy Neural Network Based Iterative Learning Control for Nonlinear Systems," 2008 IEEE World Congress on Computational Intelligence (WCCI 2008), 2008. 
36. 
K. L. Yu, C. S. Liao and D. T. Lee., "Maximizing the Number of Independent Labels in the Plane," Proc. Int'l Frontiers of Algorithmics WorkShop, Lecture Notes in Computer Science, volume 4613, pages 136147, Lanzhou, China, August 2007. ::: ::: 
37. 
J. D. Wei, T. Y. Chen, T. Y. Tung and D. T. Lee, "A Visualization Tool to Construct the ReferenceBased Relation Map for Group Knowledge of a Knowledge Portal," Proc. Int'l Conference on Information Reuse and Integration, (IRI 2007)., pages 304310, Las Vegas, Nevada, August 2007. ::: 
38. 
T. K. Yu and D. T. Lee, "Time Convex Hull with a Highway," Proc. 4th ISVD Int'l Symp. Voronoi Diagrams in Science and Engineering (ISVD 2007), IEEE Computer Society Washington, DC, USA, pages 240250, Wales, UK, July 2007. ::: ::: 
39. 
J. D. Wei, T. Y. Tung, T. Y. Chen and D. T. Lee, "Integration of Knowledge Management and ELearning  An Implementation towards Learning by Teaching," Proc. 2007 Int'l Conference on Information and Knowledge Engineering (IKE'07), CSREA Press, pages 414420, Las Vegas, Nevada, June 2007. 
40. 
TienChing Lin and D. T. Lee, "Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem," Proc. 17th Int'l Symp. Algorithms and Computation (ISAAC 2006), Lecture Notes in Computer Science, volume 4288, Springer Berlin / Heidelberg, pages 460473, Kolkata, India, December 2006, Research supported in part by the National Science Council under the Grants No. NSC942213E001004, NSC952221E001016MY3, and NSC 942752E002005PAE, and by the Taiwan Information Security Center (TWISC), National Science Council under the Grant No. NSC943114P001001Y. ::: 
41. 
J. D. Wei and D. T. Lee, "Prioritybased Genetic Local Search and its Application to the Traveling Salesman Problem," Proc. Sixth Int'l Conference on Simulated Evolution and Learning (SEAL'06), pages 424432, Hefei, China, October 2006. 
42. 
M. Y. Chen, J. D. Wei, J. H. Huang and D. T. Lee, "Design and Applications of an Algorithm Benchmark System in a Computational Problem Solving," Proc. 11th Annual Conference on Innovation and Technology in Computer Science Education, pages 123127, Bologna, Italy, June 2006. 
43. 
M. H. Tsai, J. D. Wei, J. H. Huang and D. T. Lee, "A Portable Geometric Algorithm Visualization System with Dynamic Camera Positioning for Tracking 3D Objects," ACM Symp on Computational Geometry, pages 479480, Sedona, Arizona, June 2006. 
44. 
T. C. Lin and D. T. Lee, "Randomized Algorithm for the Sum Selection," 16th Int'l Symp. on Algorithms and Computation, Hainan, China, December 2005. 
45. 
Arthur ChunChieh Shih, D.T. Lee, Laurent Lin, ChinLin Peng, ShiangHeng Chen, ChunYi Wong, MengYuan Chou, and TzeChan, "SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results," IEEE Computational Systems Bioinformatics Conference, pages 269270, Stanford University, California, August 2005. 
46. 
C. S. Liao and D. T. Lee, "Power domination problem in graphs," 11th International Computing and Combinatorics Conference 2005, Lecture Notes in Computer Science, Aug. 1619, 2005 Kunming, Yunnan, China, August 2005. ::: 
47. 
Y. L. Lin, J. D. Wei, G. C. Lee and D. T. Lee, "A visualization tool for the sitemap of a knowledge portal and the concept map of group knowledge," 5th Int'l Conference on Knowledge Management, Graz, Austria, June 2005. 
48. 
Y. C. Wang, C. J. Chien and D. T. Lee, "An Adaptive PIDType Iterative Learning Controller for Unknown Nonlinear Systems," 8th Int'l Conf. on Control, Automation, Robotics and Vision, Kunming, China, December 2004. 
49. 
Y. W. Huang, C. H. Tsai, D. T. Lee and S. Y. Kuo, "NonDetrimental Web Application Security Auditing," 15th IEEE International Symposium on Software Reliability Engineering (ISSRE2004), Rennes and SaintMalo, France, November 2004. 
50. 
D. T. Lee, C. S. Liao and W. B. Wang, "Timebased Voronoi Diagrams," International Symposium on Voronoi Diagrams in Science and Engineering, pages 229243, Tokyo, Japan, September 2004. 
51. 
F. T. Lin, S. H. Lin and D. T. Lee, "A Cellular Automata Based Urban Development Simulation for Taipei Metropolitan Area," Association of European Schools of Planning (AESOP), 2004 Congress, Grenoble, France, July 2004. 
52. 
J. D. Wei and D. T. Lee, "A New Approach to the Traveling Salesman Problem using Genetic Algorithms with Priority Encoding," 2004 IEEE Congress on Evolutionary Computation, volume 2, pages 14571464, Portland, Oregon, USA, June 2004. 
53. 
Y. W. Huang, F. Yu, C. Hang, C. H. Tsai, D. T. Lee and S. Y. Kuo, "Verifying Web Applications Using Bounded Model Checking," 2004 International Conference on Dependable Systems and Networks (DSN2004), pages 199208, Florence, Italy, June 2004. 
54. 
Y. W. Huang, F. Yu, C. Hang, C. H. Tsai, D. T. Lee and S. Y. Kuo, "Securing Web Application Code by Static Analysis and Runtime Protection," 13th International World Wide Web Conference (WWW2004), pages 4052, New York, May 2004, Best Paper RunnersUp. http://www.www2004.org/awards.htm 
55. 
AnnTzung Cheng, ChunHsin Wu, JanMing Ho and D. T. Lee, "Secure Transparent Mobile IP for Intelligent Transportation Systems," 2004 IEEE Inter. Conf. On Networking, Sensing and Control (IEEE ICNCS'04), Taipei, Taiwan, March 2004. ::: 
56. 
T. Y. Ho, Y. W. Chang, S. J. Chen and D. T. Lee, "A Fast Crosstalk and PerformanceDriven Multilevel Routing System," Int'l Conference on ComputerAided Design (ICCAD), San Jose, CA., November 2003. 
57. 
ChunHsin Wu , DaChun Su , Justin Chang , ChiaChen Wei , JanMing Ho , KweiJay Lin , and D. T. Lee, "An Advanced Traveler Information System with Emerging Network Technologies," the 6th AsiaPacific Intelligent Transportation Systems Forum, Taipei, Taiwan, October 2003, its ::: 
58. 
T. K. Yu and D. T. Lee, "The Extension and Contraction Rules of Graceful Trees," IndonesiaJapan Joint Conference on Combinatorial Geometry and Graph Theory, Bandung, Indonesia, September 2003. 
59. 
E. Papadopoulou and D. T. Lee, "The MinMax Voronoi Diagram of Polygons and Applications in VLSI Manufacturing," Int'l Symp on Algorithms and Computation, Lecture Notes in Computer Science, 2518, pages 511522, Vancouver, Canada, November 2002. 
60. 
D. T. Lee, S. J. Shiah, C. M. Lee and C. H. Wu, "Intelligent Control of Electric Scooters," IASTED Int'l Conference on Intelligent Systems and Control (ISC 2002), Tsukuba, Japan, October 2002. 
61. 
C. H. Wu, A. T. Cheng, S. T. Lee, J. M. Ho and D. T. Lee, "Bidirectional route optimization in mobile IP over wireless LAN," 54th IEEE Semiannual Vehicular Technology Conf., Vancouver, Canada, September 2002. 
62. 
ChunHsin Wu, AnnTzung Cheng, ShaoTing Lee, JanMing Ho and DerTsai Lee, "Bidirectional Route Optimization in Mobile IP over Wireless LAN Networks," 56th IEEE Semiannual Vehicular Technology Conference, volume 2, pages 11681172, September 2002, wireless 
63. 
D. T. Lee and S. H. Teng, "Algorithms and Computation," Int'l Symp on Algorithms and Computation, Lecture Notes in Computer Science, 1969, Taipei, Taiwan, December 2000. 
64. 
L. H. Lin, D. T. Lee and K. Aoki, "DAViD: A Distributed Algorithm Visualization and Debugging System for Geometric Computing," 3rd Int'l Conf. Human and Computer 2000, Japan, September 2000, Univ. of Aizu and Waseda Univ. 
65. 
J. M. Ho, S. K. Huang and D. T. Lee, "Content Management of Academia Sinica Digital Library," 3rd International Conference on Sinology, Academia Sinica, Taiwan, June 2000. 
66. 
J.M. Ho, S.K. Huang, and D.T. Lee, "Content Management of Academia Sinica Digital Library," The Third International conference on Sinology, Academia Sinica,Taiwan, June 2000, dl 
67. 
K. Aoki and D. T. Lee, "A WebBased Distributed Programming Environment," 8th Int'l Conference on High Performance Computing and Networking Europe, Amsterdam, Netherlands, May 2000. 
68. 
S. M. Mok, C. H. Wu and D. T. Lee, "A System for Analyzing Automatic Assembly and Disassembly Operations," IEEE Int'l Conf. on Robotics and Automation, San Francisco, CA, January 2000. 
69. 
S. L. Chang, C. H. Wu and D. T. Lee, "A Muscularlike Compliance Control for Active Vehicle Suspension," IEEE Int'l Conf. on Robotics and Automation, Detroit, MI, January 1999. 
70. 
D. T. Lee and C. F. Shen, "The Steiner Minimal Tree Problem in the λgeometry Plane," Int'l Symp on Algorithms and Computation, pages 247255, Osaka, Japan, December 1996. 
71. 
C. H. Wu, S. L. Chang and D. T. Lee, "A Study of Neuromuscularlike Control in Rehabilitation Robot," IEEE Int'l Conf. Robotics and Automation, pages 11781183, Minneapolis, MN, January 1996. 
72. 
T. S. Hsu, K. H. Tsai, D. W. Wang and D. T. Lee, "Steiner Problem on Directed Acyclic Graphs," Proc. the Second Annual International Conference on Computing and Combinatorics (SAICCC 1996), Lecture Notes in Computer Science, volume 1090, pages 2130, 1996. 
73. 
D. T. Lee, C. F. Shen and C. L. Ding, "On Steiner Tree Problem with 45° Routing," Prof. IEEE Int’l Symp. on Circuits and Systems, pages 19601982, May 1995. 
74. 
JanMing Ho, D. T. Lee, C. H. Chang and C. K. Wong, "BoundedDiameter Spanning Tree and Related Problems," Proc. of the Fifth ACM Symp on Computational Geometry, June 1989, cg 


Technical Reports  
1. 
A. C. C. Shih, D. T. Lee, C. F. Chin, H. Y. M. Liao and W. H. Li, Technical Report, "Palindromelike Patterns in Genomes," number TRIIS04019, Institute of Information Science, Academia Sinica November 2004. 


Book & Book Chapters  
1. 
李德財、高天助、吳建興、張心玲,, chapter "資安發展與新興應用趨勢," 中國電機工程學會80週年紀念專刊, 資訊領域篇 何寶中, editor, pages 381390, 中國電機工程學會, December 2014. 
2. 
Franz Aurenhammer, Rolf Klein and DerTsai Lee, "Voronoi Diagrams and Delaunay Triangulations," World Scientific Publishing Co., 2013. 
3. 
D. T. Lee,, chapter "Computational Geometry I & II," Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques, Mikhail J. Atallah and Marina Blanton, editor, Applied Algorithms and Data Structures,, Second volume 2, pages 1.1 ~ 1.32 & 2.1 ~ 2.31, Chapman & Hall /CRC, 2010. 
4. 
D. T. Lee,, chapter "Interval, segment, range and priority search trees," The Handbook of Data Structures and Applications, Dinesh P. Mehta and Sartaj Sahni, editor, pages 181 ~ 1821, Chapman & Hall/CRC Computer and Information Science Series, 2005. 
5. 
D. T. Lee, S. P. Shieh and J. D. Tygar, "Computer Security in the 21st Century," D. T. Lee and S. P. Shieh and J. D. Tygar, editors, Springer Science+Business Media, New York, 2005. 
6. 
Y. W. Huang and D. T. Lee,, chapter "Web application securitypast, present, and future in Computer Security in the 21st Century," Computer Security in the 21st Century, D. T. Lee and S. P. Shieh and J. D. Tygar, editors, pages 183227, Springer Science+Business Media, Inc., New York, NY, 2005. 
7. 
D. T. Lee, et al,, chapter "中央研究院資訊研究所發展現況與展望The stateoftheart and prospect of information science & engineering research of the Academia Sinica," 資訊世紀全集IT in Taiwan, 資訊傳真公司, editor, pages 6671, 開放時代通訊社, January 2000, [Book Chapter] 
8. 
D. T. Lee,, chapter "Computational Geometry I & II," Algorithms & Theory of Computation Handbook, M. J. Atallah, editor, pages 19:129, 20:131, CRC Press, 1999. 
9. 
D. T. Lee,, chapter "Geometric Algorithm Visualization, Current Status and Future," Applied Computational Geometry, M. Lin and D. Manocha, editor, volume LNCS 1148, pages 4550, SpringerVerlag, 1996. 
10. 
D. T. Lee,, chapter "Computational Geometry," The Computer Science and Engineering Handbook, A. B. Tucker, editor, pages 111140, CRC Press, 1996. 
11. 
M. Sarrafzadeh and D. T. Lee, "Algorithmic Aspects of VLSI Layout," M. Sarrafzadeh and D. T. Lee, editor, World Scientific Publishing Co., Singapore, 1993. 
12. 
D. T. Lee and I. M. Chen,, chapter "Display of Visible Edges of a Set of Convex Polygons," Computational Geometry, G. T. Toussaint, editor, pages 249265, NorthHolland, 1985. 
13. 
M. Schlag, F. Luccio, P. Maestrini, D. T. Lee and C. K. Wong,, chapter "A Visibility Problem in VLSI Layout Compaction," Advances in Computing Research, F. P. Preparata, editor, volume 2, pages 259282, JAI Press Inc., 1984. 
14. 
D. T. Lee,, chapter "Maximum Clique Problem of Rectangle Graphs," Advances in Computing Research, F.P. Preparata, editor, volume 1, pages 91107, JAI Press Inc., 1983. 


Others  
1. 
ChiaMu Yu, ChengChung Li, ChunShien Lu, DerTsai Lee, and SyYen Kuo, "Attack Probability Based Deterministic Key Predistribution Mechanism for NonUniform Sensor Deployment,", The 3rd Workshop on Wireless Ad Hoc and Sensor Networks July 2007, (最佳論文獎) 











