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

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

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

The All Nearest-Neighbor Problem for Convex Polygons. - D. T. Lee; Franco P. Preparata (Inf. Process. Lett., 1978)

Location of Multiple Points in a Planar Subdivision. - D. T. Lee; C. C. Yang (Inf. Process. Lett., 1979)

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

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

An Optimal Solution for the Channel-Assignment Problem. - Udaiprakash I. Gupta; D. T. Lee; Joseph Y.-T. Leung (IEEE Trans. Computers, 1979)

Two algorithms for constructing a Delaunay triangulation. - D. T. Lee; Bruce J. Schachter (Int. J. Parallel Program., 1980)

Two-Dimensional Voronoi Diagrams in the Lp-Metric. - D. T. Lee (J. ACM, 1980)

Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications. - D. T. Lee; C. K. Wong (SIAM J. Comput., 1980)

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

Shading of regions on vector display devises. - D. T. Lee (SIGGRAPH, 1981)

Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. - D. T. Lee; Franco P. Preparata (WG, 1981)

Finding Intersection of Rectangles by Range Search. - D. T. Lee; C. K. Wong (J. Algorithms, 1981)

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

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

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

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

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

Efficient algorithms for interval graphs and circular-arc graphs. - Udaiprakash I. Gupta; D. T. Lee; Joseph Y.-T. Leung (Networks, 1982)

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

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

On k-Nearest Neighbor Voronoi Diagrams in the Plane. - Der-Tsai Lee (IEEE Trans. Computers, 1982)

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

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

Visibility of a simple polygon. - D. T. Lee (Comput. Vis. Graph. Image Process., 1983)

On finding the convex hull of a simple polygon. - D. T. Lee (Int. J. Parallel Program., 1983)

Ranking and Unranking of B-Trees. - Udaiprakash I. Gupta; D. T. Lee; C. K. Wong (J. Algorithms, 1983)

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

Dynamic Voronoi diagrams. - I. G. Gowda; David G. Kirkpatrick; D. T. Lee; Amnon Naamad (IEEE Trans. Inf. Theory, 1983)

Graph Algorithms on a Tree-Structured Parallel Computer. - Der-Yun Yeh; D. T. Lee (BIT, 1984)

On the maximum empty rectangle problem. - Amnon Naamad; D. T. Lee; Wen-Lian Hsu (Discret. Appl. Math., 1984)

An optimal time and minimal space algorithm for rectangle intersection problems. - D. T. Lee (Int. J. Parallel Program., 1984)

On a Circle-Cover Minimization Problem. - C. C. Lee 002; D. T. Lee (Inf. Process. Lett., 1984)

Euclidean shortest paths in the presence of rectilinear barriers. - D. T. Lee; Franco P. Preparata (Networks, 1984)

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

Computational Geometry - A Survey. - D. T. Lee; Franco P. Preparata (IEEE Trans. Computers, 1984)

Rectilinear shortest paths with rectangular barriers. - Pedro Jussieu de Rezende; D. T. Lee; Ying-Fung Wu (SCG, 1985)

The Power of Geometric Duality. - Bernard Chazelle; Leonidas J. Guibas; D. T. Lee (BIT, 1985)

The Power of Geometric Duality Revisited. - D. T. Lee; Y. T. Ching (Inf. Process. Lett., 1985)

Finding the diameter of a set of lines. - Y. T. Ching; D. T. Lee (Pattern Recognit., 1985)

Relative neighborhood graphs in the Li-metric. - D. T. Lee (Pattern Recognit., 1985)

A Simple On-Line Bin-Packing Algorithm - C. C. Lee 002; D. T. Lee (J. ACM, 1985)

Geometric Location Problems and Their Complexity. - D. T. Lee (MFCS, 1986)

Generating Binary Trees of Bounded Height. - C. C. Lee 002; D. T. Lee; C. K. Wong (Acta Informatica, 1986)

Geometric Complexity of Some Loction Problems. - D. T. Lee; Ying-Fung Wu (Algorithmica, 1986)

