Tien-Ching Lin

According to our database1, Tien-Ching Lin authored at least 12 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Finding maximum sum segments in sequences with uncertainty.
Theor. Comput. Sci., 2021

2018
The (1|1)-Centroid Problem in the Plane with Distance Constraints.
Int. J. Comput. Geom. Appl., 2018

2016
The (1|1)<sub>R</sub>-Centroid Problem on the Plane.
CoRR, 2016

The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2012
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geom. Appl., 2012

2010
Efficient algorithms for the sum selection problem and k maximum sums problem.
Theor. Comput. Sci., 2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the <i>L</i><sub>1</sub> Plane.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Fast Algorithms for the Density Finding Problem.
Algorithmica, 2009

Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Optimal Randomized Algorithm for the Density Selection Problem.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2007
Randomized algorithm for the sum selection problem.
Theor. Comput. Sci., 2007

2006
Planar-shape prototype generation using a tree-based random greedy algorithm.
IEEE Trans. Syst. Man Cybern. Part B, 2006


  Loading...