Publications: (Bang Ye Wu)
(a) SCI Journal papers:
1. Wu, B.Y. and Tang, C.Y. (1997)," An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree", Information Processing Letters, Vol. 63, pp. 263--269. [SCIE, EI]
2. Wu, B.Y., Chao, K.-M., and Tang, C.Y. (1999), “An efficient algorithm for the length-constrained heaviest path problem on a tree”, Information Processing Letters, vol. 69, pp.~63--67. [SCIE, EI] PDF
3. Wu, B.Y., Chao, K.-M., and Tang, C.Y. (1999), “Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices”, Journal of Combinatorial Optimization, vol. 3, pp. 199-211. [SCIE, EI]
4. Wu, B.Y., Lancia, G., Bafna, V., Chao, K.-M., Ravi, R., and Tang, C.Y. (2000), “A polynomial time approximation scheme for minimum routing cost spanning trees”, SIAM J. on Computing, vol. 29, no. 3, pp. 761-778. [SCI,EI] PDF
5. Wu, B.Y., Chao, K.-M., and Tang, C.Y. (2000), "Approximation algorithms for some optimum communication spanning tree problems", Discrete Applied Mathematics, vol. 102(3), pp. 245-266. [SCI,EI] PDF
6. Wu, B.Y., Chao, K.-M., and Tang, C.Y. (2000), “Approximation algorithms for the shortest total path length spanning tree problem”, Discrete Applied Mathematics, vol. 105, pp. 273-289. [SCI,EI] PDF
7. Wu, B.Y., Chao, K.-M., and Tang, C.Y. (2000), " A polynomial time approximation scheme for optimal product-requirement communication spanning trees”, Journal of Algorithms, vol. 36, pp. 182-204. [SCI,EI] PDF
8. Wu, B.Y. (2000), "Polynomial time algorithms for some minimum latency problems", Information Processing Letters, vol. 75(5), pp. 225-229. [SCIE, EI]
9. Wu, B.Y., Chao, K.M., and Tang. C.Y. , (2002), "Light graphs with small routing cost", Networks, vol. 39(3), pp. 130-138, [SCI,EI]. (NSC 90-2213-E-366-005)
10. Wu, B.Y. (2004), "Constructing the maximum consensus tree from rooted triples", Journal of Combinatorial Optimization, vol. 8(1), pp. 29-39. [SCIE, EI] (NSC 89-2218-E-366-003) PDF
11. Wu, B.Y., (2002), “A polynomial time approximation scheme for the two-source minimum routing cost spanning trees”, Journal of Algorithms, vol. 44(2), pp. 359-378, [SCI,EI] (NSC 91-2213-E-366-004). PDF
12. Wu, B.Y., (2004),“Constructing evolutionary trees from rooted triples”, Journal of Information Science and Engineering, vol. 20(1), pp. 181-190. [SCIE, EI] (NSC 89-2218-E-366-003) PDF
13. Wu, B.Y., (2004),“Approximation algorithms for the optimal p-source communication spanning tree”, Discrete Applied Mathematics, vol. 143, pp. 31-42. [SCI,EI] (NSC 92-2213-E-366-001) (PDF)
14. Wu, B.Y., (2004),“An improved algorithm for the k-source maximum eccentricity spanning trees”, Discrete Applied Mathematics, vol. 143, pp. 342-350. [SCI,EI] (NSC 92-2213-E-366-001) (PDF)
15. Wu, B.Y., Z.-N. Huang and F.-J. Zhan (2004/12), “Exact algorithms for the minimum latency problem”, Information Processing Letters, vol. 92(6), pp. 303-309. [SCI,EI] PDF
16. Wu, B.Y. and Ou, H.-H. (2007/3), Performances of list scheduling for set partition problems, Journal of Information Science and Engineering, vol. 23, no. 2, pp. 641-647. [SCIE,EI](corresponding author) (link)
17. Wu, B.Y. (2005/12), An analysis of the LPT algorithm for the max-min and the min-ratio partition problems, Theoretical Computer Science, vol. 349(3), pp. 407--419. [SCI,EI] (doi:10.1016/j.tcs.2005.08.032)
18. Y.-H. Chen, B.Y. Wu and C.Y. Tang, (2006/5), Approximation algorithms for some k-source shortest paths spanning tree problems, Networks, vol. 47(3), pp. 147--156. [SCI,EI] (NSC 93-2213-E-366-001) (link)
19. C.-M. Huang, B.Y. Wu and C.-B. Yang, (2006/11), Tree edge decomposition with an application to minimum ultrametric tree approximation, Journal of Combinatorial Optimization, vol. 12(3), pp. 217--230. [SCIE, EI] (corresponding author) (link)
20. B.Y. Wu, C.-Y. Hsiao, and K.-M. Chao (2008/2), The swap edges of a multiple-sources routing tree, Algorithmica, 50(3), pp. 299-311. [SCI, EI]
21. B.Y. Wu, (2006/12), On the intercluster distance of a tree metric, Theoretical Computer Science, vol. 369, pp. 136--141. [SCI, EI] http://dx.doi.org/10.1016/j.tcs.2006.07.056
22. B.Y. Wu, H.-L. Wang, S.T. Kuan and K.-M. Chao, (2007/5), On the uniform edge-partition of a tree, Discrete Applied Mathematics, vol. 155 (10), pp. 1213-1223. [SCI] (corresponding author) doi:10.1016/j.dam.2006.10.012
23. P.-H. Ho, A. Tamir and B.Y. Wu, (2008/1), Minimum Lk path partitioning—An illustration of the Monge property, Operations Research Letters, 36(1), 43-45, [SCI, EI] doi:10.1016/j.orl.2007.03.010
24. H.-L. Wang, B.Y. Wu and K.-M. Chao (2009/1), The Backup 2-Center and Backup 2-Median Problems on Trees, Networks, 53(1), 39-49. [SCI, EI]
25.
B.Y. Wu (2009/8), An optimal algorithm for the maximum-density path in a tree,
Information
Processing Letters,
109(17), 975-979. 
doi:10.1016/j.ipl.2009.05.005
[SCI]
26. L.-H. Yen, B. Y. Wu and C.-C. Yang (2010), Tree-based object tracking without mobility statistics in wireless sensor networks, Wireless Networks, 16(5): 1263-1276. DOI 10.1007/s11276-009-0201-2 [SCI]
27.
A.-C. Chua, B.Y. Wu, H.-L.
Wang, K.-M. Chao, (2010/7) A tight bound on the
min-ratio edge-partitioning problem of a tree, Discrete Applied Mathematics, 158(14): 1471-1478. 
doi:10.1016/j.dam.2010.05.014 [SCI]
28.
B.Y. Wu (2010) A note on approximating the min-max vertex disjoint paths on
directed acyclic graphs. Journal of
Computer and System Sciences, in press, doi:10.1016/j.jcss.2010.08.012 [SCI]
(b) Conference & other Journal Papers:
(Note: Polished forms of many of the following conference papers have appeared in journals listed above.)
1. Wu, B.Y. and Tang, C.Y. (1990), "An optimal parallel algorithm for generating permutations on linear array", Proceedings of the First Workshop on Parallel Processing 1990, Hsinchu, Taiwan, Republic of China, pp. 106-110.
2. Wu, B.Y. and Tang, C.Y. (1991), "Ranking, unranking and parallel enumerating topological orders", Proceedings of the 1991 International Conference on Parallel Processing, ICPP 1991, Pennsylvania University, U.S.A., Vol. III, pp. 284-285.
3.
Wu, B.Y. and Tang, C.Y. (1994),
"Ranking, unranking and parallel enumerating of
shortest disjoint paths on hypercube", post paper in the International
Symposium on Parallel Architectures, Algorithms, and Networks,
4. Wu, B.Y. and Tang, C.Y. (1994), "The problem of lexicograph unranking of a permutation is in NC", Proceedings of the NSC -- Physical Science and Engineering, Vol. 18, No. 4, pp. 384-352. [EI]
5.
Wu, B.Y. and Tang, C.Y. (1996),
“An approximate algorithm for evolutionary tree
reconstruction from distance matrix”, in Proceedings of
International Conference on Algorithms (joint with International Computer
Symposium (ICS'96),
6.
Wu, B.Y., Chao, K.M. and Tang,
C. Y. , (1997), Approximation Algorithms for the
Shortest Total Path Length Spanning Tree Problem,”
Proceedings of the 14th Workshop on Combinatorial Mathematics and Computational
Theory, 10-15,
7. Wu, B.Y., Chao, K.M., and Tang, C.Y. (1997), “Algorithms for finding the shortest total path length 2-star on a metric space”, in Proceedings of National Computer Symposium 1997 Republic of China, Taiwan, R,O,C, pp.~ E-73, 1997.
8. Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R. and Tang, C.Y. (1998), “A polynomial-time approximation scheme for optimum routing spanning trees”, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pp. 21-32.
9. Wu, B.Y., Chao, K.M., and Tang, C.Y.(1998), “Approximation algorithm for some optimum communication spanning tree problems”, Proceedings of Ninth Annual International Symposium on Algorithm and Computation (ISSAC’98), Lecture Notes in Computer Science, (Springer Verlag), Vol. 1533, pp.407-416. [EI]
10. Wu, B.Y., Chao, K.M., and Tang, C.Y. (1998), “Exact and approximation algorithms for constructing ultrametric trees form distance matrices”, in: W.L. Hsu and M.Y. Kao eds., Proceedings of Fourth Annual International Computing and Combinatorics Conference, (COCOON’98), Lecture notes in Computer Science, (Springer Verlag), Vol. 1449, pp.299-308, [EI]
11. Wu, B.Y., Chao, K.M., and Tang, C.Y. (1999) “Constructing Light Spanning Trees with Small Routing Cost”, Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99), Lecture Notes in Computer Science, (Springer Verlag), Vol. 1563, pp. 334-344 [EI]
1.
Wu, B.Y. (2001), " A fast algorithm for rooting a tree to minimize the ultrametric size", in Proceedings of National Computer
Symposium 2001,
2.
Wu, B.Y. (2001), " Constructing the maximum consensus tree from rooted
triples", in Proceedings of National Computer Symposium 2001,
3.
Wu, B.Y. (2001),
"Approximation algorithms for the two-source optimum communication spanning
trees", in Proceedings of National Computer Symposium 2001,
4.
Wu, B.Y., Chao, K.M., and Tang,
C.Y. (2002), “On the optimum requirement graph problem”, in Proceedings of the 19th Workshop on Combinatorial Mathematics
and Computation Theory”,
5. Wu, B.Y. (2002), “Approximating the two-source minimum routing cost spanning trees of metric graphs”, in Proceedings of the 19th Workshop on Combinatorial Mathematics and Computation Theory”, Taiwan, R.O.C. pp. 29-34. (NSC 91-2213-E-366-004)
6.
Wu, B.Y. (2002), “Constructing evolutionary trees from rooted triples”, in Proceedings of the ICS02,
7.
Wu, B.Y. (2003), “An improved algorithm for the k-source maximum eccentricity spanning
trees”, in Proceedings of the 20th Workshop on
Combinatorial Mathematics and Computation Theory”,
8. Wu, B.Y., Wang, H.-L., Kuan, S.T., Chao, K.-M. (2004), “On the uniform edge-partition of a tree”, in Proceedings of the 21th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 132-140.
9. Chen, Y.H, Wu, B.Y., Tang, C.Y. (2004), “Approximation algorithms for k-source bottleneck routing cost spanning tree problems”, in Proceedings of the International Conference on Computer Science and Its Application (ICCSA 2004), LNCS Vol. 3044, Springer, pp. 355-366. [EI]
10. 張良毅, 楊智程, 吳邦一(2004), 實作線上裁判系統與互動式程式設計教學系統, 台灣網際網路研討會(TANET2004), pp. 236-241. (In Chinese)
11. Wu, B.Y., Z.-N. Huang and F.-J. Zhan (2005), “Exact algorithms for the minimum latency problem”, in Proceedings of the 22th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 140-145.
12. Wu, B.Y. and Ou, H.-H. (2005), Performances of list scheduling for set partition problems, in Proceedings of the 22th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 146-150.
13. Wu, B.Y., Hsiao, C.-Y. and K.-M. Chao (2005), The swap edges of a multiple source routing tree, in Proceedings of the 22th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 244-260.
14. J.-W. Hsu, S.-F. Lin, S.-T. Kuan and B.Y. Wu, (2005/6), “Exact and heuristic algorithms for tree edge partition”, Journal of Shu-Te University, vol. 7(2), pp. 71-77. (In Chinese)
15.
J.-W. Hsu, S.-F. Lin, S.-T. Kuan and B.Y. Wu, (2005/6), “Exact
and heuristic algorithms for tree edge partition”, in
Proceedings of the 2005 Symposium on Applications of Information, Management and
Communication
16. B.Y. Wu (2006/4), On the intercluster and inner-cluster distances of a tree, in Proceedings of the 23th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 188-193
17.
B.Y. Wu and P.-H. Ho (2006/6), An efficient algorithm for the minimum L_2 path partition,
in Proceedings of the 2006 Symposium on Applications of Information, Management
and Communication
18. 許無寒, 許迺赫, Bang Ye Wu (吳邦一) (2007/4), Web 2.0 時代人際網路之計算問題 -- 以WARM 網站為例, potster paper in Proceedings of the 24th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, R.O.C. pp. 367-370
19. 許釗慎、吳邦一, (2007/6),基於B&B的Approximation Schemes-以最小等待時間為例,in Proceedings of the 2007 Symposium on Applications of Information, Management and Communication Technology, Taiwan, R.O.C.
20.
S.-T. Kuan,
B.Y. Wu, W.-J. Lee (2008/3), Finding Friend Groups in Blogosphere, in
Proceedings of the IEEE 22nd International Conference on Advanced Information
Networking and Applications (AINA2008), Okinawa
21.
B.Y. Wu, L. Huang, C.Y. Lin
(2008/4), On the minimum density of 2-clique and 3/2-clique in directed graphs,
in Proceedings of the 25th Workshop on Combinatorial Mathematics and
Computation Theory,
22. B.Y. Wu and H.-C. Chen (2009/4), The approximability of the minimum border problem, in Proceedings of the 26th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan
23. C.-P. Yang, H.-C. Chen, S.-D. Hsiea and B.Y. Wu (2009/11). Heuristic Algorithms for finding 2-clubs in an undirected graph, NCS 2009, Taiwan.
24.
B.Y. Wu and H.-C. Chen
(2010/4), Sufficient conditions for the non-separating paths, in Proceedings of
the 27th Workshop on Combinatorial Mathematics and Computation Theory,
25. Y.C Liu and B.Y. Wu (2010/5), Algorithms for the similarities in 2-mode social networks---with a case study in BBS, 2010 Conference on Technology and Application in Outlying islands, Taiwan.
26.
C.J Tseng and B.Y. Wu (2010/5), Algorithms for
detecting flow based communities, 2010 Conference on Technology and Application
in Outlying islands,
27. C.-P. Yang, C.-Y. Liu, B.Y. Wu (2010/11), Influence Clubs in Social Networks, Proceedings of the 2010 Computational Collective Intelligence. Technologies and Applications, LN AI Vol. 6422, Springer, pp. 1-10, Taiwan, 2010. [EI]
28. B.Y. Wu (2010/12), A simpler and more efficient algorithm for the next-to-shortest path problem, Proceeding of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA'10) Part II, LNCS Vol. 6509, pp. 219-227.. [EI]
(c) Books & other reports:
1.
Wu,
B.Y., Tang C.Y., and Chao, K.-M. (2007/5) “Optimum
communication spanning trees,” a chapter of the book “Handbook of Approximation Algorithms and Metaheuristics," edited by Teofilo
F. Gonzalez (
2. Wu, B.Y. and Chao, K-.M. (2004), Spanning Trees and Optimization Problems, ISBN: 1584884363, Chapman & Hall / CRC
3. 吳邦一 (2004),最佳需求傳輸圖形之研究,工程科技通訊, vol. 74, pp. 123-124,國科會
Revised date: