Page 47 - 2017 Brochure
P. 47
President & Computer Science Chair Professor, National Chung Hsing University, Taichung, Taiwan (2011-2015)
• Distinguished Research Fellow (1998-present) & Director, Institute of Information Science, Academia Sinica (1998-2008)
• Assistant Professor (1978), Associate Professor (1981), Professor (1986-99), EECS, Northwestern University
• Program Director, Division of Computer and Computation Research, National Science Foundation (1989-90)
• Alumni Award for Distinguished Service, College of Engineering, University of Illinois at Urbana-Champaign, (2017)
• Distinguished Alumni Educator Award, Department of Computer Science, University of Illinois at Urbana-Champaign, (2014)
• Humboldt Research Award (2007), Ambassador Scientist, Alexander von Humboldt Foundation, Germany (2010-2016)
• Member, The World Academy of Sciences (TWAS, 2008)
• Academician, Academia Sinica (2004)
• Fellow, Association for Computing Machinery (1997), Institute of Electrical and Electronic Engineers (1992)
• Editor, Algoritmica, International Journal of Computational Geometry & Applications, International Journal of Information and Computer
Security; Series Editor, Lecture Notes Series on Computing, World Scientific Publishing Co., Inc.
• Ph.D. (1978), M.S. (1976), Computer Science, University of Illinois at Urbana-Champaign, B.S. (1971), EE, National Taiwan
University
Publications 11. C .X. Lin, C.H. Liu, I.C. Chen, D.T. Lee, and T.Y. Ho, “An
Efficient Bi-criteria Flow Channel Routing Algorithm for Flow-
1. Y.W. Huang, C.H. Tsai, T.P. Lin, S.K. Huang, D.T. Lee and based Microfluidic Biochips,” Proc. IEEE/ACM DAC, 141: 1-6,
S.Y. Kuo, “A Testing Framework for Web Application Security San Francisco, 2014.
Assessment,” Computer Networks, Vol.48, No.5, pp. 739-761,
June 2005. 12. J.J. Chen, M.J. Kao, D.T. Lee, I. Rutter, and D. Wagner,
“Online Dynamic Power Management with Hard Real-Time
2. D. T. Lee, S. P. Shieh and J. D. Tygar (Eds), Computer Security Guarantees,” Theoretical Comput. Sci., 595: 46-64, 2015.
in the 21st Century, Springer-Verlag, 2005.
13. C .H. Liu, E. Papadopoulou, and D.T. Lee, “The k-Nearest
3. T.C. Lin and D.T. Lee, “Randomized Algorithm for the Sum Neighbor Voronoi Diagram Revisited,” Algorithmica, 71(2):
Selection Prob- lem,” Theoretical Comput. Sci., Vol.377, No.1- 429-449, 2015.
3, pp. 151-156, May 2007.
14. M .J. Kao, H.L. Chen, and D.T. Lee, “Capacitated Domination:
4. D.T. Lee, T.C. Lin and H.I. Lu, “Fast Algorithms for the Problem Complexity and Approximation Algorithms,”
Density Finding Problem,” Algorithmica, Vol.53, No.3, pp. 298- Algorithmica, 72(1): 1-43, 2015.
313, Feb., 2009.
15. B .-S. Dai, Mong-Jen Kao and D.T. Lee, “Optimal Time-
5. T.C. Lin and D.T. Lee, “Effcient Algorithms for the Sum Convex Hull for a Straight-Line Highway in Lp-Metrics,”
Selection Prob- lem and k Maximum Sums Problem,” Computational Geometry: Theory and Applications, volume 53,
Theoretical Comput. Sci., Vol.411, No.7-9 pp. 986-994, Feb. pages 1-20, 2016.
2010.
16. Y .H. Su, C.C. Lin, and D.T. Lee, “Broadcasting in Weighted
6. M.J. Kao, C.S. Liao and D.T. Lee, “Capacitated Domination Trees under the Postal Model,” Theoretical Comput. Sci., 621:
Problem,” Algorithmica, Vol.60, No.2, pp. 274-300, July 2011. 73-81, 2016.
7. C. Wulff-Nilsen, A. Grüne, R. Klein, E. Langetepe, D.T. Lee, 17. H .I. Yu, T.C. Lin, and D. T. Lee, “The (1|1)-Centroid Problem
T.C. Lin, S.H. Poon, and T.K. Yu, “Computing the Stretch on the Plane Concerning Distance Constraints,” Proc. 27th Int’l
Factor and Maximum Detour of Paths, Trees, and Cycles Symp. Algorithms and Computation, Dec. 12-14, 2016, Sydney,
in the Normed Space,” Int’l J. Computational Geometry & Australia.
Applications, pp. 45-60, Feb. 2012.
18. M .J. Kao, H.L Tu, and D.T. Lee, “O(f) Bi-approximation for
8. C.H. Liu, S.Y. Kuo, D.T. Lee, C.S. Lin, J.H. Weng, and Capacitated Covering with Hard Capacities,” Proc. 27th Int’l
S.Y. Yuan, “Obstacle-Avoiding Rectilinear Steiner Tree Symp. Algorithms and Computation, Dec. 12-14, 2016, Sydney,
Construction: A Steiner-Point Based Algorithm,” IEEE Trans. Australia.
Computer-Aided Design, pp.1050-1060, July 2012.
9. M.J. Kao, B. Katz, M. Krug, D.T. Lee, I. Rutter, D. Wagner, “T
he Density Maximization Problem in Graphs,” J. Combinatorial
Optimization, pp. 723-754, Nov. 2013.
10. F . Aurenhammer, R. Klein and D.T. Lee, Voronoi Diagrams
and Delaunay Triangulations, World Scientific Publishing,
2013.
45
• Distinguished Research Fellow (1998-present) & Director, Institute of Information Science, Academia Sinica (1998-2008)
• Assistant Professor (1978), Associate Professor (1981), Professor (1986-99), EECS, Northwestern University
• Program Director, Division of Computer and Computation Research, National Science Foundation (1989-90)
• Alumni Award for Distinguished Service, College of Engineering, University of Illinois at Urbana-Champaign, (2017)
• Distinguished Alumni Educator Award, Department of Computer Science, University of Illinois at Urbana-Champaign, (2014)
• Humboldt Research Award (2007), Ambassador Scientist, Alexander von Humboldt Foundation, Germany (2010-2016)
• Member, The World Academy of Sciences (TWAS, 2008)
• Academician, Academia Sinica (2004)
• Fellow, Association for Computing Machinery (1997), Institute of Electrical and Electronic Engineers (1992)
• Editor, Algoritmica, International Journal of Computational Geometry & Applications, International Journal of Information and Computer
Security; Series Editor, Lecture Notes Series on Computing, World Scientific Publishing Co., Inc.
• Ph.D. (1978), M.S. (1976), Computer Science, University of Illinois at Urbana-Champaign, B.S. (1971), EE, National Taiwan
University
Publications 11. C .X. Lin, C.H. Liu, I.C. Chen, D.T. Lee, and T.Y. Ho, “An
Efficient Bi-criteria Flow Channel Routing Algorithm for Flow-
1. Y.W. Huang, C.H. Tsai, T.P. Lin, S.K. Huang, D.T. Lee and based Microfluidic Biochips,” Proc. IEEE/ACM DAC, 141: 1-6,
S.Y. Kuo, “A Testing Framework for Web Application Security San Francisco, 2014.
Assessment,” Computer Networks, Vol.48, No.5, pp. 739-761,
June 2005. 12. J.J. Chen, M.J. Kao, D.T. Lee, I. Rutter, and D. Wagner,
“Online Dynamic Power Management with Hard Real-Time
2. D. T. Lee, S. P. Shieh and J. D. Tygar (Eds), Computer Security Guarantees,” Theoretical Comput. Sci., 595: 46-64, 2015.
in the 21st Century, Springer-Verlag, 2005.
13. C .H. Liu, E. Papadopoulou, and D.T. Lee, “The k-Nearest
3. T.C. Lin and D.T. Lee, “Randomized Algorithm for the Sum Neighbor Voronoi Diagram Revisited,” Algorithmica, 71(2):
Selection Prob- lem,” Theoretical Comput. Sci., Vol.377, No.1- 429-449, 2015.
3, pp. 151-156, May 2007.
14. M .J. Kao, H.L. Chen, and D.T. Lee, “Capacitated Domination:
4. D.T. Lee, T.C. Lin and H.I. Lu, “Fast Algorithms for the Problem Complexity and Approximation Algorithms,”
Density Finding Problem,” Algorithmica, Vol.53, No.3, pp. 298- Algorithmica, 72(1): 1-43, 2015.
313, Feb., 2009.
15. B .-S. Dai, Mong-Jen Kao and D.T. Lee, “Optimal Time-
5. T.C. Lin and D.T. Lee, “Effcient Algorithms for the Sum Convex Hull for a Straight-Line Highway in Lp-Metrics,”
Selection Prob- lem and k Maximum Sums Problem,” Computational Geometry: Theory and Applications, volume 53,
Theoretical Comput. Sci., Vol.411, No.7-9 pp. 986-994, Feb. pages 1-20, 2016.
2010.
16. Y .H. Su, C.C. Lin, and D.T. Lee, “Broadcasting in Weighted
6. M.J. Kao, C.S. Liao and D.T. Lee, “Capacitated Domination Trees under the Postal Model,” Theoretical Comput. Sci., 621:
Problem,” Algorithmica, Vol.60, No.2, pp. 274-300, July 2011. 73-81, 2016.
7. C. Wulff-Nilsen, A. Grüne, R. Klein, E. Langetepe, D.T. Lee, 17. H .I. Yu, T.C. Lin, and D. T. Lee, “The (1|1)-Centroid Problem
T.C. Lin, S.H. Poon, and T.K. Yu, “Computing the Stretch on the Plane Concerning Distance Constraints,” Proc. 27th Int’l
Factor and Maximum Detour of Paths, Trees, and Cycles Symp. Algorithms and Computation, Dec. 12-14, 2016, Sydney,
in the Normed Space,” Int’l J. Computational Geometry & Australia.
Applications, pp. 45-60, Feb. 2012.
18. M .J. Kao, H.L Tu, and D.T. Lee, “O(f) Bi-approximation for
8. C.H. Liu, S.Y. Kuo, D.T. Lee, C.S. Lin, J.H. Weng, and Capacitated Covering with Hard Capacities,” Proc. 27th Int’l
S.Y. Yuan, “Obstacle-Avoiding Rectilinear Steiner Tree Symp. Algorithms and Computation, Dec. 12-14, 2016, Sydney,
Construction: A Steiner-Point Based Algorithm,” IEEE Trans. Australia.
Computer-Aided Design, pp.1050-1060, July 2012.
9. M.J. Kao, B. Katz, M. Krug, D.T. Lee, I. Rutter, D. Wagner, “T
he Density Maximization Problem in Graphs,” J. Combinatorial
Optimization, pp. 723-754, Nov. 2013.
10. F . Aurenhammer, R. Klein and D.T. Lee, Voronoi Diagrams
and Delaunay Triangulations, World Scientific Publishing,
2013.
45
