Shan-Chyun Ku

12 papers B 3Misc 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2009 J jnl
Efficient algorithms for two generalized 2-median problems and the group median problem on trees.
Theor. Comput. Sci.
Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang
2008 J jnl
Finding the conditional location of a median path on a tree.
Inf. Comput.
Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku
2006 J jnl
Efficient algorithms for a constrained
J. Algorithms
Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
2004 J jnl
Efficient algorithms for the scaled indexing problem.
J. Algorithms
Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku
2003 J jnl
Constructing Edge-Disjoint Spanning Trees in Product Networks.
IEEE Trans. Parallel Distributed Syst.
Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung
2002 J jnl
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs.
J. Parallel Distributed Comput.
Shan-Chyun Ku, Biing-Feng Wang
2002 Misc conf
The Conditional Location of a Median Path.
COCOON
Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
2001 J jnl
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.
IEEE Trans. Parallel Distributed Syst.
Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi
2001 B conf
Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
ISAAC
Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
1999 B conf
Parallel Algorithms for the Tree Bisector Problem and Applications.
ICPP
Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
1998 — conf
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network.
IPPS/SPDP
Shan-Chyun Ku, Biing-Feng Wang
1997 B conf
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network.
ICPP
Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang