Ruo-Wei Hung Publications


I】 國際期刊論文 (International Journal papers) [*] Corresponding author.

  1. Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung*, The Hamiltonicity, Hamiltonian connectivity, and longest (s, t)-path of L-shaped supergrid graphs, IAENG International Journal of Computer Science 47/3 (September, 2020) pp. 378-391.  (EI/Scopus: 2019 SJR= 0.323)
  2. Chuan-Bi Lin, Ruo-Wei Hung, Chi-Yueh Hsu, and Jong-Shin Chen*, A GNSS-based crowd-sensing strategy for areas, Sensors 20/15 (2020) #4171. (SCIE/EI/Scopus: JCR 2019 Journal Impact Factor: 3.275; 2019 SJR= 0.653)
  3. Hung-Yu Chien*, Yi-Jui Chen, Guo-Hao Qiu, Jian-Fu Liao, Ruo-Wei Hung, Pei-Chih Lin, Xi-An Kou, Mao-Lun Chiang, and Chunhua Su, A MQTT-API-compatible IoT security-enhanced platform, International Journal of Sensor Networks 32/1 (2020) pp. 54-68. (SCIE/EI/Scopus: JCR 2019 Journal Impact Factor: 1.428; 2019 SJR= 0.326)
  4. Ruo-Wei Hung*, Fatemeh Keshavarz-Kohjerdi, Chuan-Bi Lin, and Jong-Shin Chen, The Hamiltonian connectivity of alphabet supergrid graphs, IAENG International Journal of Applied Mathematics 49/1 (February, 2019) pp. 69-85. (EI/Scopus: 2018 SJR= 0.318)
  5. Ruo-Wei Hung*, Horng-Dar Chen, and Sian-Cing Zeng, The Hamiltonicity and Hamiltonian connectivity of some shaped supergrid graphs, IAENG International Journal of Computer Science 44/4 (November, 2017) pp. 432-444. (EI/Scopus: 2018 SJR= 0.329)
  6. Ruo-Wei Hung*, Chin-Feng Li, Jong-Shin Chen, and Qing-Song Su, The Hamiltonian connectivity of rectangular supergrid graphsDiscrete Optimization 26 (November, 2017) pp. 41-65. (SCI/EI/Scopus) [JCR 2018 Journal Impact Factor: 0.815]
  7. Ruo-Wei Hung*, Hamiltonian cycles in linear-convex supergrid graphs, Discrete Applied Mathematics 211 (October, 2016) pp. 99-112. (SCI/EI) [JCR 2018 Journal Impact Factor: 0.983]
  8. Ruo-Wei Hung*, Chih-Chia Yao, and Shang-Ju Chan, The Hamiltonian properties of supergrid graphs, Theoretical Computer Science 602 (October, 2015) pp. 132-148. (SCI/EI) [JCR 2018 Journal Impact Factor: 0.718]
  9. Ruo-Wei Hung*, The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks, Discrete Applied Mathematics 181 (January, 2015) pp. 109-122. (SCI/EI) [JCR 2017 Journal Impact Factor: 0.932]
  10. Ruo-Wei Hung*, DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph, Theoretical Computer Science 498 (2013) pp. 28-45. (SCI/EI) [JCR 2017 Journal Impact Factor: 0.772]
  11. Ruo-Wei Hung*, Linear-time algorithm for the paired-domination problem in convex bipartite graphs, Theory of Computing Systems 50/4 (2012) pp. 721-738. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.533]
  12. Ruo-Wei Hung*, Constructing two edge-disjoint Hamiltonian cycles and two-equal path cover in augmented cubes, IAENG International Journal of Computer Science 39/1 (2012) pp. 42-49. (EI/Scopus)
  13. Chih-Chia Yao* and Ruo-Wei Hung, A hybrid microphone array filter for speech enhancement, International Review on Computers and Software 6/5 (September, 2011)  pp. 640-651. (EI/Scopus)
  14. Ruo-Wei Hung* and Maw-Shang Chang, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, Theoretical Computer Science 412/39 (September, 2011) pp. 5351-5373. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.657]
  15. Ruo-Wei Hung*, Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes, Theoretical Computer Science 412/35 (August, 2011) pp. 4747-4753. (SCI/EI) [JCR 2011 Impact Factor: 0.665]
  16. Ruo-Wei Hung* and Chih-Chia Yao, Linear-time algorithm for the matched-domination problem in cographs, International Journal of Computer Mathematics 88/10 (July, 2011) pp. 2042-2056. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.824]
  17. Ruo-Wei Hung*, Chun-Kai Wang, and Chih-Chia Yao, The neighbor-scattering number of proper interval graphs, ICIC Express Letters 5/6 (June, 2011) pp. 2059-2064. (EI/Scopus)
  18. Ruo-Wei Hung* and Maw-Shang Chang, Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs, Applied Mathematics Letters 24/5 (May, 2011) pp. 648-652. (SCI/EI)  [JCR 2015 Journal Impact Factor: 1.659]
  19. Ruo-Wei Hung*, A linear-time algorithm for the restricted paired-domination problem in cographs, International Journal of Innovative Computing Information and Control 6/11 (2010) pp. 4957-4978. (SCI/EI) [JCR 2010 Journal Impact Factor: 1.667]
  20. Chih-Chia Yao*, Pao-Ta Yu, and Ruo-Wei Hung, Extractive support vector algorithm on support vector machines for image restoration, Fundamenta Informaticae 90 (2009) pp. 171-190. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.717]
  21. Ruo-Wei Hung* and Maw-Shang Chang, Finding a minimum path cover of a distance-hereditary graph in polynomial time, Discrete Applied Mathematics 155/17 (2007) pp. 2242-2256. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.802]
  22. Ruo-Wei Hung* and Maw-Shang Chang, Solving the path cover problem on circular-arc graphs by using an approximation algorithm, Discrete Applied Mathematics 154/1 (2006) pp. 76-105. (SCI/EI) [JCR 2014 Journal Impact Factor: 0.802]
  23. Ruo-Wei Hung*, Optimal edge ranking of complete bipartite graphs in polynomial time, Discuss. Math. Graph Theory 26/1 (2006) pp. 149-159. (SCI/Scopus) [JCR 2017 Journal Impact Factor: 0.601]
  24. Ruo-Wei Hung* and Maw-Shang Chang, Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, Theoretical Computer Science 341 (2005) pp. 411-440. (SCI/ EI) [JCR 2014 Journal Impact Factor: 0.657]
  25. Ruo-Wei Hung* and Maw-Shang Chang, A simple linear algorithm for the connected domination problem in circular-arc graphs, Discuss. Math. Graph Theory 24/1 (2004) pp. 137-145.  (SCI/Scopus) [JCR 2017 Journal Impact Factor: 0.601]
  26. Ruo-Wei Hung*, Shaur-Ching Wu, and Maw-Shang Chang, Hamiltonian cycle problem on distance-hereditary graphs, Journal of Information Science and Engineering 19 (2003) pp. 827-838. (SCIE/EI) [JCR 2014 Journal Impact Factor: 0.414] (Abstract)

