RUO-WEI HUNG

Publications

學術著作與研究成果

← 回到首頁瀏覽著作

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

  1. Ruo-Wei Hung*, Paired domination on supergrid graphs: NP-completeness, restricted pairings, and tight bounds, Theoretical Computer Science 1087 (November, 2026) Art. no. 116261. (SCIE/EI/Scopus) [JCR 2024 Journal Impact Factor: 1.1, SCIE COMPUTER SCIENCE, THEORY & METHODS-99/146_Q3, 2026 SJR: 0.44, Scopus_Q2]
  2. Ruo-Wei Hung*, Fair domination on extended supergrid graphs: complexity, linear-time algorithms, and ILP formulations, Mathematics 14(6) (March, 2026)  Art. no. 947.  (SCIE/EI/Scopus: JCR 2024 Journal Impact Factor: 2.2, SCIE MATHEMATICS-30/492_Q1)
  3. Ruo-Wei Hung*, The connectivity of DVcube networks: a survey, Mathematics 13(11) (May, 2025)  Art. no. 1836.  (SCIE/EI/Scopus: JCR 2023 Journal Impact Factor: 2.3)
  4. Jong-Shin Chen*, Ruo-Wei Hung, and Cheng-Ying Yang*, An efficient target-to-area classification strategy with a PIP-based KNN algorithm for epidemic management, Mathematics 13(4) (Feb, 2025)  Art. no. 661.  (SCIE/EI/Scopus: JCR 2023 Journal Impact Factor: 2.3)
  5. Ruo-Wei Hung* and Ling-Ju Hung, Paired restraint domination in extended supergrid graphs, Journal of Supercomputing  80(9) (June, 2024) pp. 13217-13249.  (SCI/EI/Scopus)  [JCR 2022 Journal Impact Factor: 3.3]
  6. Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung*, The longest (s, t)-path problem on O-shaped supergrid graphs, Mathematics 11(12) (June, 2023)  Art. no. 2712.  (SCI/EI/Scopus)  [JCR 2022 Journal Impact Factor: 2.4]
  7. Ruo-Wei Hung*, Restrained domination and its variants in extended supergrid graphs, Theoretical Computer Science 956 (May, 2023)  Art. no. 113832. (SCI/EI/Scopus) [JCR 2022 Journal Impact Factor: 1.1]
  8. Jong-Shin Chen*, Chun-Ming Kuo, and Ruo-Wei Hung*, An efficient GNSS coordinate recognition algorithm for epidemic management, Algorithms 16(3) (Mar, 2023) Art. no. 132.  (EI/ESCI/Scopus: 2021 SJR= 0.515)
  9. Jong-Shin Chen, Ruo-Wei Hung*, Fatemeh Keshavarz-Kohjerdi, and Yung-Fa Huang*, Domination and independent domination in extended supergrid graphs, Algorithms 15(11) (Nov, 2022)  Art. no. 402.  (EI/ESCI/Scopus: 2021 SJR= 0.515)
  10. Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung*, Finding Hamiltonian and longest (s, t)-paths of C-shaped supergrid graphs in linear time, Algorithms 15(2) (Feb, 2022)  Art. no. 61.  (EI/ESCI/Scopus: 2020 SJR= 0.346)
  11. 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)
  12. Chuan-Bi Lin, Ruo-Wei Hung, Chi-Yueh Hsu, and Jong-Shin Chen*, A GNSS-based crowd-sensing strategy for specific geographical areas, Sensors 20/15 (2020)  Art. no. 4171. (SCIE/EI/Scopus:  JCR 2019 Journal Impact Factor: 3.275; 2019 SJR= 0.653) 
  13. 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)
  14. 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)
  15. 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)
  16. Ruo-Wei Hung*, Chin-Feng Li, Jong-Shin Chen, and Qing-Song Su, The Hamiltonian connectivity of rectangular supergrid graphs,  Discrete Optimization 26 (November, 2017) pp. 41-65. (SCI/EI/Scopus) [JCR 2018 Journal Impact Factor: 0.815]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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)
  23. 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)
  24. 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]
  25. 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]
  26. 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]
  27. 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)
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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. Rung-Ching Chen*, Yi-Xuan Deng, and Ruo-Wei Hung, End-to-End pedestrian safety risk prediction based on spatiotemporal graph convolutional networks, in: The 13th IEEE International Conference on Consumer Electronics (ICCE-TW 2026),  1-3 July, 2026, Taiwan, pp. 349-350. (EI/ISI/Scopus Proceeding)
  2. Ruo-Wei Hung*, Jong-Shin Chen, and An-Yu Hsiao, The 2-fair domination in planar and extended supergrid graphs, in: The 21st International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP 2025), October 15-17, 2025, Taichung, Taiwan, Art. no. 22.  [Award: Best Paper Award]
  3. Cheng-Ying Yang, Ruo-Wei Hung, Chun-Ming Kuo, and Jong-Shin Chen*, Efficient KNN classification for high-density geospatial data using grid-based partitioning, in: The 21st International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP 2025), October 15-17, 2025, Taichung, Taiwan, Art. no. 90. Smart Innovation, Systems and Technologies, vol. 491, Springer, Singapore, 2026, pp. 76–87. (EI/ISI/Scopus Proceedings) [Award: Excellent Paper Award]
  4. Ben-Jye Chang*, Ying-Hsin Liang, Ruo-Wei Hung, and De-Yu Wang, Adaptive contention preamble with differentiating contention domains for minimizing collisions and delay in 5G-advanced cellular networking, in: The 21st International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP 2025), October 15-17, 2025, Taichung, Taiwan, Art. no. 123. Smart Innovation, Systems and Technologies, vol. 491, Springer, Singapore, 2026, pp. 380–392. (EI/ISI/Scopus Proceedings)
  5. Ruo-Wei Hung*, Connectivity of the compound architecture of disc-ring and hypercube-like networks, in: 10th IEEE International Conference on Applied System Innovation 2025 (IEEE ICASI 2025), Tokoyo, Japan, 2025, J250057.  IET conference proceedings, 2025(15), 2025, pp. 71–75 (https://doi.org/10.1049/icp.2025.2491). (EI/ISI/Scopus Proceeding)
  6. De-Yu Wang, Ruo-Wei Hung*, Jong-Shin Chen, and Fu-Hsing Wang, The 1-fair domination problem on extended supergrid graphs, in: The 20th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP 2024), October 4-6, 2024, Matsue, Japan, No. 12. Smart Innovation, Systems and Technologies, vol. 47, Springer, Singapore, 2026, pp. 129–141.  (EI/ISI/Scopus Proceedings) [Award: Excellent Paper Award]
  7. Ruo-Wei Hung*, The paired and paired-restrained domination problems in planar graphs, in: 10th IEEE International Conference on Applied System Innovation 2024 (IEEE ICASI 2024), Kyoto, Japan, 2024, J240020. 
  8. Ruo-Wei Hung*, Yuh-Min Tseng, and Hung-Yu Chien, Paired domination in extended hypergrid graphs, in: 9th IEEE International Conference on Applied System Innovation 2023 (IEEE ICASI 2023), Chiba, Japan, 2023, J230008.  System Innovation for a Word  in Transition, Taylor & Francis , 2023, pp. 119–122 (https://doi.org/10.1201/9781003460763). (EI/ISI/Scopus Proceedings)
  9. Hung-Yu Chien*, Nian-Zu Wang, Yuh-Min Tseng, and Ruo-Wei Hung, New group-key-based over air (OTA) update model facilitating security and efficiency using MQTT 5, in: International Conference on Frontier Computing (FC2023), Lecture Notes in Electrical Engineering 1134, 2023, pp. 317–328. (EI/ISI/Scopus Proceedings)
  10. Yuh-Min Tseng*, Hung-Yu Chien, Ruo-Wei Hung, and Tung-Tso Tsai, Leakage-resilient anonymous multi-receiver outsourced revocable certificateless encryption, in: 5th International Conference on Computer Communication and the Internet (ICCCI 2023), Fujisawa, Japan, 2023, pp. 127–132. (EI/ISI/Scopus Proceedings)
  11. Chi-Yueh Hsu, Chun-Ming Kuo, Ruo-Wei Hung*, and Jong-Shin Chen*, Research on KNN-based GNSS coordinate classification for epidemic management, in: The 25th International Computer Symposium (ICS’2022), Taoyuan, Taiwan, CCIS 1723, 2022, pp. 493–500. (EI/ISI/Scopus Proceedings)
  12. Ruo-Wei Hung* and Ming-Jung Chiu, The paired restrained-domination problem in supergrid graphs, in: The 26th International Conference on Technologies and Applications of Artificial Intelligence (TAAI'2021), 2021, pp. 84–89. (EI/ISI/Scopus Proceedings)
  13. Ruo-Wei Hung* and Ming-Jung Chiu, The restrained domination and independent restrained domination in extending supergrid graphs, in: The 27th International Computing and Combinatorics Conference (COCOON'2021), LNCS 13025, 2021, pp. 401–412. (EI/ISI/Scopus Proceedings)
  14. Ruo-Wei Hung*, Ming-Jung Chiu, and Jong-Shin Chen, The domination and independent domination problems in supergrid graphs, in: The 21st International Conference on Computational Science and its Applications (ICCSA'2021), LNCS 12949, 2021, pp. 631–646. (EI/ISI/Scopus Proceedings)
  15. 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 Proceedings)
  16. 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 Proceedings)
  17. 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 Proceedings)
  18. 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 Proceedings)
  19. 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 Proceedings)
  20. 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 Proceedings)
  21. 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 Proceedings)
  22. 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 Proceedings) [Award: Certificate of Merit]
  23. 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 Proceedings) [Award: Certificate of Merit]
  24. 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 Proceedings)
  25. 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 Proceedings)
  26. 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. 103–108. (EI/ISI/Scopus Proceedings)
  27. 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 Proceedings)
  28. 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 Proceedings) [Award: Best Paper Award]
  29. 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 Proceedings)
  30. 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 Proceedings) [Award: Certificate of Merit]
  31. 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. 120–126. (EI/ISI/Scopus Proceedings)
  32. 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. 630–637. (EI/ISI/Scopus Proceedings) [Award: Certificate of Merit]
  33. 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. 286–292. (EI/ISI/Scopus Proceedings)
  34. 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.
  35. 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.
  36. 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]
  37. 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. 558–566.
  38. 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. 62–75. (Full Text)
  39. 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. 163–173.
  40. 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. 876–883. (Full Text)
  41. 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. 70–78. (Full Text)
  42. 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. 1–13. (Full Text)
  43. 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. 37–42. (Full Text)

III國內期刊論文 (Local Journal Papers)

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

IV專利 (Patents)

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

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

V出版書籍 (Edited Books)

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

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

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

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

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

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

VI學位論文 (Theses)

↑