Ranking Unranking and Parallel Enumerating of Topological Orders. - Bang Ye Wu; Chuan Yi Tang (ICPP (3), 1991)

An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree. - Bang Ye Wu; Chuan Yi Tang (Inf. Process. Lett., 1997)

Constructing Light Spanning Trees with Small Routing Cost. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (STACS, 1999)

An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (Inf. Process. Lett., 1999)

Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (J. Comb. Optim., 1999)

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. - Bang Ye Wu; Giuseppe Lancia; Vineet Bafna; Kun-Mao Chao; R. Ravi 001; Chuan Yi Tang (SIAM J. Comput., 1999)

Approximation algorithms for the shortest total path length spanning tree problem. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (Discret. Appl. Math., 2000)

Approximation algorithms for some optimum communication spanning tree problems. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (Discret. Appl. Math., 2000)

Polynomial time algorithms for some minimum latency problems. - Bang Ye Wu (Inf. Process. Lett., 2000)

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (J. Algorithms, 2000)

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. - Bang Ye Wu (J. Algorithms, 2002)

Light graphs with small routing cost. - Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang (Networks, 2002)

Spanning trees and optimization problems. - Bang Ye Wu; Kun-Mao Chao (Chapman & Hall, 2004)

Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. - Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang (ICCSA (3), 2004)

Approximation algorithms for the optimal p-source communication spanning tree. - Bang Ye Wu (Discret. Appl. Math., 2004)

An improved algorithm for the k-source maximum eccentricity spanning trees. - Bang Ye Wu (Discret. Appl. Math., 2004)

Exact algorithms for the minimum latency problem. - Bang Ye Wu; Zheng-Nan Huang; Fu-Jie Zhan (Inf. Process. Lett., 2004)

Constructing the Maximum Consensus Tree from Rooted Triples. - Bang Ye Wu (J. Comb. Optim., 2004)

Constructing Evolutionary Trees from Rooted Triples. - Bang Ye Wu (J. Inf. Sci. Eng., 2004)

An analysis of the LPT algorithm for the max-min and the min-ratio partition problems. - Bang Ye Wu (Theor. Comput. Sci., 2005)

Tree edge decomposition with an application to minimum ultrametric tree approximation. - Chia-Mao Huang; Bang Ye Wu; Chang-Biau Yang (J. Comb. Optim., 2006)

Approximation algorithms for some k-source shortest paths spanning tree problems. - Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang (Networks, 2006)

On the intercluster distance of a tree metric. - Bang Ye Wu (Theor. Comput. Sci., 2006)

On the uniform edge-partition of a tree. - Bang Ye Wu; Hung-Lung Wang; Shih Ta Kuan; Kun-Mao Chao (Discret. Appl. Math., 2007)

Performances of List Scheduling for Set Partition Problems. - Bang Ye Wu; Hsiu-Hui Ou (J. Inf. Sci. Eng., 2007)

