Distributed Reliability Analysis. - Min-Sheng Lin; Deng-Jyi Chen (IFIP Congress (1), 1992)

New Reliability Evaluation Algorithms for Distributed Computing Systems. - Min-Sheng Lin; Deng-Jyi Chen (J. Inf. Sci. Eng., 1992)

General Reduction Methods for the Reliability Analysis of Distributed Computing Systems. - Min-Sheng Lin; Deng-Jyi Chen (Comput. J., 1993)

On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints. - Deng-Jyi Chen; Min-Sheng Lin (IEEE Trans. Computers, 1994)

Two Polynomial-Time Algorithms for Computing Reliability in a Linear and a Circular Distributed System. - Min-Sheng Lin; Deng-Jyi Chen (PDPTA, 1997)

The Computational Complexity of the Reliability Problem on Distributed Systems. - Min-Sheng Lin; Deng-Jyi Chen (Inf. Process. Lett., 1997)

The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes. - Min-Sheng Lin; Deng-Jyi Chen; Maw-Sheng Horng (Comput. J., 1999)

Efficient Algorthims for Reliblity Analysis of Distributed Computing Systems. - Min-Sheng Lin; Ming-Sang Chang; Deng-Jyi Chen (Inf. Sci., 1999)

Reliability analysis of distributed computing systems in ring networks. - Ming-Sang Chang; Deng-Jyi Chen; Min-Sheng Lin; Kuo-Lung Ku (J. Commun. Networks, 1999)

The distributed program reliability analysis on star topologies. - Ming-Sang Chang; Deng-Jyi Chen; Min-Sheng Lin; Kuo-Lung Ku (Comput. Oper. Res., 2000)

The distributed program reliability analysis on ring-type topologies. - Min-Sheng Lin; Ming-Sang Chang; Deng-Jyi Chen; Kuo-Lung Ku (Comput. Oper. Res., 2001)

A linear-time algorithm for computing K-terminal reliability on proper interval graphs. - Min-Sheng Lin (IEEE Trans. Reliab., 2002)

Linear-time algorithms for computing the reliability of bipartite and (#<=2) star distributed computing systems. - Min-Sheng Lin (Comput. Oper. Res., 2003)

An Efficient Algorithm for Computing the Reliability of Stochastic Binary Systems. - Min-Sheng Lin (IEICE Trans. Inf. Syst., 2004)

An O(k2·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems. - Min-Sheng Lin (IEEE Trans. Reliab., 2004)

Fast and simple algorithms to count the number of vertex covers in an interval graph. - Min-Sheng Lin (Inf. Process. Lett., 2007)

Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. - Min-Sheng Lin; Yung-Jui Chen (Inf. Process. Lett., 2008)

Counting the number of vertex covers in a trapezoid graph. - Min-Sheng Lin; Yung-Jui Chen (Inf. Process. Lett., 2009)

Educational Affordances of Ubiquitous Learning. - Tsung-Yu Liu; Tan-Hsu Tan; Min-Sheng Lin; Yu-Ling Chu (Edutainment, 2011)

Educational Affordances of a Ubiquitous Learning Environment in a Natural Science Course. - Tan-Hsu Tan; Min-Sheng Lin; Yu-Ling Chu; Tsung-Yu Liu (J. Educ. Technol. Soc., 2012)

Malicious URL filtering - A big data application. - Min-Sheng Lin; Chien-Yi Chiu; Yuh-Jye Lee; Hsing-Kuo Pao (IEEE BigData, 2013)

Computing K-terminal reliability of d-trapezoid graphs. - Min-Sheng Lin; Chao-Chun Ting (Inf. Process. Lett., 2013)

Counting maximal independent sets in directed path graphs. - Min-Sheng Lin; Sheng-Huang Su (Inf. Process. Lett., 2014)

Counting independent sets in a tolerance graph. - Min-Sheng Lin; Sheng-Huang Su (Discret. Appl. Math., 2015)

A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs. - Min-Sheng Lin; Chao-Chun Ting (Inf. Process. Lett., 2015)

Computing the K-terminal reliability of directed path graphs. - Min-Sheng Lin; Chao-Chun Ting (Inf. Process. Lett., 2015)

Computing the K-terminal Reliability of Circle Graphs. - Min-Sheng Lin; Chien-Min Chen (CoRR, 2016)

Computing Terminal Reliability of Multi-Tolerance Graphs. - Chien-Min Chen; Min-Sheng Lin (IEICE Trans. Inf. Syst., 2016)

Computing K-Terminal Reliability of Circular-Arc Graphs. - Chien-Min Chen; Min-Sheng Lin (IEICE Trans. Inf. Syst., 2016)

Counting independent sets in tree convex bipartite graphs. - Min-Sheng Lin; Chien-Min Chen (Discret. Appl. Math., 2017)

Linear-time algorithms for counting independent sets in bipartite permutation graphs. - Min-Sheng Lin; Chien-Min Chen (Inf. Process. Lett., 2017)

Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. - Min-Sheng Lin (Discret. Appl. Math., 2018)

Counting independent sets and maximal independent sets in some subclasses of bipartite graphs. - Min-Sheng Lin (Discret. Appl. Math., 2018)

Counting dominating sets in generalized series-parallel graphs. - Min-Sheng Lin (Discret. Math. Algorithms Appl., 2019)

Fast and simple algorithms for counting dominating sets in distance-hereditary graphs. - Min-Sheng Lin (Discret. Math. Algorithms Appl., 2021)

Counting Dominating Sets in Directed Path Graphs. - Min-Sheng Lin (CoRR, 2022)

Counting dominating sets in some subclasses of bipartite graphs. - Min-Sheng Lin (Theor. Comput. Sci., 2022)