D. T. Lee

Chung-Shou Liao, D. T. Lee: Power Domination in Circular-Arc Graphs. Algorithmica 65(2): 443-466 (2013)

Chih-Hung Liu, D. T. Lee: Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. SODA 2013: 1633-1645

Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner: Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013)

Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner: Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013)

Bang-Sin Dai, Mong-Jen Kao, D. T. Lee: Optimal Time-Convex Hull under the Lp Metrics. CoRR abs/1304.7833 (2013)

Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu: Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geometry Appl. 22(1): 45-60 (2012)

Chih-Hung Liu, Sy-Yen Kuo, D. T. Lee, Chun-Syun Lin, Jung-Hung Weng, Shih-Yi Yuan: Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. IEEE Trans. on CAD of Integrated Circuits and Systems 31(7): 1050-1060 (2012)

Tsai-Yeh Tung, Laurent Lin, Der-Tsai Lee: Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices. AINA Workshops 2012: 720-725

I-Hong Jhuo, Dong Liu, D. T. Lee, Shih-Fu Chang: Robust visual domain adaptation with low-rank reconstruction. CVPR 2012: 2168-2175

Chih-Hung Liu, I.-Che Chen, D. T. Lee: An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. DAC 2012: 613-622

Guangnan Ye, I-Hong Jhuo, Dong Liu, Yu-Gang Jiang, D. T. Lee, Shih-Fu Chang: Joint audio-visual bi-modal codewords for video event detection. ICMR 2012: 39

Wei-Chun Chung, Chi-Jen Wu, Chin-Fu Ku, Der-Tsai Lee, Jan-Ming Ho: DR. ION: Disaster rescue over information-oriented network. SOCA 2012: 1-4

Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner: Higher Order City Voronoi Diagrams. SWAT 2012: 59-70

Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee (Eds.): Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, isbn 978-3-642-35260-7

Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner: Higher Order City Voronoi Diagrams. CoRR abs/1204.4374 (2012)

Mong-Jen Kao, Chung-Shou Liao, D. T. Lee: Capacitated Domination Problem. Algorithmica 60(2): 274-300 (2011)

I-Hong Jhuo, D. T. Lee: Multiple-Instance Learning: Multiple Feature Selection on Instance Representation. AAAI 2011

Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner: Connecting Two Trees with Optimal Routing Cost. CCCG 2011

Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner: The Density Maximization Problem in Graphs. COCOON 2011: 25-36

Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee: An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA 2011: 70-81

Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC 2011: 494-503

Hung-I Yu, Tien-Ching Lin, D. T. Lee: Finding Maximum Sum Segments in Sequences with Uncertainty. ISAAC 2011: 734-743

Mong-Jen Kao, D. T. Lee: Capacitated Domination: Constant Factor Approximation for Planar Graphs. CoRR abs/1108.4606 (2011)

Tien-Ching Lin, D. T. Lee: Efficient algorithms for the sum selection problem and k maximum sums problem. Theor. Comput. Sci. 411(7-9): 986-994 (2010)

Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee: Broadcasting in Heterogeneous Tree Networks. COCOON 2010: 368-377

I-Hong Jhuo, D. T. Lee: Boosted Multiple Kernel Learning for Scene Category Recognition. ICPR 2010: 3504-3507

Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon: Spanning Ratio and Maximum Detour of Rectilinear Paths in the L₁ Plane. ISAAC (2) 2010: 121-131

Teng-Kai Yu, D. T. Lee, Shih-Ming Chang, Justin Zhan: Multi-party k-Means Clustering with Privacy Consideration. ISPA 2010: 200-207

I-Hong Jhuo, D. T. Lee: Boosting-based multiple kernel learning for image re-ranking. ACM Multimedia 2010: 1159-1162

I-Hong Jhuo, Tsuhan Chen, D. T. Lee: Scene Location Guide by Image-Based Retrieval. MMM 2010: 196-206

Der-Tsai Lee, Danny Z. Chen, Shi Ying (Eds.): Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings. Lecture Notes in Computer Science 6213, Springer 2010, isbn 978-3-642-14552-0

Danny Z. Chen, D. T. Lee: Guest Editors' Forward. Algorithmica 53(2): 155-156 (2009)