II】研討會論文 (Conference papers)

  1. Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi*, Yuh-Min Tseng, and Guo-Hao Qiu, Finding longest (s, t)-paths of O-shaped supergrid graphs in linear time, in: The 10th IEEE International Conference on Awareness Science and Technology 2019 (iCAST’2019), Morioka, Japan, 2019, pp. 252–259.  (EI/ISI/Scopus proceeding)
  2. Hung-Yu Chien*, Guo-Hao Qiu, Ruo-Wei Hung, An-Tong Shih, Chunhua Su, Hierarchical MQTT with edge computation, in: The 10th IEEE International Conference on Awareness Science and Technology 2019 (iCAST’2019), Morioka, Japan, 2019, pp. 457–461.  (EI/ISI/Scopus proceeding)
  3. Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung*, and Guo-Hao Qiu, The longest (s, t)-paths of C-shaped supergrid graphs, in: Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists 2019 (IMECS’2019), Hong Kong, 2019, pp. 87–93  (EI/ISI/Scopus proceeding)
  4. Hung-Yu Chien*, Yuh-Min Tseng, and Ruo-Wei Hung, Some study of applying infra-red in agriculture IoT, in: The 9th IEEE International Conference on Awareness Science and Technology (iCAST 2018), Fukuoka, Japan, 2018, pp. 241–245  (EI/ISI/Scopus proceeding)
  5. Yuh-Min Tseng*, Jui-Di Wu, Ruo-Wei Hung, and Hung-Yu Chien, Leakage-resilient certificate-based encryption scheme for IoT environments, in: The 9th IEEE International Conference on Awareness Science and Technology (iCAST 2018), Fukuoka, Japan, 2018, pp. 251–256  (EI/ISI/Scopus proceeding)
  6. Jong-Shin Chen,  Yung-Fa Huang*, Cheng-Ying Yang, Ruo-Wei Hung, and Chuan-Bi Lin, An efficient hot-spot analysis method for facebook places: Take Taipei city in Taiwan for example, in: Proceedings of 4th IEEE International Conference on Applied System Innovation 2018 (ICASI 2018), 2018, pp. 109–112. (EI/ISI/Scopus proceeding)
  7. Ruo-Wei Hung*, Jun-Lin Li, and Chih-Han Lin, The Hamiltonicity and Hamiltonian connectivity of L-shaped supergrid graphs, in: Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists 2018 (IMECS’2018), Hong Kong, vol. I, 2018, pp. 117–122  (EI/ISI/Scopus proceeding)
  8. Ruo-Wei Hung*, Jun-Lin Li, and Chih-Han Lin, The Hamiltonian connectivity of some alphabet supergrid graphs, in: 2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST 2017), Taichung, Taiwan, 2017, pp. 27–34  (EI/ISI/Scopus proceeding) [Award: Certificate of Merit]
  9. Ruo-Wei Hung*, Jong-Shin Chen, Jun-Lin Li, and Chin-Han Lin, The Hamiltonian connected property of some shaped supergrid graphs, in: Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists 2017 (IMECS’2017), Hong Kong, vol. I, 2017, pp. 63–68  (EI/ISI/Scopus proceeding) [Award: Certificate of Merit]
  10. Ruo-Wei Hung*, Chien-Hui Hou, Hao-Yu Chih, Xiaoguang Li, and Bing Sun, The Hamiltonian connectivity of rectangular supergrid graphs, in: Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists 2016 (IMECS’2016), Hong Kong, vol. I, 2016, pp. 115–121  (EI/ISI/Scopus proceeding)
  11. Ruo-Wei Hung*, Jun-Lin Li, Hao-Yu Chih, and Chien-Hui Hou, The Hamiltonian property of linear-convex supergrid graphs, in: 2015 The Third International Symposium on Computing and Networking (CANDAR 2015), Sapporo, Hokkaido, Japan, 2015, pp. 103–109.  (EI/ISI/Scopus proceeding)
  12. Ruo-Wei Hung*, Hao-Yu Chih, and Chien-Hui Hou, On the embedding of edge-disjoint Hamiltonian cycles in transposition networks, in: 2014 International Conference on Information Science, Electronics and Electrical Engineering (ISEEE 2014), Sapporo, Hokkaido, Japan, vol. 1, 2014, pp. 103108.  (EI/ISI/Scopus proceeding)
  13. Ruo-Wei Hung*, Shang-Ju Chan, and Chien-Chih Liao, Embedding two edge-disjoint Hamiltonian cycles and two equal node-disjoint cycles into twisted cubes, in:  Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists 2012 (IMECS’2012), Hong Kong, vol. I, 2012, pp. 362–367 (EI/ISI/Scopus proceeding)
  14. Ruo-Wei Hung* and Chien-Chih Liao, Two edge-disjoint Hamiltonian cycles and two-equal path partition in augmented cubes, in:  International MultiConference of Engineers and Computer Scientists 2011 (IMECS’2011), Hong Kong, vol. I, 2011, pp. 197–201.  (EI/ISI/Scopus proceeding) [Award: Best Paper Award]
  15. Ruo-Wei Hung* and  Maw-Shang Chang, Certifying algorithms for the path cover and related problems on interval graphs, in: The 2010 International Conference on Computational Science and Its Applications  (ICCSA’2010), Fukuoka, Japan, 2010. Part II, Lecture Notes in Computer Science (LNCS), vol. 6017, 2010, pp. 314–323. (EI/ISI/Scopus proceeding)
  16. Ruo-Wei Hung*, Chi-Hyi Laio, and  Chun-Kai Wang, Efficient algorithm for the paired-domination problem in convex bipartite graphs, in:  International MultiConference of Engineers and Computer Scientists 2010 (IMECS’2010), Hong Kong, vol. I, 2010, pp. 365–369. (EI/ISI/Scopus proceeding) [Award: Certificate of Merit]
  17. Ruo-Wei Hung*, Chuang-Hsi Chiu, and  Chih-Chia Yao, A linear-time algorithm for the maximum matched-paired-domination problem in cographs, in:  Proceedings of the 4th  IASTED International Conference on Computational Intelligence (CI’2009), Honolulu, Hawaii, USA, 2009, pp. 120126. (EI/ISI/Scopus proceeding)
  18. Ruo-Wei Hung*, Maw-Shang Chang, and  Chi-Hyi Laio, The Hamiltonian cycle problem on circular-arc graphs, in:  International MultiConference of Engineers and Computer Scientists 2009 (IMECS’2009), Hong Kong, vol. I, 2009, pp. 630637. (EI/ISI/Scopus proceeding) [Award: Certificate of Merit]
  19. Ruo-Wei Hung*, A linear-time algorithm for the terminal path cover problem in block graphs, in: International MultiConference of Engineers and Computer Scientists 2008 (IMECS’2008), Hong Kong, vol. I, 2008, pp. 286292. (EI/ISI/Scopus proceeding)
  20. 洪若偉*, 林志涵, 洪聖勛, 陳乙鑫, 林煒翔, 智慧型按鈕導覽裝置, in: 2017 International Conference on Advanced Information Technologies and Taiwan Association for Web Intelligence Consortium (AIT / WIC 2017), Taichung, 2017, pp. 734–738.
  21. 洪若偉*林志涵, 池浩宇, Android 智慧型裝置於WiFi區域網路之應用, in: 2016 International Conference on Advanced Information Technologies and Taiwan Association for Web Intelligence Consortium (AIT / WIC 2016), Taichung, 2016, pp. 1154–1160.
  22. Ruo-Wei Hung*, Chien-Hui Hou, Shang-Ju Chan, and Hao-Yu Chih, The Hamiltonian problems on supergrid graphs, in: The 9th International Conference on Advanced Information Technologies and 2015 Consumer Electronics Forum (AIT / CEF 2015), Taichung, 2015, pp. 517–531.
  23. 簡千喬, 洪若偉, 運用語音辨識與評分機制於音樂學習系統以提升國中學生合唱學習成效之研究, in: 2014 International Conference on Advanced Information Technologies (AIT 2014), Taichung, 2014, Article no. 915.
  24. Ruo-Wei Hung*, Chien-Chiao Chien, and Shang-Ju Chan, Disc-ring network: A novel architecture of interconnection network, in: 2013 International Conference on Advanced Information Technologies (AIT 2013), Taichung, 2013, Article no. 014.
  25. Ruo-Wei Hung* and Chien-Chih Liao, Constructing two edge-disjoint Hamiltonian cycles in decomposable networks, in: 2012 International Conference on Advanced Information Technologies and The Second National Conference on Web Intelligence and Applications (AIT / NCWIA 2012), Taichung, 2012, Article no. 47. [Award: Best Paper Award]
  26. Ruo-Wei Hung* and Chih-An Fang, A linear-time algorithm for the terminal path cover problem in trees, in: Proceedings of National Computer Symposium (NCS’2007), Taichung, Taiwan, vol. 2, 2007, pp. 558566.
  27. Ruo-Wei Hung*, A linear-time algorithm for the terminal path cover problem in cographs, in: Proceedings of the 23rd Workshop on Combinatorial Mathematics and Computation Theory, Changhua, Taiwan, 2006, pp. 6275. (Full Text)
  28. Ruo-Wei Hung* and Maw-Shang Chang, The path cover problem on circular-arc graphs, in: Proceedings of the 20th Workshop on Combinatorial Mathematics and Computation Theory, Chiayi, Taiwan, 2003, pp. 163173.
  29. Ruo-Wei Hung* and Maw-Shang Chang, Hamiltonian path problems on distance-hereditary graphs, in: Proceedings of the Workshop on Algorithms and Computational Molecular Biology, International Computer Symposium (ICS’2002), Hualien, Taiwan, vol. 1, 2002, pp. 876883. (Full Text)
  30. Ruo-Wei Hung* and Maw-Shang Chang, A linear algorithm for the connected domination problem on circular-arc graphs, in: Proceedings of the 19th Workshop on Combinatorial Mathematics and Computation Theory, Kaohsiung, Taiwan, 2002, pp. 7078. (Full Text)
  31. Ruo-Wei Hung and Maw-Shang Chang*, Special graph algorithms, in: Proceedings of the 16th Workshop on Combinatorial Mathematics and Computation Theory, Nantou, Taiwan, 1999, pp. 113. (Full Text)
  32. Maw-Shang Chang* and Ruo-Wei Hung, An efficient strategy using linked blocks for multiple stacks manipulation, in: Proceedings of National Computer Symposium (NCS’91), Taipei, Taiwan, 1991, pp. 3742. (Full Text)

