default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMin-Sheng Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j31]Min-Sheng Lin:
Counting dominating sets in some subclasses of bipartite graphs. Theor. Comput. Sci. 923: 337-347 (2022)- [i2]Min-Sheng Lin:
Counting Dominating Sets in Directed Path Graphs. CoRR abs/2207.00463 (2022) - 2021
- [j30]Min-Sheng Lin:
Fast and simple algorithms for counting dominating sets in distance-hereditary graphs. Discret. Math. Algorithms Appl. 13(2): 2150012:1-2150012:12 (2021)
2010 – 2019
- 2019
- [j29]Min-Sheng Lin:
Counting dominating sets in generalized series-parallel graphs. Discret. Math. Algorithms Appl. 11(6): 1950074:1-1950074:11 (2019) - 2018
- [j28]Min-Sheng Lin:
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. Discret. Appl. Math. 239: 144-153 (2018) - [j27]Min-Sheng Lin:
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs. Discret. Appl. Math. 251: 236-244 (2018) - 2017
- [j26]Min-Sheng Lin, Chien-Min Chen:
Counting independent sets in tree convex bipartite graphs. Discret. Appl. Math. 218: 113-122 (2017) - [j25]Min-Sheng Lin, Chien-Min Chen:
Linear-time algorithms for counting independent sets in bipartite permutation graphs. Inf. Process. Lett. 122: 1-7 (2017) - 2016
- [j24]Chien-Min Chen, Min-Sheng Lin:
Computing Terminal Reliability of Multi-Tolerance Graphs. IEICE Trans. Inf. Syst. 99-D(7): 1733-1741 (2016) - [j23]Chien-Min Chen, Min-Sheng Lin:
Computing K-Terminal Reliability of Circular-Arc Graphs. IEICE Trans. Inf. Syst. 99-D(12): 3047-3052 (2016) - [i1]Min-Sheng Lin, Chien-Min Chen:
Computing the K-terminal Reliability of Circle Graphs. CoRR abs/1610.04544 (2016) - 2015
- [j22]Min-Sheng Lin, Sheng-Huang Su:
Counting independent sets in a tolerance graph. Discret. Appl. Math. 181: 174-184 (2015) - [j21]Min-Sheng Lin, Chao-Chun Ting:
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs. Inf. Process. Lett. 115(2): 371-376 (2015) - [j20]Min-Sheng Lin, Chao-Chun Ting:
Computing the K-terminal reliability of directed path graphs. Inf. Process. Lett. 115(10): 773-778 (2015) - 2014
- [j19]Min-Sheng Lin, Sheng-Huang Su:
Counting maximal independent sets in directed path graphs. Inf. Process. Lett. 114(10): 568-572 (2014) - 2013
- [j18]Min-Sheng Lin, Chao-Chun Ting:
Computing K-terminal reliability of d-trapezoid graphs. Inf. Process. Lett. 113(19-21): 734-738 (2013) - [c5]Min-Sheng Lin, Chien-Yi Chiu, Yuh-Jye Lee
, Hsing-Kuo Pao:
Malicious URL filtering - A big data application. IEEE BigData 2013: 589-596 - 2012
- [j17]Tan-Hsu Tan, Min-Sheng Lin, Yu-Ling Chu, Tsung-Yu Liu:
Educational Affordances of a Ubiquitous Learning Environment in a Natural Science Course. J. Educ. Technol. Soc. 15(2): 206-219 (2012) - 2011
- [c4]Tsung-Yu Liu, Tan-Hsu Tan, Min-Sheng Lin, Yu-Ling Chu:
Educational Affordances of Ubiquitous Learning. Edutainment 2011: 86-91
2000 – 2009
- 2009
- [j16]Min-Sheng Lin, Yung-Jui Chen:
Counting the number of vertex covers in a trapezoid graph. Inf. Process. Lett. 109(21-22): 1187-1192 (2009) - 2008
- [j15]Min-Sheng Lin, Yung-Jui Chen:
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. Inf. Process. Lett. 107(6): 257-264 (2008) - 2007
- [j14]Min-Sheng Lin:
Fast and simple algorithms to count the number of vertex covers in an interval graph. Inf. Process. Lett. 102(4): 143-146 (2007) - 2004
- [j13]Min-Sheng Lin:
An Efficient Algorithm for Computing the Reliability of Stochastic Binary Systems. IEICE Trans. Inf. Syst. 87-D(3): 745-750 (2004) - [j12]Min-Sheng Lin:
An O(k2·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems. IEEE Trans. Reliab. 53(1): 3-6 (2004) - 2003
- [j11]Min-Sheng Lin:
Linear-time algorithms for computing the reliability of bipartite and (#<=2) star distributed computing systems. Comput. Oper. Res. 30(11): 1697-1712 (2003) - 2002
- [j10]Min-Sheng Lin:
A linear-time algorithm for computing K-terminal reliability on proper interval graphs. IEEE Trans. Reliab. 51(1): 58-62 (2002) - 2001
- [j9]Min-Sheng Lin, Ming-Sang Chang, Deng-Jyi Chen, Kuo-Lung Ku:
The distributed program reliability analysis on ring-type topologies. Comput. Oper. Res. 28(7): 625-635 (2001) - 2000
- [j8]Ming-Sang Chang, Deng-Jyi Chen, Min-Sheng Lin, Kuo-Lung Ku:
The distributed program reliability analysis on star topologies. Comput. Oper. Res. 27(2): 129-142 (2000)
1990 – 1999
- 1999
- [j7]Min-Sheng Lin, Deng-Jyi Chen, Maw-Sheng Horng:
The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes. Comput. J. 42(2): 129-141 (1999) - [j6]Min-Sheng Lin, Ming-Sang Chang, Deng-Jyi Chen:
Efficient Algorthims for Reliblity Analysis of Distributed Computing Systems. Inf. Sci. 117(1-2): 89-106 (1999) - [j5]Ming-Sang Chang, Deng-Jyi Chen, Min-Sheng Lin, Kuo-Lung Ku:
Reliability analysis of distributed computing systems in ring networks. J. Commun. Networks 1(1): 68-77 (1999) - 1998
- [c3]Ming-Sang Chang, Deng-Jyi Chen, Min-Sheng Lin, Kuo-Lung Ku:
The Distributed Program Reliability Analysis on Star Topologies. ICPADS 1998: 100-106 - 1997
- [j4]Min-Sheng Lin, Deng-Jyi Chen:
The Computational Complexity of the Reliability Problem on Distributed Systems. Inf. Process. Lett. 64(3): 143-147 (1997) - [c2]Min-Sheng Lin, Deng-Jyi Chen:
Two Polynomial-Time Algorithms for Computing Reliability in a Linear and a Circular Distributed System. PDPTA 1997: 748-752 - 1994
- [j3]Deng-Jyi Chen, Min-Sheng Lin:
On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints. IEEE Trans. Computers 43(1): 87-97 (1994) - 1993
- [j2]Min-Sheng Lin, Deng-Jyi Chen:
General Reduction Methods for the Reliability Analysis of Distributed Computing Systems. Comput. J. 36(7): 631-644 (1993) - 1992
- [j1]Min-Sheng Lin, Deng-Jyi Chen:
New Reliability Evaluation Algorithms for Distributed Computing Systems. J. Inf. Sci. Eng. 8(3): 353-391 (1992) - [c1]Min-Sheng Lin, Deng-Jyi Chen:
Distributed Reliability Analysis. IFIP Congress (1) 1992: 608-614
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
