| 2018 | FAW | On the Minmax Regret Path Center Problem on Trees. | Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li |
| 2013 | COCOON | A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property. | Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang |
| 2012 | COCOON | 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 |
| 2012 | WALCOM | On the Round-Trip 1-Center and 1-Median Problems. | Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen |
| 2010 | ISAAC | Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. | Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo |
| 2009 | COCOA | Improved Algorithms for the Gene Team Problem. | Biing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin |
| 2009 | COCOON | Efficient Data Structures for the Orthogonal Range Successor Problem. | Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang |
| 2008 | COCOON | Efficient Algorithms for the kSmallest Cuts Enumeration. | Li-Pu Yeh, Biing-Feng Wang |
| 2007 | ESA | A Faster Query Algorithm for the Text Fingerprinting Problem. | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang |
| 2006 | COCOON | Improved Algorithms for the Minmax Regret 1-Median Problem. | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang |
| 2006 | ISAAC | Improved Algorithms for the Minmax-Regret 1-Center Problem. | Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang |
| 2003 | ESA | Efficient Algorithms for the Ring Loading Problem with Demand Splitting. | Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh |
| 2002 | COCOON | The Conditional Location of a Median Path. | Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh |
| 2002 | ICPADS | Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. | Tzu-Chin Lin, Biing-Feng Wang |
| 2002 | ICPADS | An Improved Algorithm for Finding k-centrums on Weighted Trees. | Hong-Yi Yu, Biing-Feng Wang |
| 2001 | ISAAC | Efficient Algorithms for Two Generalized 2-Median Problems on Trees. | Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin |
| 2000 | ISAAC | Finding a Two-Core of a Tree in Linear Time. | Biing-Feng Wang, Jyh-Jye Lin |
| 1999 | ICPP | Parallel Algorithms for the Tree Bisector Problem and Applications. | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu |
| 1997 | ICPP | Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. | Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang |
| 1994 | ICPADS | An Efficient Emulation for Tree-Connected Networks. | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
| 1994 | ICPP | Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
| 1991 | ICPP | Bitonic Sort with an Arbitrary Number of Keys. | Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu |
| 1991 | ICPP | Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. | Biing-Feng Wang, Gen-Huey Chen, Hungwen Li |
| 1991 | ICPP | Cost-Optimal Parallel Algorithms for Constructing B-Trees. | Biing-Feng Wang, Gen-Huey Chen, M. S. Yu |
| 1990 | ICPP | Constant Time Algorithms for the Transitive Closure Problem and Its Applications. | Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen |