| A.期刊論文 |
| 1. |
Lin, M. S. (2018). Counting Independent Sets and Maximal Independent Sets in Some Subclasses of Bipartite Graphs. Discrete Applied Mathematics, 251(12), 236-244. [Code on GitHub] |
| 2. |
Lin, M. S. (2018). Simple Linear-Time Algorithms for Counting Independent Sets in Distance-Hereditary Graphs. Discrete Applied Mathematics, 239(4), 144-153. [Code on GitHub] |
| 3. |
Chen, C. M., & Lin, M. S. (2018). Modeling and Simulating the Empathetic Decision-Making Behavior in Social Networks with Homophily. Journal of Internet Technology, 19(2), 403-413. |
| 4. |
Lin, M. S., & Chen, C. M. (2017). Linear-Time Algorithms for Counting Independent Sets in Bipartite Permutation Graphs. Information Processing Letters, 122(6), 1-7. [Code on GitHub] |
| 5. |
Lin, M. S., & Chen, C. M. (2017). Counting independent sets in tree convex bipartite graphs. Discrete Applied Mathematics, 218(2), 113-122. [Code on GitHub] |
| 6. |
Chen, C. M., & Lin, M. S. (2016). Computing K-Terminal Reliability of Circular-Arc Graphs. IEICE Transactions on Information and Systems 99(12), 3035-3046. [Code on GitHub] |
| 7. |
Chen, C. M., & Lin, M. S. (2016). Computing Terminal Reliability of Multi-tolerance Graphs. IEICE Transactions on Information and Systems 99(7), 1733-1741. [Code on GitHub] |
| 8. |
Lin, M. S., & Ting, C. C. (2015). Computing the K-terminal reliability of directed path graphs. Information Processing Letters, 115(10), 773-778. [Code on GitHub] |
| 9. |
Lin, M. S., & Ting, C. C. (2015). A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs. Information Processing Letters, 115(2), 371-376. [Code on GitHub] |
| 10. |
Lin, M. S., & Su, S. H. (2015). Counting independent sets in a tolerance graph. Discrete Applied Mathematics, 181(1), 174-184. [Code on GitHub] |
| 11. |
Lin, M. S., & Su, S. H. (2014). Counting maximal independent sets in directed path graphs. Information Processing Letters, 114(10), 568-572. [Code on GitHub] |
| 12. |
Lin, M. S., & Ting, C. C. (2013). Computing K-terminal reliability of d-trapezoid graphs. Information Processing Letters, 113(19), 734-738. [Code on GitHub] |
| 13. |
Tan, T. H., Lin, M. S., Chu, Y. L., & Liu, T. Y. (2012). Educational Affordances of a Ubiquitous Learning Environment in a Natural Science Course. Educational Technology & Society, 15(2), 206-219. |
| 14. |
Lin, M. S., & Chen, Y. J. (2009). Counting the number of vertex covers in a trapezoid graph. Information Processing Letters, 109(21), 1187-1192. [Code on GitHub] |
| 15. |
Lin, M. S., & Chen, Y. J. (2008). Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. Information Processing Letters, 107(6), 257-264. [Code on GitHub] |
| 16. |
Lin, M. S. (2007). Fast and simple algorithms to count the number of vertex covers in an interval graph. Information processing letters, 102(4), 143-146. [Code on GitHub] |
| 17. |
Lin, M. S. (2004). An O (k^2*log(n)) Algorithm for Computing the Reliability of Consecutive-k-out-of-n: F Systems. IEEE Transactions on Reliability, 53(1), 3-6. [Code on GitHub] |
| 18. |
Lin, M. S. (2004). An efficient algorithm for computing the reliability of stochastic binary systems. IEICE Transactions on Information and Systems, 87(3), 745-750. |
| 19. |
Yang, K. F., Yu, S., Lin, M. S., & Hsu, C. L. (2004). Study of basic computer competence among public health nurses in Taiwan. Journal of Nursing Research, 12(1), 1-5. |
| 20. |
Lin, M. S. (2003). Linear-time algorithms for computing the reliability of bipartite and (#<=2) star distributed computing systems. Computers & Operations Research, 30(11), 1697-1712. |
| 21. |
Lin, M. S. (2002). A linear-time algorithm for computing K-terminal reliability on proper interval graphs. IEEE Transactions on Reliability, 51(1), 58-62. |
| 22. |
Lin, M. S., Chang, M. S., & Chen, D. J. (2000). A Generalization of Consecutive k-out-of-n: G Systems. IEICE Transactions on Information and Systems, 83(6), 1309-1313. |
| B.研討會論文 |
| 1. |
M.S. Lin, (2019), "Counting Dominating Sets in Distance-Hereditary Graphs," The 36th Workshop on Combinatorial Mathematics and Computation Theory, Hsinchu, Taiwan. |
| 2. |
C.C. Ting, M.S. Lin, (2014), "An O(n^2)-time algorithm for computing the K-terminal reliability of rooted directed path graphs," the 31th Workshop on Combinatorial Mathematics, Taipei, Taiwan. |
| 3. |
C.C. Ting, M.S. Lin (2013),"Computing Residual Connectedness Reliability for d-Trapezoid Graphs," NCS2013, Taipei, Taichung |
| 4. |
C.C. Ting, M.S. Lin, (2013), "Polynomial-Time Algorithm for Computing K-Terminal Reliability of d-Trapezoid Graphs," the 30th Workshop on Combinatorial Mathematics, Hualien, Taiwan. |
| 5. |
S.H. Su, M.S. Lin, (2013), "Counting Independent Sets in a Co-comparability Graph," the 30th Workshop on Combinatorial Mathematics, Hualien, Taiwan. |
| 6. |
陳謙民,林敏勝,蔡雅雯,洪茂盛(2011),「社群網路中訊息影響之研究」, TANET2011, ILAN, Taiwan |
| 7. |
Y.J. Chen, M.S. Lin (2009),"Counting the Number of Minimum/Maximum Weighted Minimal Vertex Covers in a Weighted Trapezoid Graph," NCS2009, Taipei, Taiwan |
| 8. |
陳謙民,林敏勝,林弘基,吳幼貞(2009),「Wiki協同詮釋寫作於教學上之研究」, 第四屆數位教學暨資訊實務研討會，Tainan, Taiwan |
| 9. |
陳謙民,林敏勝,林信源, 吳幼貞(2007),「維基協同創作系統於教學上之研究」, 中華民國課程與教學學會第十七屆課程與教學論壇, Kaoshiung, Taiwan |
| 10. |
陳謙民,林敏勝,王邱凱(2007),「Wiki環境中編輯衝突之研究」, TANET2007, Taipei, Taiwan |
| 11. |
吳潮崇,王振興,林敏勝(2004),「線上新聞之自動摘要系統」,The 13th Automation Technology Conference, Taipei, Taiwan |
| 12. |
Y. J. Chen, M. S. Lin (2003),"The Study of Optimal File Allocation in Star Distributed Computing Systems based on Grouping Genetic Algorithm", NCS2003, Taichung, Taiwan |
| 13. |
邱關誼, 林敏勝(2003),「基於SCORM模型下適性測驗教材編輯系統之探討與實做」, ICCAI2003, Taipei, Taiwan |
| 14. |
M. S. Chang, M. S. Lin (2002), “Efficient Algorithms for Distributed Program Reliability Analysis,” ICS’2002 , Hualien, Taiwan. |
| 15. |
薛偉正,徐加玲,林敏勝(2001),「教師專業發展網路系統的建置與評估」, 2001年資訊素養與終身學習社會國際研討會,台中,台灣. |
| 16. |
C.L. Hsu, H.C. She, M. S. Lin (2000), “The web of the Teacher Professional Development,” ICCE/ICCAI’2000, Taipei, Taiwan. |
|
|
