default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBang Ye Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j42]Li-Hsuan Chen
, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu:
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92: 92-112 (2018)- [p1]Bang Ye Wu, Chuan Yi Tang, Kun-Mao Chao:
Optimum Communication Spanning Trees. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j41]Bang Ye Wu, Li-Hsuan Chen:
An improved parameterized algorithm for the p-cluster vertex deletion problem. J. Comb. Optim. 33(2): 373-388 (2017) - [j40]Chen-Wan Lin, Bang Ye Wu:
On the minimum routing cost clustered tree problem. J. Comb. Optim. 33(3): 1106-1121 (2017) - [j39]Li-Hsuan Chen, Bang Ye Wu:
Parameterized algorithms for min-max 2-cluster editing. J. Comb. Optim. 34(1): 47-63 (2017) - [c19]Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu:
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. CIAC 2017: 152-163 - 2016
- [c18]Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu:
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. COCOON 2016: 222-234 - 2015
- [j38]Bang Ye Wu, Li-Hsuan Chen:
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. Algorithmica 72(3): 818-835 (2015) - [j37]Bang Ye Wu, Chen-Wan Lin:
On the clustered Steiner tree problem. J. Comb. Optim. 30(2): 370-386 (2015) - [j36]Bang Ye Wu, Hung-Lung Wang:
The next-to-shortest path problem on directed graphs with positive edge weights. Networks 65(3): 205-211 (2015) - [c17]Bang Ye Wu:
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion. COCOON 2015: 469-480 - 2014
- [j35]Bang Ye Wu:
On approximating metric 1-median in sublinear time. Inf. Process. Lett. 114(4): 163-166 (2014) - [c16]Bang Ye Wu, Chen-Wan Lin:
Clustered Trees with Minimum Inter-cluster Distance. CSE 2014: 1138-1141 - [c15]Bang Ye Wu:
Finding Centers and Medians of a Tree by Distance Queries. FUN 2014: 352-363 - [c14]Chen-Wan Lin, Bang Ye Wu:
A 2-approximation algorithm for the clustered minimum routing cost tree problem. ICS 2014: 3-10 - 2013
- [j34]Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. Algorithmica 65(2): 467-479 (2013) - [j33]An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao:
A linear-time algorithm for finding an edge-partition with max-min ratio at most two. Discret. Appl. Math. 161(7-8): 932-943 (2013) - [j32]Bang Ye Wu:
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. J. Comb. Optim. 26(3): 592-607 (2013) - [j31]Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu:
On the Min-Max 2-Cluster Editing Problem. J. Inf. Sci. Eng. 29(6): 1109-1120 (2013) - [c13]Bang Ye Wu:
On the Clustered Steiner Tree Problem. COCOA 2013: 60-71 - [i6]Bang Ye Wu, Li-Hsuan Chen:
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions. CoRR abs/1303.6867 (2013) - [i5]Bang Ye Wu:
A simple approximation algorithm for the internal Steiner minimum tree. CoRR abs/1307.3822 (2013) - 2012
- [j30]Bang Ye Wu:
On the maximum disjoint paths problem on edge-colored graphs. Discret. Optim. 9(1): 50-57 (2012) - [j29]Bang Ye Wu:
Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. Discret. Math. Algorithms Appl. 4(1) (2012) - [i4]Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang:
A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths. CoRR abs/1203.5235 (2012) - 2011
- [j28]Bang Ye Wu:
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. J. Comput. Syst. Sci. 77(6): 1054-1057 (2011) - [c12]Bang Ye Wu:
On the Maximum Locally Clustered Subgraph and Some Related Problems. COCOA 2011: 234-246 - [c11]Yao-Ting Huang, Kuan-Hung Lin, Bang Ye Wu:
A Structural Approach for Finding Real-Friend Links in Internet Social Networks. iThings/CPSCom 2011: 305-312 - [i3]Bang Ye Wu:
The maximum disjoint paths problem on multi-relations social networks. CoRR abs/1104.4370 (2011) - [i2]Bang Ye Wu:
A simpler and more efficient algorithm for the next-to-shortest path problem. CoRR abs/1105.0608 (2011) - [i1]Bang Ye Wu:
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. CoRR abs/1105.5915 (2011) - 2010
- [j27]An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao:
A tight bound on the min-ratio edge-partitioning problem of a tree. Discret. Appl. Math. 158(14): 1471-1478 (2010) - [j26]Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang:
Tree-based object tracking without mobility statistics in wireless sensor networks. Wirel. Networks 16(5): 1263-1276 (2010) - [c10]Bang Ye Wu:
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs. CGGA 2010: 188-194 - [c9]Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. COCOA (2) 2010: 219-227 - [c8]Chin-Ping Yang, Chen-Yi Liu, Bang Ye Wu:
Influence Clubs in Social Networks. ICCCI (2) 2010: 1-10
2000 – 2009
- 2009
- [j25]Bang Ye Wu:
An optimal algorithm for the maximum-density path in a tree. Inf. Process. Lett. 109(17): 975-979 (2009) - [j24]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
- [j23]Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao:
The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008) - [j22]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) - [c7]Shih Ta Kuan, Bang Ye Wu, Wan-Jui Lee:
Finding Friend Groups in Blogosphere. AINA Workshops 2008: 1046-1050 - 2007
- [j21]Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao:
On the uniform edge-partition of a tree. Discret. Appl. Math. 155(10): 1213-1223 (2007) - [j20]Bang Ye Wu, Hsiu-Hui Ou:
Performances of List Scheduling for Set Partition Problems. J. Inf. Sci. Eng. 23(2): 641-647 (2007) - [r1]Chuan Yi Tang, Kun-Mao Chao, Bang Ye Wu:
Optimum Communication Spanning Trees. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j19]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) - [j18]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) - [j17]Bang Ye Wu:
On the intercluster distance of a tree metric. Theor. Comput. Sci. 369(1-3): 136-141 (2006) - 2005
- [j16]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
- [b1]Bang Ye Wu, Kun-Mao Chao:
Spanning trees and optimization problems. Discrete mathematics and its applications, Chapman & Hall 2004, ISBN 978-1-58488-436-1, pp. I-XV, 1-184 - [j15]Bang Ye Wu:
Approximation algorithms for the optimal p-source communication spanning tree. Discret. Appl. Math. 143(1-3): 31-42 (2004) - [j14]Bang Ye Wu:
An improved algorithm for the k-source maximum eccentricity spanning trees. Discret. Appl. Math. 143(1-3): 342-350 (2004) - [j13]Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan:
Exact algorithms for the minimum latency problem. Inf. Process. Lett. 92(6): 303-309 (2004) - [j12]Bang Ye Wu:
Constructing the Maximum Consensus Tree from Rooted Triples. J. Comb. Optim. 8(1): 29-39 (2004) - [j11]Bang Ye Wu:
Constructing Evolutionary Trees from Rooted Triples. J. Inf. Sci. Eng. 20(1): 181-190 (2004) - [c6]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 - 2002
- [j10]Bang Ye Wu:
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms 44(2): 359-378 (2002) - [j9]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Light graphs with small routing cost. Networks 39(3): 130-138 (2002) - 2000
- [j8]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for some optimum communication spanning tree problems. Discret. Appl. Math. 102(3): 245-266 (2000) - [j7]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for the shortest total path length spanning tree problem. Discret. Appl. Math. 105(1-3): 273-289 (2000) - [j6]Bang Ye Wu:
Polynomial time algorithms for some minimum latency problems. Inf. Process. Lett. 75(5): 225-229 (2000) - [j5]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)
1990 – 1999
- 1999
- [j4]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) - [j3]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) - [j2]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) - [c5]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Constructing Light Spanning Trees with Small Routing Cost. STACS 1999: 334-344 - 1998
- [c4]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 - [c3]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC 1998: 407-416 - [c2]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
- [j1]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
- [c1]Bang Ye Wu, Chuan Yi Tang:
Ranking Unranking and Parallel Enumerating of Topological Orders. ICPP (3) 1991: 284-285
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
