| 2009 |
|---|
| 31 | EE | Hung-Lung Wang,
Bang Ye Wu,
Kun-Mao Chao:
The backup 2-center and backup 2-median problems on trees.
Networks 53(1): 39-49 (2009) |
| 2008 |
|---|
| 30 | EE | Shih Ta Kuan,
Bang Ye Wu,
Wan-Jui Lee:
Finding Friend Groups in Blogosphere.
AINA Workshops 2008: 1046-1050 |
| 29 | EE | Bang Ye Wu,
Chih-Yuan Hsiao,
Kun-Mao Chao:
The Swap Edges of a Multiple-Sources Routing Tree.
Algorithmica 50(3): 299-311 (2008) |
| 28 | EE | Pei-Hao Ho,
Arie Tamir,
Bang Ye Wu:
Minimum Lk path partitioning - An illustration of the Monge property.
Oper. Res. Lett. 36(1): 43-45 (2008) |
| 2007 |
|---|
| 27 | EE | Bang Ye Wu,
Hung-Lung Wang,
Shih Ta Kuan,
Kun-Mao Chao:
On the uniform edge-partition of a tree.
Discrete Applied Mathematics 155(10): 1213-1223 (2007) |
| 26 | EE | Bang Ye Wu,
Hsiu-Hui Ou:
Performances of List Scheduling for Set Partition Problems.
J. Inf. Sci. Eng. 23(2): 641-647 (2007) |
| 2006 |
|---|
| 25 | EE | Chia-Mao Huang,
Bang Ye Wu,
Chang-Biau Yang:
Tree edge decomposition with an application to minimum ultrametric tree approximation.
J. Comb. Optim. 12(3): 217-230 (2006) |
| 24 | EE | Yen Hung Chen,
Bang Ye Wu,
Chuan Yi Tang:
Approximation algorithms for some k-source shortest paths spanning tree problems.
Networks 47(3): 147-156 (2006) |
| 23 | EE | Bang Ye Wu:
On the intercluster distance of a tree metric.
Theor. Comput. Sci. 369(1-3): 136-141 (2006) |
| 2005 |
|---|
| 22 | EE | Bang Ye Wu:
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems.
Theor. Comput. Sci. 349(3): 407-419 (2005) |
| 2004 |
|---|
| 21 | EE | Yen Hung Chen,
Bang Ye Wu,
Chuan Yi Tang:
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
ICCSA (3) 2004: 355-366 |
| 20 | EE | Bang Ye Wu:
Approximation algorithms for the optimal p-source communication spanning tree.
Discrete Applied Mathematics 143(1-3): 31-42 (2004) |
| 19 | EE | Bang Ye Wu:
An improved algorithm for the k-source maximum eccentricity spanning trees.
Discrete Applied Mathematics 143(1-3): 342-350 (2004) |
| 18 | EE | Bang Ye Wu,
Zheng-Nan Huang,
Fu-Jie Zhan:
Exact algorithms for the minimum latency problem.
Inf. Process. Lett. 92(6): 303-309 (2004) |
| 17 | EE | Bang Ye Wu:
Constructing the Maximum Consensus Tree from Rooted Triples.
J. Comb. Optim. 8(1): 29-39 (2004) |
| 16 | EE | Bang Ye Wu:
Constructing Evolutionary Trees from Rooted Triples.
J. Inf. Sci. Eng. 20(1): 181-190 (2004) |
| 2002 |
|---|
| 15 | EE | Bang Ye Wu:
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees.
J. Algorithms 44(2): 359-378 (2002) |
| 14 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Light graphs with small routing cost.
Networks 39(3): 130-138 (2002) |
| 2000 |
|---|
| 13 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation algorithms for some optimum communication spanning tree problems.
Discrete Applied Mathematics 102(3): 245-266 (2000) |
| 12 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation algorithms for the shortest total path length spanning tree problem.
Discrete Applied Mathematics 105(1-3): 273-289 (2000) |
| 11 | EE | Bang Ye Wu:
Polynomial time algorithms for some minimum latency problems.
Inf. Process. Lett. 75(5): 225-229 (2000) |
| 10 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
J. Algorithms 36(2): 182-204 (2000) |
| 1999 |
|---|
| 9 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Constructing Light Spanning Trees with Small Routing Cost.
STACS 1999: 334-344 |
| 8 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
Inf. Process. Lett. 69(2): 63-67 (1999) |
| 7 | | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim. 3(2-3): 199-211 (1999) |
| 6 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput. 29(3): 761-778 (1999) |
| 1998 |
|---|
| 5 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
COCOON 1998: 299-308 |
| 4 | EE | Bang Ye Wu,
Kun-Mao Chao,
Chuan Yi Tang:
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.
ISAAC 1998: 407-416 |
| 3 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA 1998: 21-32 |
| 1997 |
|---|
| 2 | EE | Bang Ye Wu,
Chuan Yi Tang:
An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Inf. Process. Lett. 63(5): 263-269 (1997) |
| 1991 |
|---|
| 1 | | Bang Ye Wu,
Chuan Yi Tang:
Ranking Unranking and Parallel Enumerating of Topological Orders.
ICPP (3) 1991: 284-285 |
