Constant Time Algorithms for the Transitive Closure Problem and Its Applications. - Biing-Feng Wang; Chi-Jen Lu; Gen-Huey Chen (ICPP (3), 1990)

Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. - Biing-Feng Wang; Gen-Huey Chen (Inf. Process. Lett., 1990)

Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. - Biing-Feng Wang; Gen-Huey Chen; Ferng-Chiang Lin (Inf. Process. Lett., 1990)

Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems. - Biing-Feng Wang; Gen-Huey Chen (IEEE Trans. Parallel Distributed Syst., 1990)

Bitonic Sort with an Arbitrary Number of Keys. - Biing-Feng Wang; Gen-Huey Chen; Cheng-Chung Hsu (ICPP (3), 1991)

Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. - Biing-Feng Wang; Gen-Huey Chen; Hungwen Li (ICPP (3), 1991)

Cost-Optimal Parallel Algorithms for Constructing B-Trees. - Biing-Feng Wang; Gen-Huey Chen; M. S. Yu (ICPP (3), 1991)

A Simple Approach to Implementing Multiplication with Small Tables. - Biing-Feng Wang; Chuen-Liang Chen; Gen-Huey Chen (Inf. Process. Lett., 1991)

Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. - Biing-Feng Wang; Gen-Huey Chen (J. Parallel Distributed Comput., 1991)

On the Parallel Computation of the Algebraic Path Problem. - Gen-Huey Chen; Biing-Feng Wang; Chi-Jen Lu (IEEE Trans. Parallel Distributed Syst., 1992)

Sorting and computing convex hulls on processor arrays with reconfigurable bus systems. - Gen-Huey Chen; Biing-Feng Wang (Inf. Sci., 1993)

On the Set LCS and Set-Set LCS Problems. - Biing-Feng Wang; Gen-Huey Chen; Kunsoo Park (J. Algorithms, 1993)

Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. - Gen-Huey Chen; Biing-Feng Wang; Hungwen Li (Theor. Comput. Sci., 1993)

An Efficient Emulation for Tree-Connected Networks. - Daw-Jong Shyu; Biing-Feng Wang; Chuan Yi Tang (ICPADS, 1994)

Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. - Daw-Jong Shyu; Biing-Feng Wang; Chuan Yi Tang (ICPP (3), 1994)

Cost-Optimal Parallel Algorithms for Constructing B-Trees. - Biing-Feng Wang; Gen-Huey Chen (Inf. Sci., 1994)

The emulation problem on trees. - Daw-Jong Shyu; Biing-Feng Wang; Chuan Yi Tang (IPPS, 1995)

Recognizing depth-first-search trees in parallel. - Jia-Shung Wang; Biing-Feng Wang; Chen-Hsing Peng (IPPS, 1995)

Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n. - Gen-Huey Chen; Stephan Olariu; James L. Schwing; Biing-Feng Wang; Jingyuan Zhang (J. Parallel Distributed Comput., 1995)

A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem. - Biing-Feng Wang (Parallel Process. Lett., 1996)

Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. - Shan-Chyun Ku; Wei-Kuan Shih; Biing-Feng Wang (ICPP, 1997)

On the Power of the Mesh with Hybrid Buses. - Biing-Feng Wang; Stephan Olariu (ISPAN, 1997)

Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. - Biing-Feng Wang (J. Algorithms, 1997)

Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. - Shan-Chyun Ku; Biing-Feng Wang (IPPS/SPDP, 1998)

Efficient Emulations for X-trees and /w-ary Trees. - Daw-Jong Shyu; Biing-Feng Wang; Chuan Yi Tang (Parallel Algorithms Appl., 1998)

Simulating the CRCW PRAM on Reconfigurable Networks. - Biing-Feng Wang (Theor. Comput. Sci., 1998)

Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. - Biing-Feng Wang (IEEE Trans. Parallel Distributed Syst., 1998)

Parallel Algorithms for the Tree Bisector Problem and Applications. - Biing-Feng Wang; Shan-Chyun Ku; Keng-Hua Shi; Ting-Kai Hung; Pei-Sen Liu (ICPP, 1999)

The Lowest Common Ancestor Problem on a Tree with an Unfixed Root. - Biing-Feng Wang; Jiunn-Nan Tsai; Yuan-Cheng Chuang (Inf. Sci., 1999)