On a circle placement problem. - Bernard Marie Chazelle; D. T. Lee (Computing, 1986)

Computing the visibility polygon from an edge. - D. T. Lee; Arthur K. Lin (Comput. Vis. Graph. Image Process., 1986)

Generalized Dalaunay Triangualtion for Planar Graphs. - D. T. Lee; A. K. Lin (Discret. Comput. Geom., 1986)

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

Computational complexity of art gallery problems. - D. T. Lee; Arthur K. Lin (IEEE Trans. Inf. Theory, 1986)

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

Bounded-Diameter Minimum Spanning Trees and Related Problems. - Jan-Ming Ho; D. T. Lee; Chia-Hsiang Chang (SCG, 1989)

Application of mathematical constraint resolution to decision support system. - Feng-Tyan Lin; Jie-Yong Juang; Der-Tsai Lee (COMPSAC, 1989)

Rectilinear Shortest Paths in the presence of Rectangular Barriers. - Pedro Jussieu de Rezende; D. T. Lee; Ying-Fung Wu (Discret. Comput. Geom., 1989)

Parallel Batched Planar Point Location on the CCC. - D. T. Lee; Franco P. Preparata (Inf. Process. Lett., 1989)

On-Line Bin Packing in Linear Time. - Prakash V. Ramanan; Donna J. Brown; C. C. Lee 002; D. T. Lee (J. Algorithms, 1989)

A new approach to topological via minimization. - Majid Sarrafzadeh; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989)

Computational Complexity of Art Gallery Problems. - D. T. Lee; Arthur K. Lin (Autonomous Robot Vehicles, 1990)

Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System. - John C. C. Hsueh; D. T. Lee (SEKE, 1990)

Parallel Geometric Algorithms on a Mesh-Connected Computer. - C. S. Jeong; D. T. Lee (Algorithmica, 1990)

Planar subset of multi-terminal nets. - Kuo-Feng Liao; D. T. Lee; Majid Sarrafzadeh (Integr., 1990)

Minimum Cuts for Circular-Arc Graphs. - D. T. Lee; Majid Sarrafzadeh; Ying-Fung Wu (SIAM J. Comput., 1990)

NSF report - computer and computation research. - D. T. Lee (SIGACT News, 1990)

Maximum Independent Set of a Permutation Graph in k Tracks. - D. T. Lee; Majid Sarrafzadeh (ISA, 1991)

Shortest rectilinear paths among weighted obstacles. - D. T. Lee; Chung-Do Yang; T. H. Chen (Int. J. Comput. Geom. Appl., 1991)

Out-of-Roundness Problem Revisited. - Van-Ban Le; D. T. Lee (IEEE Trans. Pattern Anal. Mach. Intell., 1991)

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

Topological Via Minimization Revisited. - Majid Sarrafzadeh; D. T. Lee (IEEE Trans. Computers, 1991)

Rectilinear Paths among Rectilinear Obstacles. - D. T. Lee (ISAAC, 1992)

Rstricted Track Assignment with Applications. - Majid Sarrafzadeh; D. T. Lee (ISAAC, 1992)

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

1-Segment Center Problems. - Hiroshi Imai; D. T. Lee; Chung-Do Yang (INFORMS J. Comput., 1992)

Parallel enclosing rectangle on SIMD machines. - Chang-Sung Jeong; Jung-Ju Choi; Der-Tsai Lee (Parallel Comput., 1992)

An Optimal Algorithm for the Maximum Two-Chain Problem. - Ruey-Der Lou; Majid Sarrafzadeh; D. T. Lee (SIAM J. Discret. Math., 1992)

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

Maximum independent set of a permutation graph in K tracks. - D. T. Lee; Majid Sarrafzadeh (Int. J. Comput. Geom. Appl., 1993)

The All-Pairs Quickest Path Problem. - D. T. Lee; Evanthia Papadopoulou (Inf. Process. Lett., 1993)

Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. - Evanthia Papadopoulou; D. T. Lee (CCCG, 1994)

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

