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 Gene Team Problem. - Biing-Feng Wang; Shang-Ju Liu; Chien-Hsin Lin (COCOA, 2009)

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)

A Study of a Heuristic Capacity Planning Algorithm for Weapon Production System. - James C. Chen; Kou-Huang Chen; Chien-Hsin Lin; Chia-Wen Chen; Chia-Lin Yang (Int. J. Electron. Bus. Manag., 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)

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)

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)

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)