III】國內期刊論文 (Local Journal papers)

  1. 若偉, 廖之翊, A linear-time algorithm for the terminal path cover problem in cographs, 朝陽學報第十三期, 2008, pp. 487518.
  2. 洪若偉, 保距圖上漢弭爾頓問題的線性演算法 , 南開學報第七期, 2002, pp. 241254.
  3. 洪若偉, 完全二分圖上的最佳邊分級, 南開學報第六期, 2001, pp. 331344.

IV (Patent)

  1. 洪若偉、許文馨「智慧型導讀及導覽裝置」,中華民國,發明專利,發明第I475527 (2015)

  2. 洪若偉,「智慧型手機之七彩霓虹燈」,中華民國,新型專利,新型第M447652 (2013)


V】出版書籍 (Edit Books)

  1. 洪若偉,"掌握 21世紀地球村",新高地,1995ISBN-957-8724-06-3

  2. 洪若偉,"nternet Server 建置深度指導手冊for Linux",資訊與電腦出版社,1996/9ISBN-957-9281-56-4

  3. 洪若偉,"Internet 上線 X Hoursfor Win95",資訊與電腦出版社,1997/1ISBN-957-9281-78-5

  4. 洪若偉,"Internet 上線完全手冊─ for Win3.1",資訊與電腦出版社,1997/2更新版,ISBN-957-9281-80-7

  5. 洪若偉,"Internet Server 建置 X Hours速成─ for Win95",資訊與電腦出版社,1997/7ISBN-957-9281-92-0

  6. 洪若偉,"決戰辦公室生產力",資訊與電腦出版社,1997/10ISBN-957-8364-25-3


VI】學位論文 (Theses)


Update: August 12, 2018