D. T. Lee, Tien-Ching Lin, Hsueh-I Lu: Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009)

Te-Chin Chu, Tsunglin Liu, D. T. Lee, Greg C. Lee, Arthur Chun-Chieh Shih: GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events. Bioinformatics 25(17): 2188-2193 (2009)

Danny Z. Chen, D. T. Lee: Editors' Foreword. Int. J. Comput. Geometry Appl. 19(3): 213-214 (2009)

Jyh-Da Wei, Ming-Hung Tsai, Gen-Cher Lee, Jeng-Hung Huang, Der-Tsai Lee: GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing. IEEE Trans. Vis. Comput. Graph. 15(2): 234-248 (2009)

Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee: Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System. CSIE (7) 2009: 356-360

Dae Young Seo, D. T. Lee, Tien-Ching Lin: Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ISAAC 2009: 283-292

Tien-Ching Lin, D. T. Lee: Optimal Randomized Algorithm for the Density Selection Problem. ISAAC 2009: 1004-1013

Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia: Preface. Theor. Comput. Sci. 408(2-3): 97-98 (2008)

Ying-Chung Wang, Chiang-Ju Chien, Der-Tsai Lee: An output recurrent fuzzy neural network based iterative learning control for nonlinear systems. FUZZ-IEEE 2008: 1563-1569

Ying-Chung Wang, Chiang-Ju Chien, Der-Tsai Lee: Reinforcement fuzzy-neural adaptive iterative learning control for nonlinear systems. ICARCV 2008: 733-738

Tzong-Chen Wu, Chin-Laung Lei, Vincent Rijmen, Der-Tsai Lee (Eds.): Information Security, 11th International Conference, ISC 2008, Taipei, Taiwan, September 15-18, 2008. Proceedings. Lecture Notes in Computer Science 5222, Springer 2008, isbn 978-3-540-85884-3

Chun-Nan Hsu, Jin-Mei Lai, Chia-Hung Liu, Huei-Hun Tseng, Chih-Yun Lin, Kuan-Ting Lin, Hsu-Hua Yeh, Ting-Yi Sung, Wen-Lian Hsu, Li-Jen Su, Sheng-An Lee, Chang-Han Chen, Gen-Cher Lee, D. T. Lee, Yow-Ling Shiue, Chang-Wei Yeh, Chao-Hui Chang, Cheng-Yan Kao, Chi-Ying F. Huang: Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online). BMC Bioinformatics 8 (2007)

Arthur Chun-Chieh Shih, D. T. Lee, Chin-Lin Peng, Yu-Wei Wu: Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences. BMC Bioinformatics 8 (2007)

Tzu-Lun Huang, D. T. Lee: A distributed multicast routing algorithm for real-time applications in wide area networks. J. Parallel Distrib. Comput. 67(5): 516-530 (2007)

Tien-Ching Lin, D. T. Lee: Randomized algorithm for the sum selection problem. Theor. Comput. Sci. 377(1-3): 151-156 (2007)

Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee: Maximizing the Number of Independent Labels in the Plane. FAW 2007: 136-147

Chia-Mu Yu, Cheng-Chung Li, Chun-Shien Lu, Der-Tsai Lee, Sy-Yen Kuo: Attack Probability Based Deterministic Key Predistribution Mechanism for Non-Uniform Sensor Deployment. ICDCS Workshops 2007: 18

Jyh-Da Wei, Tsai-Yeh Tung, Tai-Yu Chen, D. T. Lee: Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching. IKE 2007: 414-420

Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee: A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal. IRI 2007: 304-310

Teng-Kai Yu, D. T. Lee: Time Convex Hull with a Highway. ISVD 2007: 240-250

Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Yu-Wei Wu, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao, Mu-Fen Hsieh: SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools. BMC Bioinformatics 7: 103 (2006)

Tzu-Lun Huang, D. T. Lee: An iterative distributed algorithm for multi-constraint multicast routing. Computer Communications 29(17): 3647-3661 (2006)

Jinn Ho, Wen-Liang Hwang, Henry Horn-Shing Lu, D. T. Lee: Gridding spot centers of smoothly distorted microarray images. IEEE Transactions on Image Processing 15(2): 342-353 (2006)

Ming-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee: A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects. Symposium on Computational Geometry 2006: 479-480

