Bang Ye Wu

70 papers A* 1A 2B 1C 3Misc 4Journal 48Unranked 8
YearRankTypeTitle / Venue / Authors
2018 J jnl
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci.
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
2018 — ch.
Optimum Communication Spanning Trees.
Handbook of Approximation Algorithms and Metaheuristics (2)
Bang Ye Wu, Chuan Yi Tang, Kun-Mao Chao
2017 J jnl
An improved parameterized algorithm for the p-cluster vertex deletion problem.
J. Comb. Optim.
Bang Ye Wu, Li-Hsuan Chen
2017 C conf
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.
CIAC
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
2017 J jnl
On the minimum routing cost clustered tree problem.
J. Comb. Optim.
Chen-Wan Lin, Bang Ye Wu
2017 J jnl
Parameterized algorithms for min-max 2-cluster editing.
J. Comb. Optim.
Li-Hsuan Chen, Bang Ye Wu
2016 Misc conf
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs.
COCOON
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu
2015 Misc conf
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion.
COCOON
Bang Ye Wu
2015 J jnl
On the clustered Steiner tree problem.
J. Comb. Optim.
Bang Ye Wu, Chen-Wan Lin
2015 J jnl
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions.
Algorithmica
Bang Ye Wu, Li-Hsuan Chen
2015 J jnl
The next-to-shortest path problem on directed graphs with positive edge weights.
Networks
Bang Ye Wu, Hung-Lung Wang
2014 A conf
A 2-approximation algorithm for the clustered minimum routing cost tree problem.
ICS
Chen-Wan Lin, Bang Ye Wu
2014 — conf
Clustered Trees with Minimum Inter-cluster Distance.
CSE
Bang Ye Wu, Chen-Wan Lin
2014 Misc conf
Finding Centers and Medians of a Tree by Distance Queries.
FUN
Bang Ye Wu
2014 J jnl
On approximating metric 1-median in sublinear time.
Inf. Process. Lett.
Bang Ye Wu
2013 J jnl
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.
Algorithmica
Bang Ye Wu
2013 J jnl
A linear-time algorithm for finding an edge-partition with max-min ratio at most two.
Discret. Appl. Math.
An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao
2013 J jnl
A simple approximation algorithm for the internal Steiner minimum tree.
CoRR
Bang Ye Wu
2013 J jnl
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs.
J. Comb. Optim.
Bang Ye Wu
2013 C conf
On the Clustered Steiner Tree Problem.
COCOA
Bang Ye Wu
2013 J jnl
On the Min-Max 2-Cluster Editing Problem.
J. Inf. Sci. Eng.
Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu
2013 J jnl
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
CoRR
Bang Ye Wu, Li-Hsuan Chen
2012 J jnl
A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
CoRR
Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang
2012 J jnl
Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs.
Discret. Math. Algorithms Appl.
Bang Ye Wu
2012 J jnl
On the maximum disjoint paths problem on edge-colored graphs.
Discret. Optim.
Bang Ye Wu
2011 — conf
A Structural Approach for Finding Real-Friend Links in Internet Social Networks.
iThings/CPSCom
Yao-Ting Huang, Kuan-Hung Lin, Bang Ye Wu
2011 J jnl
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs.
J. Comput. Syst. Sci.
Bang Ye Wu
2011 J jnl
A simpler and more efficient algorithm for the next-to-shortest path problem
CoRR
Bang Ye Wu
2011 J jnl
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
CoRR
Bang Ye Wu
2011 C conf
On the Maximum Locally Clustered Subgraph and Some Related Problems.
COCOA
Bang Ye Wu
2011 J jnl
The maximum disjoint paths problem on multi-relations social networks
CoRR
Bang Ye Wu
2010 — conf
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs.
CGGA
Bang Ye Wu
2010 — conf
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.
COCOA (2)
Bang Ye Wu
2010 J jnl
A tight bound on the min-ratio edge-partitioning problem of a tree.
Discret. Appl. Math.
An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao
2010 — conf
Influence Clubs in Social Networks.
ICCCI (2)
Chin-Ping Yang, Chen-Yi Liu, Bang Ye Wu
2010 J jnl
Tree-based object tracking without mobility statistics in wireless sensor networks.
Wirel. Networks
Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang
2009 J jnl
An optimal algorithm for the maximum-density path in a tree.
Inf. Process. Lett.
Bang Ye Wu
2009 J jnl
The backup 2-center and backup 2-median problems on trees.
Networks
Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao
2008 — conf
Finding Friend Groups in Blogosphere.
AINA Workshops
Shih Ta Kuan, Bang Ye Wu, Wan-Jui Lee
2008 J jnl
Minimum L
Oper. Res. Lett.
Pei-Hao Ho, Arie Tamir, Bang Ye Wu
2008 J jnl
The Swap Edges of a Multiple-Sources Routing Tree.
Algorithmica
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
2007 J jnl
On the uniform edge-partition of a tree.
Discret. Appl. Math.
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao
2007 — ch.
Optimum Communication Spanning Trees.
Handbook of Approximation Algorithms and Metaheuristics
Chuan Yi Tang, Kun-Mao Chao, Bang Ye Wu
2007 J jnl
Performances of List Scheduling for Set Partition Problems.
J. Inf. Sci. Eng.
Bang Ye Wu, Hsiu-Hui Ou
2006 J jnl
Approximation algorithms for some
Networks
Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
2006 J jnl
On the intercluster distance of a tree metric.
Theor. Comput. Sci.
Bang Ye Wu
2006 J jnl
Tree edge decomposition with an application to minimum ultrametric tree approximation.
J. Comb. Optim.
Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
2005 J jnl
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems.
Theor. Comput. Sci.
Bang Ye Wu
2004 J jnl
An improved algorithm for the k-source maximum eccentricity spanning trees.
Discret. Appl. Math.
Bang Ye Wu
2004 — conf
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
ICCSA (3)
Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
2004 J jnl
Approximation algorithms for the optimal
Discret. Appl. Math.
Bang Ye Wu
2004 J jnl
Constructing Evolutionary Trees from Rooted Triples.
J. Inf. Sci. Eng.
Bang Ye Wu
2004 J jnl
Constructing the Maximum Consensus Tree from Rooted Triples.
J. Comb. Optim.
Bang Ye Wu
2004 J jnl
Exact algorithms for the minimum latency problem.
Inf. Process. Lett.
Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan
2004 — book
Spanning trees and optimization problems.
Bang Ye Wu, Kun-Mao Chao
2002 J jnl
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees.
J. Algorithms
Bang Ye Wu
2002 J jnl
Light graphs with small routing cost.
Networks
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
2000 J jnl
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
J. Algorithms
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
2000 J jnl
Approximation algorithms for some optimum communication spanning tree problems.
Discret. Appl. Math.
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
2000 J jnl
Approximation algorithms for the shortest total path length spanning tree problem.
Discret. Appl. Math.
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
2000 J jnl
Polynomial time algorithms for some minimum latency problems.
Inf. Process. Lett.
Bang Ye Wu
1999 J jnl
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput.
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1999 J jnl
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
Inf. Process. Lett.
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
1999 J jnl
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim.
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
1999 A conf
Constructing Light Spanning Trees with Small Routing Cost.
STACS
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
1998 A* conf
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1998 B conf
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.
ISAAC
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
1998 Misc conf
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
COCOON
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
1997 J jnl
An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Inf. Process. Lett.
Bang Ye Wu, Chuan Yi Tang
1991 — conf
Ranking Unranking and Parallel Enumerating of Topological Orders.
ICPP (3)
Bang Ye Wu, Chuan Yi Tang