Optimum Communication Spanning Trees. - Chuan Yi Tang; Kun-Mao Chao; Bang Ye Wu (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Finding Friend Groups in Blogosphere. - Shih Ta Kuan; Bang Ye Wu; Wan-Jui Lee (AINA Workshops, 2008)

The Swap Edges of a Multiple-Sources Routing Tree. - Bang Ye Wu; Chih-Yuan Hsiao; Kun-Mao Chao (Algorithmica, 2008)

Minimum Lk path partitioning - An illustration of the Monge property. - Pei-Hao Ho; Arie Tamir; Bang Ye Wu (Oper. Res. Lett., 2008)

An optimal algorithm for the maximum-density path in a tree. - Bang Ye Wu (Inf. Process. Lett., 2009)

The backup 2-center and backup 2-median problems on trees. - Hung-Lung Wang; Bang Ye Wu; Kun-Mao Chao (Networks, 2009)

A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs. - Bang Ye Wu (CGGA, 2010)

Influence Clubs in Social Networks. - Chin-Ping Yang; Chen-Yi Liu; Bang Ye Wu (ICCCI (2), 2010)

A tight bound on the min-ratio edge-partitioning problem of a tree. - An-Chiang Chu; Bang Ye Wu; Hung-Lung Wang; Kun-Mao Chao (Discret. Appl. Math., 2010)

Tree-based object tracking without mobility statistics in wireless sensor networks. - Li-Hsing Yen; Bang Ye Wu; Chia-Cheng Yang (Wirel. Networks, 2010)

On the Maximum Locally Clustered Subgraph and Some Related Problems. - Bang Ye Wu (COCOA, 2011)

A Structural Approach for Finding Real-Friend Links in Internet Social Networks. - Yao-Ting Huang; Kuan-Hung Lin; Bang Ye Wu (iThings/CPSCom, 2011)

The maximum disjoint paths problem on multi-relations social networks - Bang Ye Wu (CoRR, 2011)

A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. - Bang Ye Wu (J. Comput. Syst. Sci., 2011)

A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths - Bang Ye Wu; Jun-Lin Guo; Yue-Li Wang (CoRR, 2012)

On the maximum disjoint paths problem on edge-colored graphs. - Bang Ye Wu (Discret. Optim., 2012)

Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. - Bang Ye Wu (Discret. Math. Algorithms Appl., 2012)

On the Clustered Steiner Tree Problem. - Bang Ye Wu (COCOA, 2013)

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. - Bang Ye Wu (Algorithmica, 2013)

A simple approximation algorithm for the internal Steiner minimum tree. - Bang Ye Wu (CoRR, 2013)

A linear-time algorithm for finding an edge-partition with max-min ratio at most two. - An-Chiang Chu; Bang Ye Wu; Kun-Mao Chao (Discret. Appl. Math., 2013)

Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. - Bang Ye Wu (J. Comb. Optim., 2013)

On the Min-Max 2-Cluster Editing Problem. - Li-Hsuan Chen; Maw-Shang Chang; Chun-Chieh Wang; Bang Ye Wu (J. Inf. Sci. Eng., 2013)

Clustered Trees with Minimum Inter-cluster Distance. - Bang Ye Wu; Chen-Wan Lin (CSE, 2014)

Finding Centers and Medians of a Tree by Distance Queries. - Bang Ye Wu (FUN, 2014)

A 2-approximation algorithm for the clustered minimum routing cost tree problem. - Chen-Wan Lin; Bang Ye Wu (ICS, 2014)

On approximating metric 1-median in sublinear time. - Bang Ye Wu (Inf. Process. Lett., 2014)

A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion. - Bang Ye Wu (COCOON, 2015)

Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. - Bang Ye Wu; Li-Hsuan Chen (Algorithmica, 2015)

On the clustered Steiner tree problem. - Bang Ye Wu; Chen-Wan Lin (J. Comb. Optim., 2015)

The next-to-shortest path problem on directed graphs with positive edge weights. - Bang Ye Wu; Hung-Lung Wang (Networks, 2015)

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. - Li-Hsuan Chen; Dun-Wei Cheng; Sun-Yuan Hsieh; Ling-Ju Hung; Chia-Wei Lee; Bang Ye Wu (COCOON, 2016)

On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (CIAC, 2017)

Parameterized algorithms for min-max 2-cluster editing. - Li-Hsuan Chen; Bang Ye Wu (J. Comb. Optim., 2017)

On the minimum routing cost clustered tree problem. - Chen-Wan Lin; Bang Ye Wu (J. Comb. Optim., 2017)

An improved parameterized algorithm for the p-cluster vertex deletion problem. - Bang Ye Wu; Li-Hsuan Chen (J. Comb. Optim., 2017)

Optimum Communication Spanning Trees. - Bang Ye Wu; Chuan Yi Tang; Kun-Mao Chao (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. - Li-Hsuan Chen; Dun-Wei Cheng; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (J. Comput. Syst. Sci., 2018)