Tien-Ching Lin, D. T. Lee: Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ISAAC 2006: 460-473

Ming-Yu Chen, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee: Design and applications of an algorithm benchmark system in a computational problem solving environment. ITiCSE 2006: 123-127

Jyh-Da Wei, D. T. Lee: Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. SEAL 2006: 424-432

Ferng-Ching Lin, Der-Tsai Lee, Bao-Shuh Paul Lin, Shiuhpyng Shieh, Sushil Jajodia (Eds.): Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, Taipei, Taiwan, March 21-24, 2006. ACM 2006, isbn 1-59593-272-0

Danny Z. Chen, D. T. Lee (Eds.): Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings. Lecture Notes in Computer Science 4112, Springer 2006, isbn 3-540-36925-2

Yao-Wen Huang, Chung-Hung Tsai, Tsung-Po Lin, Shih-Kun Huang, D. T. Lee, Sy-Yen Kuo: A testing framework for Web application security assessment. Computer Networks 48(5): 739-761 (2005)

Yu-Shin Chen, Der-Tsai Lee, Chung-Shou Liao: Labeling Points on a Single Line. Int. J. Comput. Geometry Appl. 15(3): 261-278 (2005)

Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005)

Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee: Crosstalk- and performance-driven multilevel full-chip routing. IEEE Trans. on CAD of Integrated Circuits and Systems 24(6): 869-878 (2005)

Tzu-Lun Huang, D. T. Lee: Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks". IEEE/ACM Trans. Netw. 13(6): 1410-1411 (2005)

Chung-Shou Liao, Der-Tsai Lee: Power Domination Problem in Graphs. COCOON 2005: 818-828

Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao: SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results. CSB Workshops 2005: 269-270

Fang Yu, Chung-Hung Tsai, Yao-Wen Huang, D. T. Lee, Hung-Yau Lin, Sy-Yen Kuo: Efficient Exact Spare Allocation via Boolean Satisfiability. DFT 2005: 361-370

Tien-Ching Lin, D. T. Lee: Randomized Algorithm for the Sum Selection Problem. ISAAC 2005: 515-523

D. T. Lee, Joseph S. B. Mitchell: A note from the editors-in-chief. Int. J. Comput. Geometry Appl. 14(1-2) (2004)

Evanthia Papadopoulou, D. T. Lee: The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geometry Appl. 14(6): 421-452 (2004)

T. K. Yu, D. T. Lee: On the Crossing Distribution Problem in Two Regions. J. Inf. Sci. Eng. 20(1): 1-25 (2004)

Chun-Hsin Wu, Jan-Ming Ho, Der-Tsai Lee: Travel-time prediction with support vector regression. IEEE Transactions on Intelligent Transportation Systems 5(4): 276-281 (2004)

Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo: Verifying Web Applications Using Bounded Model Checking. DSN 2004: 199-208

Ying-Chung Wang, Chiang-Ju Chien, Der-Tsai Lee: An adaptive PID-type iterative learning controller unknown nonlinear systems. ICARCV 2004: 607-612

Yao-Wen Huang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo: Non-Detrimental Web Application Security Scanning. ISSRE 2004: 219-230

Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, Der-Tsai Lee, Sy-Yen Kuo: Securing web application code by static analysis and runtime protection. WWW 2004: 40-52

D. T. Lee: Chief Editor's Notice. Int. J. Comput. Geometry Appl. 13(1): 1-2 (2003)

D. T. Lee, Gen-Cher Lee, Yao-Wen Huang: Knowledge Management for Computational Problem Solving. J. UCS 9(6): 563-570 (2003)

Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee: A Fast Crosstalk- and Performance-Driven Multilevel Routing System. ICCAD 2003: 382-387

Evanthia Papadopoulou, D. T. Lee: The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC 2002: 511-522

Tzu-Lun Huang, D. T. Lee: A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks. ISPAN 2002: 335-340

Kiyoko F. Aoki, D. T. Lee: Towards Web-Based Computing. Int. J. Comput. Geometry Appl. 11(1): 71-104 (2001)

Evanthia Papadopoulou, D. T. Lee: The L_infty-Voronoi Diagram of Segments and VLSI Applications. Int. J. Comput. Geometry Appl. 11(5): 503-528 (2001)

