Tien-Ching Lin

	2011
9		Hung-I Yu, Tien-Ching Lin, D. T. Lee: Finding Maximum Sum Segments in Sequences with Uncertainty. ISAAC 2011: 734-743
	2010
8		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
7		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)
	2009
6		Tien-Ching Lin, D. T. Lee: Optimal Randomized Algorithm for the Density Selection Problem. ISAAC 2009: 1004-1013
5		Dae Young Seo, D. T. Lee, Tien-Ching Lin: Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ISAAC 2009: 283-292
4		D. T. Lee, Tien-Ching Lin, Hsueh-I Lu: Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009)
	2007
3		Tien-Ching Lin, D. T. Lee: Randomized algorithm for the sum selection problem. Theor. Comput. Sci. 377(1-3): 151-156 (2007)
	2006
2		Tien-Ching Lin, D. T. Lee: Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ISAAC 2006: 460-473
	2005
1		Tien-Ching Lin, D. T. Lee: Randomized Algorithm for the Sum Selection Problem. ISAAC 2005: 515-523

Coauthor Index

1	Ansgar Grüne	[8]
2	Rolf Klein	[8]
3	Elmar Langetepe	[8]
4	D. T. Lee (Der-Tsai Lee)	[1] [2] [3] [4] [5] [6] [7] [8] [9]
5	Hsueh-I Lu	[4]
6	Sheung-Hung Poon	[8]
7	Dae Young Seo	[5]
8	Hung-I Yu	[9]
9	Teng-Kai Yu	[8]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page