| 2009 | ||
|---|---|---|
| j7 | Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang: Efficient algorithms for two generalized 2-median problems and the group median problem on trees. Theor. Comput. Sci. 410(8-10): 867-876 (2009) | |
| 2008 | ||
| j6 | Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku: Finding the conditional location of a median path on a tree. Inf. Comput. 206(7): 828-839 (2008) | |
| 2006 | ||
| j5 | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku: Efficient algorithms for a constrained k-tree core problem in a tree network. J. Algorithms 59(2): 107-124 (2006) | |
| 2004 | ||
| j4 | Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku: Efficient algorithms for the scaled indexing problem. J. Algorithms 52(1): 82-100 (2004) | |
| 2003 | ||
| j3 | Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung: Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Trans. Parallel Distrib. Syst. 14(3): 213-221 (2003) | |
| 2002 | ||
| j2 | Shan-Chyun Ku, Biing-Feng Wang: An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. J. Parallel Distrib. Comput. 62(2): 221-227 (2002) | |
| c5 | Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh: The Conditional Location of a Median Path. COCOON 2002: 494-503 | |
| 2001 | ||
| j1 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi: Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. IEEE Trans. Parallel Distrib. Syst. 12(9): 888-898 (2001) | |
| c4 | Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin: Efficient Algorithms for Two Generalized 2-Median Problems on Trees. ISAAC 2001: 768-778 | |
| 1999 | ||
| c3 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu: Parallel Algorithms for the Tree Bisector Problem and Applications. ICPP 1999: 192-199 | |
| 1998 | ||
| c2 | Shan-Chyun Ku, Biing-Feng Wang: Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. IPPS/SPDP 1998: 370-374 | |
| 1997 | ||
| c1 | Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang: Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. ICPP 1997: 16-19 | |
| 1 | Chi-Yuan Chan | |
| 2 | Yong-Hsian Hsieh | |
| 3 | Ting-Kai Hung | |
| 4 | Chien-Hsin Lin | |
| 5 | Jyh-Jye Lin | |
| 6 | Tzu-Chin Lin | |
| 7 | Pei-Sen Liu | |
| 8 | Chi-Jen Lu | |
| 9 | Shietung Peng | |
| 10 | Keng-Hua Shi | |
| 11 | Wei-Kuan Shih | |
| 12 | Biing-Feng Wang | |
| 13 | Hong-Yi Yu |
Data released under the ODC-BY 1.0 license — See also our legal information page