Min-Sheng Lin

According to our database1, Min-Sheng Lin authored at least 37 papers between 1992 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Counting dominating sets in some subclasses of bipartite graphs.
Theor. Comput. Sci., 2022

Counting Dominating Sets in Directed Path Graphs.
CoRR, 2022

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

2019
Counting dominating sets in generalized series-parallel graphs.
Discret. Math. Algorithms Appl., 2019

2018
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs.
Discret. Appl. Math., 2018

Simple linear-time algorithms for counting independent sets in distance-hereditary graphs.
Discret. Appl. Math., 2018

2017
Linear-time algorithms for counting independent sets in bipartite permutation graphs.
Inf. Process. Lett., 2017

Counting independent sets in tree convex bipartite graphs.
Discret. Appl. Math., 2017

2016
Computing K-Terminal Reliability of Circular-Arc Graphs.
IEICE Trans. Inf. Syst., 2016

Computing Terminal Reliability of Multi-Tolerance Graphs.
IEICE Trans. Inf. Syst., 2016

Computing the K-terminal Reliability of Circle Graphs.
CoRR, 2016

2015
Computing the K-terminal reliability of directed path graphs.
Inf. Process. Lett., 2015

A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs.
Inf. Process. Lett., 2015

Counting independent sets in a tolerance graph.
Discret. Appl. Math., 2015

2014
Counting maximal independent sets in directed path graphs.
Inf. Process. Lett., 2014

2013
Computing K-terminal reliability of d-trapezoid graphs.
Inf. Process. Lett., 2013

Malicious URL filtering - A big data application.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012
Educational Affordances of a Ubiquitous Learning Environment in a Natural Science Course.
J. Educ. Technol. Soc., 2012

2011
Educational Affordances of Ubiquitous Learning.
Proceedings of the Edutainment Technologies. Educational Games and Virtual Reality/Augmented Reality Applications, 2011

2009
Counting the number of vertex covers in a trapezoid graph.
Inf. Process. Lett., 2009

2008
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph.
Inf. Process. Lett., 2008

2007
Fast and simple algorithms to count the number of vertex covers in an interval graph.
Inf. Process. Lett., 2007

2004
An O(k<sup>2</sup>·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems.
IEEE Trans. Reliab., 2004

An Efficient Algorithm for Computing the Reliability of Stochastic Binary Systems.
IEICE Trans. Inf. Syst., 2004

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

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

2001
The distributed program reliability analysis on ring-type topologies.
Comput. Oper. Res., 2001

2000
The distributed program reliability analysis on star topologies.
Comput. Oper. Res., 2000

1999
Reliability analysis of distributed computing systems in ring networks.
J. Commun. Networks, 1999

Efficient Algorthims for Reliblity Analysis of Distributed Computing Systems.
Inf. Sci., 1999

The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes.
Comput. J., 1999

1997
The Computational Complexity of the Reliability Problem on Distributed Systems.
Inf. Process. Lett., 1997

Two Polynomial-Time Algorithms for Computing Reliability in a Linear and a Circular Distributed System.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

1994
On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints.
IEEE Trans. Computers, 1994

1993
General Reduction Methods for the Reliability Analysis of Distributed Computing Systems.
Comput. J., 1993

1992
New Reliability Evaluation Algorithms for Distributed Computing Systems.
J. Inf. Sci. Eng., 1992

Distributed Reliability Analysis.
Proceedings of the Algorithms, Software, Architecture, 1992


  Loading...