Restricted track assignment with applications. - Majid Sarrafzadeh; D. T. Lee (Int. J. Comput. Geom. Appl., 1994)

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

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

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

On Steiner Tree Problem with 45 Degree Routing. - D. T. Lee; Chin-Fang Shen; Cheng-Liang Ding (ISCAS, 1995)

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

Point Set Pattern Matching in d-Dimensions. - Pedro Jussieu de Rezende; D. T. Lee (Algorithmica, 1995)

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

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

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

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

Steiner Problems on Directed Acyclic Graphs. - Tsan-sheng Hsu; Kuo-Hui Tsai; Da-Wei Wang 004; D. T. Lee (COCOON, 1996)

A study of neuromuscular-like control in rehabilitation robot. - Chi-haur Wu; Shih-Lang Chang; D. T. Lee (ICRA, 1996)

The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. - D. T. Lee; C. F. Shen (ISAAC, 1996)

Geometric Algorithm Visualization, Current Status and Future. - D. T. Lee (WACG, 1996)

Computational Geometry. - D. T. Lee (ACM Comput. Surv., 1996)

Rectilinear Paths Among Rectilinear Obstacles. - D. T. Lee; Chung-Do Yang; C. K. Wong (Discret. Appl. Math., 1996)

A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. - Hsiao-Feng Steven Chen; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

Computational Geometry. - D. T. Lee (The Computer Science and Engineering Handbook, 1997)

Voronoi Diagrams for Direction-Sensitive Distances. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Asish Mukhopadhyay; Evanthia Papadopoulou (SCG, 1997)

A Faster One-Dimensional Topological Compaction Algorithm. - Hsiao-Feng Steven Chen; D. T. Lee (ISAAC, 1997)

k Best Cuts for Circular-Arc Graphs. - Kuo-Hui Tsai; D. T. Lee (Algorithmica, 1997)

Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. - D. T. Lee; Chung-Do Yang; C. K. Wong (Int. J. Comput. Geom. Appl., 1997)

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

Critical area computation - a new approach. - Evanthia Papadopoulou; D. T. Lee (ISPD, 1998)

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

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

Two-Guard Walkability of Simple Polygons. - L. H. Tseng; Paul J. Heffernan; D. T. Lee (Int. J. Comput. Geom. Appl., 1998)

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

On crossing minimization problem. - Hsiao-Feng Steven Chen; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998)

A hierarchical workcell model for intelligent assembly and disassembly. - Swee M. Mok; Chi-haur Wu; D. T. Lee (CIRA, 1999)

A Muscular-Like Compliance Control for Active Vehicle Suspension. - Shih-Lang Chang; Chi-haur Wu; D. T. Lee (ICRA, 1999)

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

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

Skew Voronoi Diagrams. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Evanthia Papadopoulou (Int. J. Comput. Geom. Appl., 1999)

Critical area computation via Voronoi diagrams. - Evanthia Papadopoulou; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999)

A Web-Based Distributed Programming Environment. - Kiyoko F. Aoki; D. T. Lee (HPCN Europe, 2000)

A System for Analyzing Automatic Assembly and Disassembly Operations. - Swee M. Mok; Chi-haur Wu; D. T. Lee (ICRA, 2000)

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

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

Guest editorial: low-power electronics and design. - Kaushik Roy; D. T. Lee (IEEE Trans. Very Large Scale Integr. Syst., 2000)

Towards Web-Based Computing. - Kiyoko F. Aoki; D. T. Lee (Int. J. Comput. Geom. Appl., 2001)

The Linfty-Voronoi Diagram of Segments and VLSI Applications. - Evanthia Papadopoulou; D. T. Lee (Int. J. Comput. Geom. Appl., 2001)

Modeling automatic assembly and disassembly operations for virtual manufacturing. - Swee M. Mok; Chi-haur Wu; D. T. Lee (IEEE Trans. Syst. Man Cybern. Part A, 2001)

