Shan-Chyun Ku

According to our database1, Shan-Chyun Ku authored at least 12 papers between 1997 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Efficient algorithms for two generalized 2-median problems and the group median problem on trees.
Theor. Comput. Sci., 2009

2008
Finding the conditional location of a median path on a tree.
Inf. Comput., 2008

2006
Efficient algorithms for a constrained <i>k</i>-tree core problem in a tree network.
J. Algorithms, 2006

2004
Efficient algorithms for the scaled indexing problem.
J. Algorithms, 2004

2003
Constructing Edge-Disjoint Spanning Trees in Product Networks.
IEEE Trans. Parallel Distributed Syst., 2003

2002
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs.
J. Parallel Distributed Comput., 2002

The Conditional Location of a Median Path.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.
IEEE Trans. Parallel Distributed Syst., 2001

Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1999
Parallel Algorithms for the Tree Bisector Problem and Applications.
Proceedings of the International Conference on Parallel Processing 1999, 1999

1998
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network.
Proceedings of the 1997 International Conference on Parallel Processing (ICPP '97), 1997


  Loading...