Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. - Shan-Chyun Ku; Wei-Kuan Shih; Biing-Feng Wang (ICPP, 1997)

Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. - Shan-Chyun Ku; Biing-Feng Wang (IPPS/SPDP, 1998)

Parallel Algorithms for the Tree Bisector Problem and Applications. - Biing-Feng Wang; Shan-Chyun Ku; Keng-Hua Shi; Ting-Kai Hung; Pei-Sen Liu (ICPP, 1999)

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

Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. - Biing-Feng Wang; Shan-Chyun Ku; Keng-Hua Shi (IEEE Trans. Parallel Distributed Syst., 2001)

The Conditional Location of a Median Path. - Biing-Feng Wang; Shan-Chyun Ku; Yong-Hsian Hsieh (COCOON, 2002)

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. - Shan-Chyun Ku; Biing-Feng Wang (J. Parallel Distributed Comput., 2002)

Constructing Edge-Disjoint Spanning Trees in Product Networks. - Shan-Chyun Ku; Biing-Feng Wang; Ting-Kai Hung (IEEE Trans. Parallel Distributed Syst., 2003)

Efficient algorithms for the scaled indexing problem. - Biing-Feng Wang; Jyh-Jye Lin; Shan-Chyun Ku (J. Algorithms, 2004)

Efficient algorithms for a constrained k-tree core problem in a tree network. - Biing-Feng Wang; Shietung Peng; Hong-Yi Yu; Shan-Chyun Ku (J. Algorithms, 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)

Efficient algorithms for two generalized 2-median problems and the group median problem on trees. - Chi-Yuan Chan; Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang (Theor. Comput. Sci., 2009)