Finding battery locations of electrical motorcycles for better perception of riding comfort. - Hsien-Chung Lai; Jing-Sin Liu; D. T. Lee; Li-Sheng Wang (ACC, 2002)

The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. - Evanthia Papadopoulou; D. T. Lee (ISAAC, 2002)

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

Chief Editor's Notice. - D. T. Lee (Int. J. Comput. Geom. Appl., 2003)

Knowledge Management for Computational Problem Solving. - D. T. Lee; Gen-Cher Lee; Yao-Wen Huang (J. Univers. Comput. Sci., 2003)

A new approach to the traveling salesman problem using genetic algorithms with priority encoding. - Jyh-Da Wei; D. T. Lee (IEEE Congress on Evolutionary Computation, 2004)

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

An adaptive PID-type iterative learning controller unknown nonlinear systems. - Ying-Chung Wang; Chiang-Ju Chien; D. T. Lee (ICARCV, 2004)

Non-Detrimental Web Application Security Scanning. - Yao-Wen Huang; Chung-Hung Tsai; D. T. Lee; Sy-Yen Kuo (ISSRE, 2004)

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

A note from the editors-in-chief. - D. T. Lee; Joseph S. B. Mitchell (Int. J. Comput. Geom. Appl., 2004)

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

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

Travel-time prediction with support vector regression. - Chun-Hsin Wu; Jan-Ming Ho; D. T. Lee (IEEE Trans. Intell. Transp. Syst., 2004)

Interval, Segment, Range, and Priority Search Trees. - D. T. Lee (Handbook of Data Structures and Applications, 2004)

Power Domination Problem in Graphs. - Chung-Shou Liao; Der-Tsai Lee (COCOON, 2005)

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

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

Gridding the spot centers of microarray images. - Jinn Ho; Wen-Liang Hwang; Henry Horng-Shing Lu; D. T. Lee (EUSIPCO, 2005)

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

Labeling Points on a Single Line. - Yu-Shin Chen; D. T. Lee; Chung-Shou Liao (Int. J. Comput. Geom. Appl., 2005)

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

Crosstalk- and performance-driven multilevel full-chip routing. - Tsung-Yi Ho; Yao-Wen Chang; Sao-Jie Chen; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005)

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

A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects. - Ming-Hung Tsai; Jyh-Da Wei; Jeng-Hung Huang; D. T. Lee (SCG, 2006)

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

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

SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools. - 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 (BMC Bioinform., 2006)

An iterative distributed algorithm for multi-constraint multicast routing. - Tzu-Lun Huang; D. T. Lee (Comput. Commun., 2006)

Gridding spot centers of smoothly distorted microarray images. - Jinn Ho; Wen-Liang Hwang; Henry Horng-Shing Lu; D. T. Lee (IEEE Trans. Image Process., 2006)

Maximizing the Number of Independent Labels in the Plane. - Kuen-Lin Yu; Chung-Shou Liao; D. T. Lee (FAW, 2007)

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

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 (IKE, 2007)

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 (IRI, 2007)

Time Convex Hull with a Highway. - Teng-Kai Yu; D. T. Lee (ISVD, 2007)

Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online). - 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; et al. (BMC Bioinform., 2007)

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

A distributed multicast routing algorithm for real-time applications in wide area networks. - Tzu-Lun Huang; D. T. Lee (J. Parallel Distributed Comput., 2007)

Randomized algorithm for the sum selection problem. - Tien-Ching Lin; D. T. Lee (Theor. Comput. Sci., 2007)

State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms. - Der-Tsai Lee; Shaw-Ji Shiah; Chien-Ming Lee; Ying-Chung Wang (IEEE Trans. Veh. Technol., 2007)

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

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

Preface. - Nancy M. Amato; Der-Tsai Lee; Andrea Pietracaprina; Roberto Tamassia (Theor. Comput. Sci., 2008)

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

Optimal Randomized Algorithm for the Density Selection Problem. - Tien-Ching Lin; D. T. Lee (ISAAC, 2009)

Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. - Dae-Young Seo; D. T. Lee; Tien-Ching Lin (ISAAC, 2009)

