| 2009 | ||
|---|---|---|
| 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 | |
| 1 | D. T. Lee (Der-Tsai Lee) | [1] [2] [3] [4] [5] |
| 2 | Hsueh-I Lu | [4] |
| 3 | Dae Young Seo | [5] |