The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. - Rong Lin; Stephan Olariu; James L. Schwing; Biing-Feng Wang (IEEE Trans. Parallel Distributed Syst., 1999)

Finding a Two-Core of a Tree in Linear Time. - Biing-Feng Wang; Jyh-Jye Lin (ISAAC, 2000)

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. - Biing-Feng Wang (J. Algorithms, 2000)

Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. - Biing-Feng Wang (Theor. Comput. Sci., 2000)

Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. - Chen-Hsing Peng; Biing-Feng Wang; Jia-Shung Wang (IEEE Trans. Parallel Distributed Syst., 2000)

Efficient Algorithms for Two Generalized 2-Median Problems on Trees. - Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang; Tzu-Chin Lin (ISAAC, 2001)

Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. - Biing-Feng Wang; Shan-Chyun Ku; Keng-Hua Shi (IEEE Trans. Parallel Distributed Syst., 2001)

The Conditional Location of a Median Path. - Biing-Feng Wang; Shan-Chyun Ku; Yong-Hsian Hsieh (COCOON, 2002)

Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. - Tzu-Chin Lin; Biing-Feng Wang (ICPADS, 2002)

An Improved Algorithm for Finding k-centrums on Weighted Trees. - Hong-Yi Yu; Biing-Feng Wang (ICPADS, 2002)

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. - Shan-Chyun Ku; Biing-Feng Wang (J. Parallel Distributed Comput., 2002)

Finding a 2-Core of a Tree in Linear Time. - Biing-Feng Wang (SIAM J. Discret. Math., 2002)

Efficient Algorithms for the Ring Loading Problem with Demand Splitting. - Biing-Feng Wang; Yong-Hsian Hsieh; Li-Pu Yeh (ESA, 2003)

Constructing Edge-Disjoint Spanning Trees in Product Networks. - Shan-Chyun Ku; Biing-Feng Wang; Ting-Kai Hung (IEEE Trans. Parallel Distributed Syst., 2003)

Efficient algorithms for the scaled indexing problem. - Biing-Feng Wang; Jyh-Jye Lin; Shan-Chyun Ku (J. Algorithms, 2004)

Finding r-Dominating Sets and p-Centers of Trees in Parallel. - Biing-Feng Wang (IEEE Trans. Parallel Distributed Syst., 2004)

Linear time algorithms for the ring loading problem with demand splitting. - Biing-Feng Wang (J. Algorithms, 2005)

Improved Algorithms for the Minmax Regret 1-Median Problem. - Hung-I Yu; Tzu-Chin Lin; Biing-Feng Wang (COCOON, 2006)

Improved Algorithms for the Minmax-Regret 1-Center Problem. - Tzu-Chin Lin; Hung-I Yu; Biing-Feng Wang (ISAAC, 2006)

Efficient algorithms for a constrained k-tree core problem in a tree network. - Biing-Feng Wang; Shietung Peng; Hong-Yi Yu; Shan-Chyun Ku (J. Algorithms, 2006)

A Faster Query Algorithm for the Text Fingerprinting Problem. - Chi-Yuan Chan; Hung-I Yu; Wing-Kai Hon; Biing-Feng Wang (ESA, 2007)

Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. - Chih-Chiang Yu; Yong-Hsian Hsieh; Biing-Feng Wang (FCS, 2007)

On Chen and Chen's new tree inclusion algorithm. - Hai-Lung Cheng; Biing-Feng Wang (Inf. Process. Lett., 2007)

Efficient Algorithms for the kSmallest Cuts Enumeration. - Li-Pu Yeh; Biing-Feng Wang (COCOON, 2008)

Finding the conditional location of a median path on a tree. - Biing-Feng Wang; Tzu-Chin Lin; Chien-Hsin Lin; Shan-Chyun Ku (Inf. Comput., 2008)

