default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTien-Ching Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Hung-I Yu
, Tien-Ching Lin, D. T. Lee:
Finding maximum sum segments in sequences with uncertainty. Theor. Comput. Sci. 850: 221-235 (2021)
2010 – 2019
- 2018
- [j6]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
The (1|1)-Centroid Problem in the Plane with Distance Constraints. Int. J. Comput. Geom. Appl. 28(2): 81-109 (2018) - 2016
- [c7]Hung-I Yu, Tien-Ching Lin, Der-Tsai Lee:
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints. ISAAC 2016: 64:1-64:12 - [i1]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
The (1|1)R-Centroid Problem on the Plane. CoRR abs/1608.03680 (2016) - 2012
- [j5]Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu:
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geom. Appl. 22(1): 45-60 (2012) - 2011
- [c6]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
Finding Maximum Sum Segments in Sequences with Uncertainty. ISAAC 2011: 734-743 - 2010
- [j4]Tien-Ching Lin, D. T. Lee:
Efficient algorithms for the sum selection problem and k maximum sums problem. Theor. Comput. Sci. 411(7-9): 986-994 (2010) - [c5]Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon:
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. ISAAC (2) 2010: 121-131
2000 – 2009
- 2009
- [j3]D. T. Lee, Tien-Ching Lin, Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009) - [c4]Dae-Young Seo, D. T. Lee, Tien-Ching Lin:
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ISAAC 2009: 283-292 - [c3]Tien-Ching Lin, D. T. Lee:
Optimal Randomized Algorithm for the Density Selection Problem. ISAAC 2009: 1004-1013 - 2007
- [j2]Tien-Ching Lin, D. T. Lee:
Randomized algorithm for the sum selection problem. Theor. Comput. Sci. 377(1-3): 151-156 (2007) - 2006
- [j1]Wen-Yao Chen, Wen-Liang Hwang, Tien-Ching Lin:
Planar-shape prototype generation using a tree-based random greedy algorithm. IEEE Trans. Syst. Man Cybern. Part B 36(3): 649-659 (2006) - [c2]Tien-Ching Lin, D. T. Lee:
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ISAAC 2006: 460-473 - 2005
- [c1]Tien-Ching Lin, D. T. Lee:
Randomized Algorithm for the Sum Selection Problem. ISAAC 2005: 515-523
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
