Tien-Ching Lin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2021

Finding maximum sum segments in sequences with uncertaintyHung-I Yu, Tien-Ching Lin, D. T. Lee. TCS, 850:221-235, 2021. [doi]

2018

Guest Editor's ForewordSeok-Hee Hong, Hung-I Yu, Tien-Ching Lin, D. T. Lee. ijcga, 28(2):79-80, 2018. [doi]

The (1|1)-Centroid Problem in the Plane with Distance ConstraintsHung-I Yu, Tien-Ching Lin, D. T. Lee. ijcga, 28(2):81-109, 2018. [doi]

2016

The (1|1)-Centroid Problem on the Plane Concerning Distance ConstraintsHung-I Yu, Tien-Ching Lin, Der-Tsai Lee. isaac 2016: [doi]

2012

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed SpaceChristian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu. ijcga, 22(1):45-60, 2012. [doi]

2011

Finding Maximum Sum Segments in Sequences with UncertaintyHung-I Yu, Tien-Ching Lin, D. T. Lee. isaac 2011: 734-743 [doi]

2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the ::::L::::::1:: PlaneAnsgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon. isaac 2010: 121-131 [doi]

Efficient algorithms for the sum selection problem and k maximum sums problemTien-Ching Lin, D. T. Lee. TCS, 411(7-9):986-994, 2010. [doi]

2009

Fast Algorithms for the Density Finding ProblemD. T. Lee, Tien-Ching Lin, Hsueh-I Lu. algorithmica, 53(3):298-313, 2009. [doi]

Optimal Randomized Algorithm for the Density Selection ProblemTien-Ching Lin, D. T. Lee. isaac 2009: 1004-1013 [doi]

Geometric Minimum Diameter Minimum Cost Spanning Tree ProblemDae Young Seo, D. T. Lee, Tien-Ching Lin. isaac 2009: 283-292 [doi]

2007

Randomized algorithm for the sum selection problemTien-Ching Lin, D. T. Lee. TCS, 377(1-3):151-156, 2007. [doi]

2006

Planar-shape prototype generation using a tree-based random greedy algorithmWen-Yao Chen, Wen-Liang Hwang, Tien-Ching Lin. tsmc, 36(3):649-659, 2006. [doi]

Efficient Algorithms for the Sum Selection Problem and K Maximum Sums ProblemTien-Ching Lin, D. T. Lee. isaac 2006: 460-473 [doi]

2005

Randomized Algorithm for the Sum Selection ProblemTien-Ching Lin, D. T. Lee. isaac 2005: 515-523 [doi]

Sign in or sign up to see more results.

runs on WebDSL