Tien-Ching Lin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Finding maximum sum segments in sequences with uncertainty Theoretical Computer Science	2020-12-16	Paper
The \((1 \| 1)\)-centroid problem in the plane with distance constraints International Journal of Computational Geometry & Applications	2018-08-02	Paper
The (1\|1)-Centroid Problem on the Plane Concerning Distance Constraints	2018-04-19	Paper
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space International Journal of Computational Geometry & Applications	2012-11-23	Paper
Finding maximum sum segments in sequences with uncertainty Algorithms and Computation	2011-12-16	Paper
Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane Algorithms and Computation	2010-12-09	Paper
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem Theoretical Computer Science	2010-03-09	Paper
Optimal randomized algorithm for the density selection problem Algorithms and Computation	2009-12-17	Paper
Geometric minimum diameter minimum cost spanning tree problem Algorithms and Computation	2009-12-17	Paper
Fast algorithms for the density finding problem Algorithmica	2009-06-17	Paper
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem Algorithms and Computation	2008-04-24	Paper
Randomized algorithm for the sum selection problem Theoretical Computer Science	2007-06-06	Paper
Algorithms and Computation Lecture Notes in Computer Science	2006-11-14	Paper

Research outcomes over time

This page was built for person: Tien-Ching Lin