Swee M. Mok, Chi-haur Wu, D. T. Lee: Modeling automatic assembly and disassembly operations for virtual manufacturing. IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(3): 223-232 (2001)

Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee: Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica 26(2): 263-289 (2000)

Hsiao-Feng Steven Chen, D. T. Lee: A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. Algorithmica 28(4): 390-421 (2000)

K. Roy, D. T. Lee: Guest editorial: low-power electronics and design. IEEE Trans. VLSI Syst. 8(3): 233-234 (2000)

Kiyoko F. Aoki, D. T. Lee: A Web-Based Distributed Programming Environment. HPCN Europe 2000: 237-246

Swee M. Mok, Chi-haur Wu, D. T. Lee: A System for Analyzing Automatic Assembly and Disassembly Operations. ICRA 2000: 3695-3700

D. T. Lee, Shang-Hua Teng (Eds.): Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Lecture Notes in Computer Science 1969, Springer 2000, isbn 3-540-41255-7

Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh: Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. Algorithmica 23(3): 187-210 (1999)

Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou: Skew Voronoi Diagrams. Int. J. Comput. Geometry Appl. 9(3): 235-248 (1999)

Evanthia Papadopoulou, D. T. Lee: Critical area computation via Voronoi diagrams. IEEE Trans. on CAD of Integrated Circuits and Systems 18(4): 463-474 (1999)

Shih-Lang Chang, Chi-haur Wu, D. T. Lee: A Muscular-Like Compliance Control for Active Vehicle Suspension. ICRA 1999: 3275-3280

Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang: A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. WADS 1999: 231-240

Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama (Eds.): Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1627, Springer 1999, isbn 3-540-66200-6

Evanthia Papadopoulou, D. T. Lee: A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica 20(4): 319-352 (1998)

L. H. Tseng, Paul J. Heffernan, D. T. Lee: Two-Guard Walkability of Simple Polygons. Int. J. Comput. Geometry Appl. 8(1): 85-116 (1998)

D. T. Lee, Chin-Fang Shen, Dennis S. Sheu: Geosheet: A Distributed Visualization Tool for Geometric Algorithms. Int. J. Comput. Geometry Appl. 8(2): 119-156 (1998)

Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan: Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks 31(4): 249-258 (1998)

Hsiao-Feng Steven Chen, D. T. Lee: On crossing minimization problem. IEEE Trans. on CAD of Integrated Circuits and Systems 17(5): 406-418 (1998)

Evanthia Papadopoulou, D. T. Lee: Critical area computation - a new approach. ISPD 1998: 89-94

Kuo-Hui Tsai, D. T. Lee: k Best Cuts for Circular-Arc Graphs. Algorithmica 18(2): 198-216 (1997)

D. T. Lee, Chung-Do Yang, C. K. Wong: Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. Int. J. Comput. Geometry Appl. 7(6): 581-598 (1997)

Chung-Do Yang, D. T. Lee, C. K. Wong: The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon. IEEE Trans. Computers 46(8): 930-941 (1997)

D. T. Lee: Computational Geometry. The Computer Science and Engineering Handbook 1997: 111-140

Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou: Voronoi Diagrams for Direction-Sensitive Distances. Symposium on Computational Geometry 1997: 418-420

Hsiao-Feng Steven Chen, D. T. Lee: A Faster One-Dimensional Topological Compaction Algorithm. ISAAC 1997: 303-313

Tao Jiang, D. T. Lee (Eds.): Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings. Lecture Notes in Computer Science 1276, Springer 1997, isbn 3-540-63357-X

D. T. Lee: Computational Geometry. ACM Comput. Surv. 28(1): 27-31 (1996)

D. T. Lee, Chung-Do Yang, C. K. Wong: Rectilinear Paths Among Rectilinear Obstacles. Discrete Applied Mathematics 70(3): 185-215 (1996)

Hsiao-Feng Steven Chen, D. T. Lee: A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. IEEE Trans. on CAD of Integrated Circuits and Systems 15(2): 217-227 (1996)

Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30

Chi-haur Wu, Shih-Lang Chang, Der-Tsai Lee: A study of neuromuscular-like control in rehabilitation robot. ICRA 1996: 1178-1183

