Planar-shape prototype generation using a tree-based random greedy algorithm. - Wen-Yao Chen; Wen-Liang Hwang; Tien-Ching Lin (IEEE Trans. Syst. Man Cybern. Part B, 2006)

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

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)

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

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)

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

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)

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

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

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)

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