- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c29 |      | 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: 268-279 |
| 2012 | ||
| j44 | | 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: 39-57 (2012) |
| j43 | | 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. Biology Bioinform. 9(2): 330-344 (2012) |
| j42 | | Biing-Feng Wang: Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences. IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 548-559 (2012) |
| c28 | | 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: 169-180 |
| c27 | | Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen: On the Round-Trip 1-Center and 1-Median Problems. WALCOM 2012: 100-111 |
| 2011 | ||
| j41 | | Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang: Improved data structures for the orthogonal range successor problem. Comput. Geom. 44(3): 148-159 (2011) |
| j40 | | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang: Faster query algorithms for the text fingerprinting problem. Inf. Comput. 209(7): 1057-1069 (2011) |
| j39 | | Biing-Feng Wang, Chien-Hsin Lin: Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1258-1272 (2011) |
| 2010 | ||
| j38 | | Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su: Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. Algorithmica 56(3): 297-312 (2010) |
| j37 | | 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. Discrete Applied Mathematics 158(8): 932-942 (2010) |
| j36 | | 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): 697-708 (2010) |
| c26 | | 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: 13-24 |
| 2009 | ||
| j35 | | Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsian Hsieh, Biing-Feng Wang: Efficient algorithms for the inverse sorting problem with bound constraints under the l INFINITY -norm and the Hamming distance. J. Comput. Syst. Sci. 75(8): 451-464 (2009) |
| j34 | | 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): 867-876 (2009) |
| c25 | | Biing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin: Improved Algorithms for the Gene Team Problem. COCOA 2009: 61-72 |
| c24 | | Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang: Efficient Data Structures for the Orthogonal Range Successor Problem. COCOON 2009: 96-105 |
| 2008 | ||
| j33 | | 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): 828-839 (2008) |
| j32 | | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang: Improved algorithms for the minmax-regret 1-center and 1-median problems. ACM Transactions on Algorithms 4(3) (2008) |
| j31 | | 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. Biology Bioinform. 5(2): 281-290 (2008) |
| c23 | | Li-Pu Yeh, Biing-Feng Wang: Efficient Algorithms for the kSmallest Cuts Enumeration. COCOON 2008: 434-443 |
| 2007 | ||
| j30 | | Hai-Lung Cheng, Biing-Feng Wang: On Chen and Chen's new tree inclusion algorithm. Inf. Process. Lett. 103(1): 14-18 (2007) |
| c22 | | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang: A Faster Query Algorithm for the Text Fingerprinting Problem. ESA 2007: 123-135 |
| c21 |  | 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: 61-67 |
| 2006 | ||
| j29 | | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku: Efficient algorithms for a constrained k-tree core problem in a tree network. J. Algorithms 59(2): 107-124 (2006) |
| c20 | | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang: Improved Algorithms for the Minmax Regret 1-Median Problem. COCOON 2006: 52-62 |
| c19 | | Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang: Improved Algorithms for the Minmax-Regret 1-Center Problem. ISAAC 2006: 537-546 |
| 2005 | ||
| j28 | | Biing-Feng Wang: Linear time algorithms for the ring loading problem with demand splitting. J. Algorithms 54(1): 45-57 (2005) |
| 2004 | ||
| j27 | | Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku: Efficient algorithms for the scaled indexing problem. J. Algorithms 52(1): 82-100 (2004) |
| j26 | | Biing-Feng Wang: Finding r-Dominating Sets and p-Centers of Trees in Parallel. IEEE Trans. Parallel Distrib. Syst. 15(8): 687-698 (2004) |
| 2003 | ||
| j25 | | Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung: Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Trans. Parallel Distrib. Syst. 14(3): 213-221 (2003) |
| c18 | | Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh: Efficient Algorithms for the Ring Loading Problem with Demand Splitting. ESA 2003: 517-526 |
| 2002 | ||
| j24 | | Shan-Chyun Ku, Biing-Feng Wang: An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. J. Parallel Distrib. Comput. 62(2): 221-227 (2002) |
| j23 | | Biing-Feng Wang: Finding a 2-Core of a Tree in Linear Time. SIAM J. Discrete Math. 15(2): 193-210 (2002) |
| c17 | | Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh: The Conditional Location of a Median Path. COCOON 2002: 494-503 |
| c16 | | Tzu-Chin Lin, Biing-Feng Wang: Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. ICPADS 2002: 117-122 |
| c15 | | Hong-Yi Yu, Biing-Feng Wang: An Improved Algorithm for Finding k-centrums on Weighted Trees. ICPADS 2002: 222-225 |
| 2001 | ||
| j22 | | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi: Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. IEEE Trans. Parallel Distrib. Syst. 12(9): 888-898 (2001) |
| c14 | | Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin: Efficient Algorithms for Two Generalized 2-Median Problems on Trees. ISAAC 2001: 768-778 |
| 2000 | ||
| j21 | | 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): 90-108 (2000) |
| j20 | | Biing-Feng Wang: Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. Theor. Comput. Sci. 242(1-2): 377-401 (2000) |
| j19 | | Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang: Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. IEEE Trans. Parallel Distrib. Syst. 11(6): 559-570 (2000) |
| c13 | | |
| 1999 | ||
| j18 | | 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): 125-130 (1999) |
| j17 | | 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 Distrib. Syst. 10(3): 266-280 (1999) |
| c12 | | 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: 192-199 |
| 1998 | ||
| j16 | | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang: Efficient Emulations for X-trees and /w-ary Trees. Parallel Algorithms Appl. 13(2): 95-116 (1998) |
| j15 | | Biing-Feng Wang: Simulating the CRCW PRAM on Reconfigurable Networks. Theor. Comput. Sci. 205(1-2): 231-242 (1998) |
| j14 | | Biing-Feng Wang: Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. IEEE Trans. Parallel Distrib. Syst. 9(2): 186-191 (1998) |
| c11 | | Shan-Chyun Ku, Biing-Feng Wang: Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. IPPS/SPDP 1998: 370-374 |
| 1997 | ||
| j13 | | Biing-Feng Wang: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. J. Algorithms 23(2): 345-358 (1997) |
| c10 | | 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: 16-19 |
| c9 | | |
| 1996 | ||
| j12 | | Biing-Feng Wang: A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem. Parallel Processing Letters 6(3): 331-344 (1996) |
| 1995 | ||
| j11 | | 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 Distrib. Comput. 26(2): 137-150 (1995) |
| c8 | | Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng: Recognizing depth-first-search trees in parallel. IPPS 1995: 101-105 |
| c7 | | |
| 1994 | ||
| j10 | | Biing-Feng Wang, Gen-Huey Chen: Cost-Optimal Parallel Algorithms for Constructing B-Trees. Inf. Sci. 81(1-2): 55-72 (1994) |
| c6 | | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang: An Efficient Emulation for Tree-Connected Networks. ICPADS 1994: 502-507 |
| c5 | | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang: Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. ICPP (3) 1994: 143-146 |
| 1993 | ||
| j9 | | Gen-Huey Chen, Biing-Feng Wang: Sorting and computing convex hulls on processor arrays with reconfigurable bus systems. Inf. Sci. 72(3): 191-206 (1993) |
| j8 | | Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park: On the Set LCS and Set-Set LCS Problems. J. Algorithms 14(3): 466-477 (1993) |
| j7 | | Gen-Huey Chen, Biing-Feng Wang, Hungwen Li: Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. Theor. Comput. Sci. 120(2): 215-227 (1993) |
| 1992 | ||
| j6 | | Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu: On the Parallel Computation of the Algebraic Path Problem. IEEE Trans. Parallel Distrib. Syst. 3(2): 251-256 (1992) |
| 1991 | ||
| j5 | | Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen: A Simple Approach to Implementing Multiplication with Small Tables. Inf. Process. Lett. 37(6): 327-329 (1991) |
| j4 | | Biing-Feng Wang, Gen-Huey Chen: Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. J. Parallel Distrib. Comput. 11(3): 257-262 (1991) |
| c4 | | Biing-Feng Wang, Gen-Huey Chen, Hungwen Li: Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. ICPP (3) 1991: 42-49 |
| c3 | | Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu: Bitonic Sort with an Arbitrary Number of Keys. ICPP (3) 1991: 58-61 |
| c2 | | Biing-Feng Wang, Gen-Huey Chen, M. S. Yu: Cost-Optimal Parallel Algorithms for Constructing B-Trees. ICPP (3) 1991: 294-295 |
| 1990 | ||
| j3 | | 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): 187-192 (1990) |
| j2 | | 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): 31-36 (1990) |
| j1 | | 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 Distrib. Syst. 1(4): 500-507 (1990) |
| c1 | | Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen: Constant Time Algorithms for the Transitive Closure Problem and Its Applications. ICPP (3) 1990: 52-59 |
Colors in the list of coauthors
Last update Fri May 24 07:43:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page