D. T. Lee, C. F. Shen: The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. ISAAC 1996: 247-255

D. T. Lee: Geometric Algorithm Visualization, Current Status and Future. WACG 1996: 45-50

Pedro Jussieu de Rezende, D. T. Lee: Point Set Pattern Matching in d-Dimensions. Algorithmica 13(4): 387-404 (1995)

Mikhail J. Atallah, Danny Z. Chen, D. T. Lee: An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Algorithmica 14(5): 429-441 (1995)

Marilyn G. Andrews, D. T. Lee: Parallel Algorithms on Circular-arc Graphs. Comput. Geom. 5: 117-141 (1995)

Kurt Swanson, D. T. Lee, Vanban L. Wu: An Optimal Algorithm for Roundness Determination on Convex Polygons. Comput. Geom. 5: 225-235 (1995)

Muhammad H. Alsuwaiyel, D. T. Lee: Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. 55(2): 75-79 (1995)

Chung-Do Yang, D. T. Lee, C. K. Wong: Rectilinear Path Problems among Rectilinear Obstacles Revisited. SIAM J. Comput. 24(3): 457-472 (1995)

Evanthia Papadopoulou, D. T. Lee: Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA 1995: 238-251

Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee: Parallel algorithms for maximum matching in interval graphs. IPPS 1995: 84-92

D. T. Lee, Chin-Fang Shen, Cheng-Liang Ding: On Steiner Tree Problem with 45 Degree Routing. ISCAS 1995: 1680-1682

Majid Sarrafzadeh, D. T. Lee: Restricted track assignment with applications. Int. J. Comput. Geometry Appl. 4(1): 53-68 (1994)

D. T. Lee, Chung-Do Yang, C. K. Wong: On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model. IEEE Trans. Computers 43(6): 711-724 (1994)

Evanthia Papadopoulou, D. T. Lee: Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG 1994: 110-115

Danny Z. Chen, D. T. Lee: Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs. IPPS 1994: 224-228

Kuo-Hui Tsai, D. T. Lee: k-Best Cuts for Circular-Arc Graphs. ISAAC 1994: 550-558

Muhammad H. Alsuwaiyel, D. T. Lee: Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. 3: 1-25 (1993)

D. T. Lee, Majid Sarrafzadeh: Maximum independent set of a permutation graph in K tracks. Int. J. Comput. Geometry Appl. 3(3): 291-304 (1993)

D. T. Lee, Evanthia Papadopoulou: The All-Pairs Quickest Path Problem. Inf. Process. Lett. 45(5): 261-267 (1993)

Mikhail J. Atallah, Danny Z. Chen, D. T. Lee: An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. ESA 1993: 13-24

Chung-Do Yang, D. T. Lee, C. K. Wong: On bends and lengths of rectilinear paths: a graph theoretic approach. Int. J. Comput. Geometry Appl. 2(1): 61-74 (1992)

Hiroshi Imai, D. T. Lee, Chung-Do Yang: 1-Segment Center Problems. INFORMS Journal on Computing 4(4): 426-434 (1992)

Chang-Sung Jeong, Jung-Ju Choi, Der-Tsai Lee: Parallel enclosing rectangle on SIMD machines. Parallel Computing 18(2): 221-229 (1992)

Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee: An Optimal Algorithm for the Maximum Two-Chain Problem. SIAM J. Discrete Math. 5(2): 285-304 (1992)

D. T. Lee: Rectilinear Paths among Rectilinear Obstacles. ISAAC 1992: 5-20

Majid Sarrafzadeh, D. T. Lee: Rstricted Track Assignment with Applications. ISAAC 1992: 449-458

D. T. Lee, Chung-Do Yang, T. H. Chen: Shortest rectilinear paths among weighted obstacles. Int. J. Comput. Geometry Appl. 1(2): 109-124 (1991)

Van-Ban Le, D. T. Lee: Out-of-Roundness Problem Revisited. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 217-223 (1991)

Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong: Minimum Diameter Spanning Trees and Related Problems. SIAM J. Comput. 20(5): 987-997 (1991)

Majid Sarrafzadeh, D. T. Lee: Topological Via Minimization Revisited. IEEE Trans. Computers 40(11): 1307-1312 (1991)