Improved algorithms for the minmax-regret 1-center and 1-median problems. - Hung-I Yu; Tzu-Chin Lin; Biing-Feng Wang (ACM Trans. Algorithms, 2008)

Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average. - Yong-Hsian Hsieh; Chih-Chiang Yu; Biing-Feng Wang (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Improved Algorithms for the Gene Team Problem. - Biing-Feng Wang; Shang-Ju Liu; Chien-Hsin Lin (COCOA, 2009)

Efficient Data Structures for the Orthogonal Range Successor Problem. - Chih-Chiang Yu; Wing-Kai Hon; Biing-Feng Wang (COCOON, 2009)

Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance. - Tzu-Chin Lin; Chung-Chin Kuo; Yong-Hsian Hsieh; Biing-Feng Wang (J. Comput. Syst. Sci., 2009)

Efficient algorithms for two generalized 2-median problems and the group median problem on trees. - Chi-Yuan Chan; Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang (Theor. Comput. Sci., 2009)

Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. - Chih-Chiang Yu; Biing-Feng Wang; Chung-Chin Kuo (ISAAC (2), 2010)

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. - Li-Pu Yeh; Biing-Feng Wang; Hsin-Hao Su (Algorithmica, 2010)

Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. - Jyh-Jye Lin; Chi-Yuan Chan; Biing-Feng Wang (Discret. Appl. Math., 2010)

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. - Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang (J. Comput. Syst. Sci., 2010)

Improved data structures for the orthogonal range successor problem. - Chih-Chiang Yu; Wing-Kai Hon; Biing-Feng Wang (Comput. Geom., 2011)

Faster query algorithms for the text fingerprinting problem. - Chi-Yuan Chan; Hung-I Yu; Wing-Kai Hon; Biing-Feng Wang (Inf. Comput., 2011)

Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees. - Biing-Feng Wang; Chien-Hsin Lin (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property. - Biing-Feng Wang; Chih-Hsuan Li (COCOON, 2012)

On the Round-Trip 1-Center and 1-Median Problems. - Biing-Feng Wang; Jhih-Hong Ye; Pei-Jung Chen (WALCOM, 2012)

Efficient algorithms for the conditional covering problem. - Robert Benkoczi; Binay K. Bhattacharya; Yuzhuang Hu; Chien-Hsin Lin; Qiaosheng Shi; Biing-Feng Wang (Inf. Comput., 2012)

Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences. - Biing-Feng Wang (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

A New Efficient Algorithm for the Gene-Team Problem on General Sequences. - Biing-Feng Wang; Chung-Chin Kuo; Shang-Ju Liu; Chien-Hsin Lin (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property. - Chih-Hsuan Li; Jhih-Hong Ye; Biing-Feng Wang (COCOON, 2013)

Constructing a Gene Team Treein Almost $O$$(n ; { rm lg} ; n)$ Time. - Biing-Feng Wang; Chien-Hsin Lin; I-Tse Yang (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

On the minmax regret path median problem on trees. - Jhih-Hong Ye; Biing-Feng Wang (J. Comput. Syst. Sci., 2015)

Efficient algorithms for the round-trip 1-center and 1-median problems. - Biing-Feng Wang; Jhih-Hong Ye; Pei-Jung Chen (J. Comput. Syst. Sci., 2016)

A New Efficient Algorithm for the All Sorting Reversals Problem with No Bad Components. - Biing-Feng Wang (IEEE ACM Trans. Comput. Biol. Bioinform., 2016)

On the Minmax Regret Path Center Problem on Trees. - Biing-Feng Wang; Jhih-Hong Ye; Chih-Yu Li (FAW, 2018)

An improved algorithm for the minmax regret path centdian problem on trees. - Jhih-Hong Ye; Chih-Yu Li; Biing-Feng Wang (J. Comput. Syst. Sci., 2018)

A New Efficient Algorithm for the Frequent Gene Team Problem. - Biing-Feng Wang (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Fast Algorithms for Computing Path-Difference Distances. - Biing-Feng Wang; Chih-Yu Li (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

An improved algorithm for the minmax regret path center problem on trees. - Biing-Feng Wang; Jhih-Hong Ye; Chih-Yu Li (J. Comput. Syst. Sci., 2020)

A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees. - Biing-Feng Wang; Krister M. Swenson (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Efficient algorithms for the minmax regret path center problem with length constraint on trees. - Biing-Feng Wang (Theor. Comput. Sci., 2022)

Fast Algorithms for the Simplified Partial Digest Problem. - Biing-Feng Wang (J. Comput. Biol., 2023)

A new dynamic programming algorithm for the simplified partial digest problem. - Biing-Feng Wang (Theor. Comput. Sci., 2023)

Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples. - Wen-Horng Sheu; Biing-Feng Wang (SIAM J. Discret. Math., 2023)