The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bang Ye Wu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  28. Finding Friend Groups in Blogosphere. [Citation Graph (, )][DBLP]


  29. The Swap Edges of a Multiple-Sources Routing Tree. [Citation Graph (, )][DBLP]


  30. A tight bound on the min-ratio edge-partitioning problem of a tree. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002