| 2017 | ISAAC | Tight Approximation for Partial Vertex Cover with Hard Capacities. | Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee |
| 2016 | ICPR | A feature fusion framework for hashing. | I-Hong Jhuo, Li Weng, Wen-Huang Cheng, D. T. Lee |
| 2016 | ISAAC | O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. | Mong-Jen Kao, Hai-Lun Tu, D. T. Lee |
| 2014 | ACCV | Unsupervised Feature Learning for RGB-D Image Classification. | I-Hong Jhuo, Shenghua Gao, Liansheng Zhuang, D. T. Lee, Yi Ma |
| 2014 | DAC | An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. | Chun-Xun Lin, Chih-Hung Liu, I-Che Chen, D. T. Lee, Tsung-Yi Ho |
| 2014 | ICPR | Video Event Detection via Multi-modality Deep Learning. | I-Hong Jhuo, D. T. Lee |
| 2014 | STACS | Online Dynamic Power Management with Hard Real-Time Guarantees. | Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner |
| 2013 | SODA | Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. | Chih-Hung Liu, D. T. Lee |
| 2013 | WADS | Optimal Time-Convex Hull under the L p Metrics. | Bang-Sin Dai, Mong-Jen Kao, D. T. Lee |
| 2012 | AINA | Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices. | Tsai-Yeh Tung, Laurent Lin, D. T. Lee |
| 2012 | CVPR | Robust visual domain adaptation with low-rank reconstruction. | I-Hong Jhuo, Dong Liu, D. T. Lee, Shih-Fu Chang |
| 2012 | DAC | An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. | Chih-Hung Liu, I-Che Chen, D. T. Lee |
| 2011 | AAAI | Multiple-Instance Learning: Multiple Feature Selection on Instance Representation. | I-Hong Jhuo, D. T. Lee |
| 2011 | COCOON | The Density Maximization Problem in Graphs. | Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner |
| 2011 | ESA | An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. | Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee |
| 2011 | ISAAC | Capacitated Domination: Constant Factor Approximations for Planar Graphs. | Mong-Jen Kao, D. T. Lee |
| 2011 | ISAAC | Finding Maximum Sum Segments in Sequences with Uncertainty. | Hung-I Yu, Tien-Ching Lin, D. T. Lee |
| 2010 | COCOON | Broadcasting in Heterogeneous Tree Networks. | Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee |
| 2010 | ICPR | Boosted Multiple Kernel Learning for Scene Category Recognition. | I-Hong Jhuo, D. T. Lee |
| 2010 | ISAAC | Spanning Ratio and Maximum Detour of Rectilinear Paths in the | Ansgar Grne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon |
| 2010 | ISPA | Multi-party k-Means Clustering with Privacy Consideration. | Teng-Kai Yu, D. T. Lee, Shih-Ming Chang, Justin Zhan |
| 2010 | MMM | Scene Location Guide by Image-Based Retrieval. | I-Hong Jhuo, Tsuhan Chen, D. T. Lee |
| 2009 | ISAAC | Optimal Randomized Algorithm for the Density Selection Problem. | Tien-Ching Lin, D. T. Lee |
| 2009 | ISAAC | Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. | Dae-Young Seo, D. T. Lee, Tien-Ching Lin |
| 2007 | FAW | Maximizing the Number of Independent Labels in the Plane. | Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee |
| 2007 | IKE | Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching. | Jyh-Da Wei, Tsai-Yeh Tung, Tai-Yu Chen, D. T. Lee |
| 2007 | IRI | A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal. | Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee |
| 2006 | ISAAC | Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. | Tien-Ching Lin, D. T. Lee |
| 2006 | ITiCSE | Design and applications of an algorithm benchmark system in a computational problem solving environment. | Ming-Yu Chen, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee |
| 2005 | ISAAC | Randomized Algorithm for the Sum Selection Problem. | Tien-Ching Lin, D. T. Lee |
| 2004 | CEC | A new approach to the traveling salesman problem using genetic algorithms with priority encoding. | Jyh-Da Wei, D. T. Lee |
| 2004 | DSN | Verifying Web Applications Using Bounded Model Checking. | Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo |
| 2004 | ICARCV | An adaptive PID-type iterative learning controller unknown nonlinear systems. | Ying-Chung Wang, Chiang-Ju Chien, D. T. Lee |
| 2004 | ISSRE | Non-Detrimental Web Application Security Scanning. | Yao-Wen Huang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo |
| 2003 | ICCAD | A Fast Crosstalk- and Performance-Driven Multilevel Routing System. | Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee |
| 2002 | ISAAC | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. | Evanthia Papadopoulou, D. T. Lee |
| 2000 | ICRA | A System for Analyzing Automatic Assembly and Disassembly Operations. | Swee M. Mok, Chi-haur Wu, D. T. Lee |
| 1999 | ICRA | A Muscular-Like Compliance Control for Active Vehicle Suspension. | Shih-Lang Chang, Chi-haur Wu, D. T. Lee |
| 1997 | ISAAC | A Faster One-Dimensional Topological Compaction Algorithm. | Hsiao-Feng Steven Chen, D. T. Lee |
| 1996 | COCOON | Steiner Problems on Directed Acyclic Graphs. | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee |
| 1996 | ISAAC | The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. | D. T. Lee, C. F. Shen |
| 1996 | ICRA | A study of neuromuscular-like control in rehabilitation robot. | Chi-haur Wu, Shih-Lang Chang, D. T. Lee |
| 1995 | ESA | Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). | Evanthia Papadopoulou, D. T. Lee |
| 1995 | ISCAS | On Steiner Tree Problem with 45 Degree Routing. | D. T. Lee, Chin-Fang Shen, Cheng-Liang Ding |
| 1994 | ISAAC | k-Best Cuts for Circular-Arc Graphs. | Kuo-Hui Tsai, D. T. Lee |
| 1993 | ESA | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. | Mikhail J. Atallah, Danny Z. Chen, D. T. Lee |
| 1992 | ISAAC | Rectilinear Paths among Rectilinear Obstacles. | D. T. Lee |
| 1992 | ISAAC | Rstricted Track Assignment with Applications. | Majid Sarrafzadeh, D. T. Lee |
| 1991 | WADS | On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. | Chung-Do Yang, D. T. Lee, C. K. Wong |
| 1990 | SODA | An Optimal Algorithm for the Maximum Two-Chain Problem. | Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee |
| 1990 | SEKE | Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System. | John C. C. Hsueh, D. T. Lee |
| 1987 | SIGGRAPH | An efficient new algorithm for 2-D line clipping: Its development and analysis. | Tina M. Nicholl, D. T. Lee, Robin A. Nicholl |
| 1986 | MFCS | Geometric Location Problems and Their Complexity. | D. T. Lee |
| 1984 | STACS | Computing the Largest Empty Rectangle. | Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee |
| 1983 | FOCS | The Power of Geometric Duality | Bernard Chazelle, Leonidas J. Guibas, D. T. Lee |
| 1981 | SIGGRAPH | Shading of regions on vector display devises. | D. T. Lee |
| 1981 | WG | Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. | D. T. Lee, Franco P. Preparata |
| 1976 | STOC | Location of a Point in a Planar Subdivision and its Applications | D. T. Lee, Franco P. Preparata |