Guest Editors' Forward. - Danny Z. Chen; D. T. Lee (Algorithmica, 2009)

Fast Algorithms for the Density Finding Problem. - D. T. Lee; Tien-Ching Lin; Hsueh-I Lu (Algorithmica, 2009)

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

Editors' Foreword. - Danny Z. Chen; D. T. Lee (Int. J. Comput. Geom. Appl., 2009)

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

Broadcasting in Heterogeneous Tree Networks. - Yu-Hsuan Su; Ching-Chi Lin; D. T. Lee (COCOON, 2010)

Boosted Multiple Kernel Learning for Scene Category Recognition. - I-Hong Jhuo; D. T. Lee (ICPR, 2010)

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

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

Boosting-based multiple kernel learning for image re-ranking. - I-Hong Jhuo; D. T. Lee (ACM Multimedia, 2010)

Scene Location Guide by Image-Based Retrieval. - I-Hong Jhuo; Tsuhan Chen; D. T. Lee (MMM, 2010)

Efficient algorithms for the sum selection problem and k maximum sums problem. - Tien-Ching Lin; D. T. Lee (Theor. Comput. Sci., 2010)

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

Connecting Two Trees with Optimal Routing Cost. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner (CCCG, 2011)

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

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

Capacitated Domination Problem. - Mong-Jen Kao; Chung-Shou Liao; D. T. Lee (Algorithmica, 2011)

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

Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices. - Tsai-Yeh Tung; Laurent Lin; D. T. Lee (AINA Workshops, 2012)

Robust visual domain adaptation with low-rank reconstruction. - I-Hong Jhuo; Dong Liu 001; D. T. Lee; Shih-Fu Chang (CVPR, 2012)

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. - Chih-Hung Liu 001; I-Che Chen; D. T. Lee (DAC, 2012)

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

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

Higher Order City Voronoi Diagrams. - Andreas Gemsa; D. T. Lee; Chih-Hung Liu 001; Dorothea Wagner (SWAT, 2012)

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

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. - Chih-Hung Liu 001; Sy-Yen Kuo; D. T. Lee; Chun-Syun Lin; Jung-Hung Weng; Shih-Yi Yuan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2012)

Voronoi Diagrams and Delaunay Triangulations. - Franz Aurenhammer; Rolf Klein; Der-Tsai Lee (World Scientific, 2013)

CloudRS: An error correction algorithm of high-throughput sequencing data based on scalable framework. - Chien-Chih Chen; Yu-Jung Chang; Wei-Chun Chung; Der-Tsai Lee; Jan-Ming Ho (IEEE BigData, 2013)

Optimizing a MapReduce module of preprocessing high-throughput DNA sequencing data. - Wei-Chun Chung; Yu-Jung Chang; Chien-Chih Chen; Der-Tsai Lee; Jan-Ming Ho (IEEE BigData, 2013)

Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. - Chih-Hung Liu 001; D. T. Lee (SODA, 2013)

Optimal Time-Convex Hull under the L p Metrics. - Bang-Sin Dai; Mong-Jen Kao; D. T. Lee (WADS, 2013)

Power Domination in Circular-Arc Graphs. - Chung-Shou Liao; D. T. Lee (Algorithmica, 2013)

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

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

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

Guest Editors' Foreword. - Kun-Mao Chao; Tsan-sheng Hsu; Der-Tsai Lee (Int. J. Comput. Geom. Appl., 2013)

The density maximization problem in graphs. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Ignaz Rutter; Dorothea Wagner (J. Comb. Optim., 2013)

Unsupervised Feature Learning for RGB-D Image Classification. - I-Hong Jhuo; Shenghua Gao; Liansheng Zhuang; D. T. Lee; Yi Ma 001 (ACCV (1), 2014)

Using geometric structures to improve the error correction algorithm of high-throughput sequencing data on MapReduce framework. - Wei-Chun Chung; Yu-Jung Chang; D. T. Lee; Jan-Ming Ho (IEEE BigData, 2014)

