Biing-Feng Wang

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