D. T. Lee, Majid Sarrafzadeh: Maximum Independent Set of a Permutation Graph in k Tracks. ISA 1991: 2-11

Chung-Do Yang, D. T. Lee, C. K. Wong: On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. WADS 1991: 320-330

C. S. Jeong, D. T. Lee: Parallel Geometric Algorithms on a Mesh-Connected Computer. Algorithmica 5(2): 155-177 (1990)

D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu: Minimum Cuts for Circular-Arc Graphs. SIAM J. Comput. 19(6): 1041-1050 (1990)

D. T. Lee: NSF report - computer and computation research. SIGACT News 21(1): 13 (1990)

D. T. Lee: NSF report - computer and computation research. SIGACT News 21(2): 16 (1990)

D. T. Lee, T. H. Chen, Chung-Do Yang: Shortest Rectilinear Paths among Weighted Obstacles. Symposium on Computational Geometry 1990: 301-310

John C. C. Hsueh, D. T. Lee: Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System. SEKE 1990: 110-115

Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee: An Optimal Algorithm for the Maximum Two-Chain Problem. SODA 1990: 149-158

Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu: Rectilinear Shortest Paths in the presence of Rectangular Barriers. Discrete & Computational Geometry 4: 41-53 (1989)

D. T. Lee, Franco P. Preparata: Parallel Batched Planar Point Location on the CCC. Inf. Process. Lett. 33(4): 175-179 (1989)

Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee: On-Line Bin Packing in Linear Time. J. Algorithms 10(3): 305-326 (1989)

D. T. Lee: NSF report - computer and computation research. SIGACT News 20(4): 25 (1989)

Majid Sarrafzadeh, D. T. Lee: A new approach to topological via minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 8(8): 890-900 (1989)

Jan-Ming Ho, D. T. Lee: Bounded Diameter Minimum Spanning Trees and Related Problems. Symposium on Computational Geometry 1989: 276-282

Tina M. Nicholl, D. T. Lee, Robin A. Nicholl: An efficient new algorithm for 2-D line clipping: Its development and analysis. SIGGRAPH 1987: 253-262

C. C. Lee, D. T. Lee, C. K. Wong: Generating Binary Trees of Bounded Height. Acta Inf. 23(5): 529-544 (1986)

D. T. Lee, Ying-Fung Wu: Complexity of Some Laction Problems. Algorithmica 1(2): 193-211 (1986)

D. T. Lee, A. K. Lin: Generalized Dalaunay Triangualtion for Planar Graphs. Discrete & Computational Geometry 1: 201-217 (1986)

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986)

D. T. Lee, Arthur K. Lin: Computational complexity of art gallery problems. IEEE Transactions on Information Theory 32(2): 276-282 (1986)

D. T. Lee: Geometric Location Problems and Their Complexity. MFCS 1986: 154-167

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality. BIT 25(1): 76-90 (1985)

D. T. Lee, Y. T. Ching: The Power of Geometric Duality Revisited. Inf. Process. Lett. 21(3): 117-122 (1985)

C. C. Lee, D. T. Lee: A Simple On-Line Bin-Packing Algorithm. J. ACM 32(3): 562-572 (1985)

Y. T. Ching, D. T. Lee: Finding the diameter of a set of lines. Pattern Recognition 18(3-4): 249-255 (1985)

D. T. Lee: Relative neighborhood graphs in the Lⁱ-metric. Pattern Recognition 18(5): 327-332 (1985)

Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu: Rectilinear shortest paths with rectangular barriers. Symposium on Computational Geometry 1985: 204-213

D. Y. Yeh, D. T. Lee: Graph Algorithms on a Tree-Structured Parallel Computer. BIT 24(3): 333-340 (1984)

D. T. Lee: An optimal time and minimal space algorithm for rectangle intersection problems. International Journal of Parallel Programming 13(1): 23-32 (1984)

C. C. Lee, D. T. Lee: On a Circle-Cover Minimization Problem. Inf. Process. Lett. 18(2): 109-115 (1984)

Der-Tsai Lee, Franco P. Preparata: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3): 393-410 (1984)

D. T. Lee, Joseph Y.-T. Leung: On the 2-Dimensional Channel Assignment Problem. IEEE Trans. Computers 33(1): 2-6 (1984)

D. T. Lee, Franco P. Preparata: Computational Geometry - A Survey. IEEE Trans. Computers 33(12): 1072-1101 (1984)

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. STACS 1984: 43-54

Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong: On the X-Y Convex Hull of a Set of X-Y Polygons. BIT 23(4): 456-471 (1983)

D. T. Lee: Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing 22(2): 207-221 (1983)

D. T. Lee: On finding the convex hull of a simple polygon. International Journal of Parallel Programming 12(2): 87-98 (1983)

U. I. Gupta, D. T. Lee, C. K. Wong: Ranking and Unranking of B-Trees. J. Algorithms 4(1): 51-60 (1983)

D. T. Lee, C. L. Liu, C. K. Wong: (g 0, g 1, ... g k)-Trees and Unary OL Systems. Theor. Comput. Sci. 22: 209-217 (1983)

I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad: Dynamic Voronoi diagrams. IEEE Transactions on Information Theory 29(5): 724-730 (1983)

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality. FOCS 1983: 217-225

D. T. Lee, Franco P. Preparata: An Improved Algorithm for the Rectangle Enclosure Problem. J. Algorithms 3(3): 218-224 (1982)

U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4): 459-467 (1982)

D. T. Lee: Medial Axis Transformation of a Planar Shape. IEEE Trans. Pattern Anal. Mach. Intell. 4(4): 363-369 (1982)

Udai Gupta, D. T. Lee, C. K. Wong: Ranking and Unranking of 2-3 Trees. SIAM J. Comput. 11(3): 582-590 (1982)

Der-Tsai Lee: On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Trans. Computers 31(6): 478-487 (1982)

D. T. Lee, Charles B. Silio Jr.: An Optimal Illumination Region Algorithm for Convex Polygons. IEEE Trans. Computers 31(12): 1225-1227 (1982)

D. T. Lee, C. K. Wong: Finding Intersection of Rectangles by Range Search. J. Algorithms 2(4): 337-347 (1981)

J. MacGregor Smith, D. T. Lee, Judith Liebman: An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric. Networks 11(1): 23-39 (1981)

D. T. Lee, Robert L. (Scot) Drysdale III: Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. 10(1): 73-87 (1981)

D. T. Lee, Hsu Chang, C. K. Wong: An On-Chip Compare/Steer Bubble Sorter. IEEE Trans. Computers 30(6): 396-405 (1981)

U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong: Record Allocation for Minimizing Seek Delay. Theor. Comput. Sci. 16: 307-319 (1981)

D. T. Lee, Bruce J. Schachter: Two algorithms for constructing a Delaunay triangulation. International Journal of Parallel Programming 9(3): 219-242 (1980)

D. T. Lee: Two-Dimensional Voronoi Diagrams in the L_p-Metric. J. ACM 27(4): 604-618 (1980)

D. T. Lee, C. K. Wong: Voronoi Diagrams in L₁ (L_infty) Metrics with 2-Dimensional Storage Applications. SIAM J. Comput. 9(1): 200-211 (1980)

D. T. Lee, C. K. Wong: Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353 (1980)

C. C. Yang, D. T. Lee: A Note on the all Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 8(4): 193-194 (1979)

D. T. Lee, C. C. Yang: Location of Multiple Points in a Planar Subdivision. Inf. Process. Lett. 9(4): 190-193 (1979)

D. T. Lee, Franco P. Preparata: An Optimal Algorithm for Finding the Kernel of a Polygon. J. ACM 26(3): 415-421 (1979)

U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung: An Optimal Solution for the Channel-Assignment Problem. IEEE Trans. Computers 28(11): 807-810 (1979)

D. T. Lee, Franco P. Preparata: The All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 7(4): 189-192 (1978)

D. T. Lee, C. K. Wong: Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Inf. 9: 23-29 (1977)

D. T. Lee, Franco P. Preparata: Location of a Point in a Planar Subdivision and Its Applications. SIAM J. Comput. 6(3): 594-606 (1977)

Der-Tsai Lee, Se June Hong: An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function. IEEE Trans. Computers 25(11): 1117-1123 (1976)

D. T. Lee, Franco P. Preparata: Location of a Point in a Planar Subdivision and its Applications. STOC 1976: 231-235