An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. - Chun-Xun Lin; Chih-Hung Liu 001; I-Che Chen; D. T. Lee; Tsung-Yi Ho (DAC, 2014)

Video Event Detection via Multi-modality Deep Learning. - I-Hong Jhuo; D. T. Lee (ICPR, 2014)

Preface Algorithms and Computation (ISAAC 2012). - Kun-Mao Chao; Tsan-sheng Hsu; D. T. Lee (Algorithmica, 2014)

Discovering joint audio-visual codewords for video event detection. - I-Hong Jhuo; Guangnan Ye; Shenghua Gao; Dong Liu 001; Yu-Gang Jiang 001; D. T. Lee; Shih-Fu Chang (Mach. Vis. Appl., 2014)

Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction. - Chih-Hung Liu 001; Chun-Xun Lin; I-Che Chen; D. T. Lee; Ting-Chi Wang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014)

Algorithms and Computation (ISAAC 2012). - Kun-Mao Chao; Tsan-sheng Hsu; D. T. Lee (Theor. Comput. Sci., 2014)

Capacitated Domination: Problem Complexity and Approximation Algorithms. - Mong-Jen Kao; Han-Lin Chen; D. T. Lee (Algorithmica, 2015)

The k-Nearest-Neighbor Voronoi Diagram Revisited. - Chih-Hung Liu 001; Evanthia Papadopoulou; Der-Tsai Lee (Algorithmica, 2015)

Online dynamic power management with hard real-time guarantees. - Jian-Jia Chen; Mong-Jen Kao; D. T. Lee; Ignaz Rutter; Dorothea Wagner (Theor. Comput. Sci., 2015)

A routability-driven flow routing algorithm for programmable microfluidic devices. - Yi-Siang Su; Tsung-Yi Ho; Der-Tsai Lee (ASP-DAC, 2016)

A feature fusion framework for hashing. - I-Hong Jhuo; Li Weng; Wen-Huang Cheng; D. T. Lee (ICPR, 2016)

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. - Mong-Jen Kao; Hai-Lun Tu; D. T. Lee (ISAAC, 2016)

The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints. - Hung-I Yu; Tien-Ching Lin; Der-Tsai Lee (ISAAC, 2016)

Optimal time-convex hull for a straight-line highway in Lp-metrics. - Bang-Sin Dai; Mong-Jen Kao; D. T. Lee (Comput. Geom., 2016)

The (1|1)R-Centroid Problem on the Plane. - Hung-I Yu; Tien-Ching Lin; D. T. Lee (CoRR, 2016)

Broadcasting in weighted trees under the postal model. - Yu-Hsuan Su; Ching-Chi Lin; D. T. Lee (Theor. Comput. Sci., 2016)

CloudEC: A MapReduce-based algorithm for correcting errors in next-generation sequencing big data. - Wei-Chun Chung; Jan-Ming Ho; Chung-Yen Lin; D. T. Lee (IEEE BigData, 2017)

An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. - Hai-Lun Tu; Mong-Jen Kao; D. T. Lee (ICS, 2018)

The Multi-service Location Problems. - Hung-I Yu; Mong-Jen Kao; D. T. Lee (ICS, 2018)

The (1|1)-Centroid Problem in the Plane with Distance Constraints. - Hung-I Yu; Tien-Ching Lin; D. T. Lee (Int. J. Comput. Geom. Appl., 2018)

The multi-service center problem. - Hung-I Yu; Cheng-Chung Li; D. T. Lee (Theor. Comput. Sci., 2018)

O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. - Mong-Jen Kao; Hai-Lun Tu; D. T. Lee (Algorithmica, 2019)

Tight approximation for partial vertex cover with hard capacities. - Mong-Jen Kao; Jia-Yau Shiau; Ching-Chi Lin; D. T. Lee (Theor. Comput. Sci., 2019)

Finding maximum sum segments in sequences with uncertainty. - Hung-I Yu; Tien-Ching Lin; D. T. Lee (Theor. Comput. Sci., 2021)