Efficient Algorithms for Two Generalized 2-Median Problems on Trees. - Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang; Tzu-Chin Lin (ISAAC, 2001)

Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. - Tzu-Chin Lin; Biing-Feng Wang (ICPADS, 2002)

Improved Algorithms for the Minmax Regret 1-Median Problem. - Hung-I Yu; Tzu-Chin Lin; Biing-Feng Wang (COCOON, 2006)

Improved Algorithms for the Minmax-Regret 1-Center Problem. - Tzu-Chin Lin; Hung-I Yu; Biing-Feng Wang (ISAAC, 2006)

Finding the conditional location of a median path on a tree. - Biing-Feng Wang; Tzu-Chin Lin; Chien-Hsin Lin; Shan-Chyun Ku (Inf. Comput., 2008)

Improved algorithms for the minmax-regret 1-center and 1-median problems. - Hung-I Yu; Tzu-Chin Lin; Biing-Feng Wang (ACM Trans. Algorithms, 2008)

Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance. - Tzu-Chin Lin; Chung-Chin Kuo; Yong-Hsian Hsieh; Biing-Feng Wang (J. Comput. Syst. Sci., 2009)