Biing-Feng Wang

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 12

Top Topics

Single Machine Scheduling Problem

Shortest Path Problem

Optimization Criterion

Top Venues

IEEE ACM Trans. Comput. Biol. Bioinform.

J. Comput. Syst. Sci.

Theor. Comput. Sci.

J. Comput. Biol.

Publications

Biing-Feng Wang
Fast Algorithms for the Simplified Partial Digest Problem. J. Comput. Biol. 30 (1) (2023)
Biing-Feng Wang
A new dynamic programming algorithm for the simplified partial digest problem. Theor. Comput. Sci. 954 (2023)
Wen-Horng Sheu, Biing-Feng Wang
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples. SIAM J. Discret. Math. 37 (3) (2023)
Biing-Feng Wang
Efficient algorithms for the minmax regret path center problem with length constraint on trees. Theor. Comput. Sci. 918 (2022)
Biing-Feng Wang, Krister M. Swenson
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (2) (2021)
Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li
An improved algorithm for the minmax regret path center problem on trees. J. Comput. Syst. Sci. 114 (2020)
Biing-Feng Wang, Chih-Yu Li
Fast Algorithms for Computing Path-Difference Distances. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (2) (2019)
Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li
On the Minmax Regret Path Center Problem on Trees. FAW (2018)
Biing-Feng Wang
A New Efficient Algorithm for the Frequent Gene Team Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (2) (2018)
Jhih-Hong Ye, Chih-Yu Li, Biing-Feng Wang
An improved algorithm for the minmax regret path centdian problem on trees. J. Comput. Syst. Sci. 97 (2018)
Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen
Efficient algorithms for the round-trip 1-center and 1-median problems. J. Comput. Syst. Sci. 82 (5) (2016)
Biing-Feng Wang
A New Efficient Algorithm for the All Sorting Reversals Problem with No Bad Components. IEEE ACM Trans. Comput. Biol. Bioinform. 13 (4) (2016)
Jhih-Hong Ye, Biing-Feng Wang
On the minmax regret path median problem on trees. J. Comput. Syst. Sci. 81 (7) (2015)
Biing-Feng Wang, Chien-Hsin Lin, I-Tse Yang
Constructing a Gene Team Treein Almost $O$$(n\; {\rm lg}\; n)$ Time. IEEE ACM Trans. Comput. Biol. Bioinform. 11 (1) (2014)
Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang
A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property. COCOON (2013)
Biing-Feng Wang, Chih-Hsuan Li
On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property. COCOON (2012)
Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang
Efficient algorithms for the conditional covering problem. Inf. Comput. 219 (2012)
Biing-Feng Wang
Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (2) (2012)
Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen
On the Round-Trip 1-Center and 1-Median Problems. WALCOM (2012)
Biing-Feng Wang, Chung-Chin Kuo, Shang-Ju Liu, Chien-Hsin Lin
A New Efficient Algorithm for the Gene-Team Problem on General Sequences. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (2) (2012)
Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang
Improved data structures for the orthogonal range successor problem. Comput. Geom. 44 (3) (2011)
Biing-Feng Wang, Chien-Hsin Lin
Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (5) (2011)
Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang
Faster query algorithms for the text fingerprinting problem. Inf. Comput. 209 (7) (2011)
Jyh-Jye Lin, Chi-Yuan Chan, Biing-Feng Wang
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. Discret. Appl. Math. 158 (8) (2010)
Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. Algorithmica 56 (3) (2010)
Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. ISAAC (2) (2010)
Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. J. Comput. Syst. Sci. 76 (8) (2010)
Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsian Hsieh, Biing-Feng Wang
-norm and the Hamming distance. J. Comput. Syst. Sci. 75 (8) (2009)
Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang
Efficient Data Structures for the Orthogonal Range Successor Problem. COCOON (2009)
Biing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin
Improved Algorithms for the Gene Team Problem. COCOA (2009)
Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang
Efficient algorithms for two generalized 2-median problems and the group median problem on trees. Theor. Comput. Sci. 410 (8-10) (2009)
Yong-Hsian Hsieh, Chih-Chiang Yu, Biing-Feng Wang
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average. IEEE ACM Trans. Comput. Biol. Bioinform. 5 (2) (2008)
Li-Pu Yeh, Biing-Feng Wang
Efficient Algorithms for the kSmallest Cuts Enumeration. COCOON (2008)
Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
Improved algorithms for the minmax-regret 1-center and 1-median problems. ACM Trans. Algorithms 4 (3) (2008)
Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku
Finding the conditional location of a median path on a tree. Inf. Comput. 206 (7) (2008)
Hai-Lung Cheng, Biing-Feng Wang
On Chen and Chen's new tree inclusion algorithm. Inf. Process. Lett. 103 (1) (2007)
Chih-Chiang Yu, Yong-Hsian Hsieh, Biing-Feng Wang
Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. FCS (2007)
Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang
A Faster Query Algorithm for the Text Fingerprinting Problem. ESA (2007)
Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
-tree core problem in a tree network. J. Algorithms 59 (2) (2006)
Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
Improved Algorithms for the Minmax Regret 1-Median Problem. COCOON (2006)
Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang
Improved Algorithms for the Minmax-Regret 1-Center Problem. ISAAC (2006)
Biing-Feng Wang
Linear time algorithms for the ring loading problem with demand splitting. J. Algorithms 54 (1) (2005)
Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku
Efficient algorithms for the scaled indexing problem. J. Algorithms 52 (1) (2004)
Biing-Feng Wang
Finding r-Dominating Sets and p-Centers of Trees in Parallel. IEEE Trans. Parallel Distributed Syst. 15 (8) (2004)
Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh
Efficient Algorithms for the Ring Loading Problem with Demand Splitting. ESA (2003)
Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung
Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Trans. Parallel Distributed Syst. 14 (3) (2003)
Hong-Yi Yu, Biing-Feng Wang
An Improved Algorithm for Finding k-centrums on Weighted Trees. ICPADS (2002)
Biing-Feng Wang
Finding a 2-Core of a Tree in Linear Time. SIAM J. Discret. Math. 15 (2) (2002)
Tzu-Chin Lin, Biing-Feng Wang
Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. ICPADS (2002)
Shan-Chyun Ku, Biing-Feng Wang
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. J. Parallel Distributed Comput. 62 (2) (2002)
Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
The Conditional Location of a Median Path. COCOON (2002)
Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. IEEE Trans. Parallel Distributed Syst. 12 (9) (2001)
Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
Efficient Algorithms for Two Generalized 2-Median Problems on Trees. ISAAC (2001)
Biing-Feng Wang, Jyh-Jye Lin
Finding a Two-Core of a Tree in Linear Time. ISAAC (2000)
Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. IEEE Trans. Parallel Distributed Syst. 11 (6) (2000)
Biing-Feng Wang
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. J. Algorithms 34 (1) (2000)
Biing-Feng Wang
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. Theor. Comput. Sci. 242 (1-2) (2000)
Rong Lin, Stephan Olariu, James L. Schwing, Biing-Feng Wang
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. IEEE Trans. Parallel Distributed Syst. 10 (3) (1999)
Biing-Feng Wang, Jiunn-Nan Tsai, Yuan-Cheng Chuang
The Lowest Common Ancestor Problem on a Tree with an Unfixed Root. Inf. Sci. 119 (1-2) (1999)
Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
Parallel Algorithms for the Tree Bisector Problem and Applications. ICPP (1999)
Shan-Chyun Ku, Biing-Feng Wang
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. IPPS/SPDP (1998)
Biing-Feng Wang
Simulating the CRCW PRAM on Reconfigurable Networks. Theor. Comput. Sci. 205 (1-2) (1998)
Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
Efficient Emulations for X-trees and /w-ary Trees. Parallel Algorithms Appl. 13 (2) (1998)
Biing-Feng Wang
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. IEEE Trans. Parallel Distributed Syst. 9 (2) (1998)
Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. ICPP (1997)
Biing-Feng Wang
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. J. Algorithms 23 (2) (1997)
Biing-Feng Wang, Stephan Olariu
On the Power of the Mesh with Hybrid Buses. ISPAN (1997)
Biing-Feng Wang
A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem. Parallel Process. Lett. 6 (3) (1996)
Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng
Recognizing depth-first-search trees in parallel. IPPS (1995)
Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
The emulation problem on trees. IPPS (1995)
Gen-Huey Chen, Stephan Olariu, James L. Schwing, Biing-Feng Wang, Jingyuan Zhang
Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n. J. Parallel Distributed Comput. 26 (2) (1995)
Biing-Feng Wang, Gen-Huey Chen
Cost-Optimal Parallel Algorithms for Constructing B-Trees. Inf. Sci. 81 (1-2) (1994)
Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. ICPP (3) (1994)
Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
An Efficient Emulation for Tree-Connected Networks. ICPADS (1994)
Gen-Huey Chen, Biing-Feng Wang, Hungwen Li
Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. Theor. Comput. Sci. 120 (2) (1993)
Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park
On the Set LCS and Set-Set LCS Problems. J. Algorithms 14 (3) (1993)
Gen-Huey Chen, Biing-Feng Wang
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems. Inf. Sci. 72 (3) (1993)
Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu
On the Parallel Computation of the Algebraic Path Problem. IEEE Trans. Parallel Distributed Syst. 3 (2) (1992)
Biing-Feng Wang, Gen-Huey Chen, M. S. Yu
Cost-Optimal Parallel Algorithms for Constructing B-Trees. ICPP (3) (1991)
Biing-Feng Wang, Gen-Huey Chen, Hungwen Li
Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. ICPP (3) (1991)
Biing-Feng Wang, Gen-Huey Chen
Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. J. Parallel Distributed Comput. 11 (3) (1991)
Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu
Bitonic Sort with an Arbitrary Number of Keys. ICPP (3) (1991)
Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen
A Simple Approach to Implementing Multiplication with Small Tables. Inf. Process. Lett. 37 (6) (1991)
Biing-Feng Wang, Gen-Huey Chen
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems. IEEE Trans. Parallel Distributed Syst. 1 (4) (1990)
Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin
Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. Inf. Process. Lett. 34 (4) (1990)
Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen
Constant Time Algorithms for the Transitive Closure Problem and Its Applications. ICPP (3) (1990)
Biing-Feng Wang, Gen-Huey Chen
Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. Inf. Process. Lett. 36 (1) (1990)