顏重功

聯絡資訊

顏重功 教授
信箱 ckyen001@ms7.hinet.net
分機 63365
研究室 M602

學歷

國立清華大學資訊科學系博士

研究領域

圖論及其應用、演算法設計與分析 (含資料結構) 、離散結構、組合最佳化

任教科目

113學年第1學期：管理數學、統計學(一)、離散數學、會計學(一)
112學年第2學期：統計學(二)、機率與統計、微積分、會計學(二)
112學年第1學期：管理數學、統計學(一)、資料庫系統

經歷

👉主要經歷

  • 世新大學資訊管理學系教授 (現職)
  • 世新大學平面傳播科技學系教授、副教授
  • 明新技術學院企業管理學系副教授
  • 景文工商專科學校電子工程科副教授、講師
  • 交通部數據通信所高級技術員

👉其他經歷

  • 演算法與計算理論學會創會理事
  • 演算法與計算理論學會發起人之一
  • 台北市高職學生家長會聯合會理事、候補理事
  • 台北市國中學生家長會聯合會理事
  • 台北市國小學生家長會聯合會候補監事

研究成果

  • 期刊論文 (Selected Journal and LNCS Series Papers)
    1. C.-Y. Lin, J.-J. Liu, W.-L. Wang, W. C.-K. Yen, and C.-C. Hsu, The outer-paired domination of graphs, International Journal of Foundations of Computer Science (2022) 33(2): 141-148. (SCIE)
    2. S.-C. Chang, W. C.-K. Yen, Y.-L. Wang, and J.-J. Liu, The connected p-median problem on block graphs, Optimization Letters (2016) 10:1191-1201. (SCIE)
    3. W. C.-K. Yen, Weighted restrained domination in subclasses of planar graphs, Theoretical Computer Science (2016) 630:13-25. (SCI)
    4. J.-J. Liu, C. T.-H. Wang, Y.-L. Wang, and W. C.-K. Yen, The hub number of co-comparability graphs, Theoretical Computer Science (2015) 570:15-21. (SCI)
    5. S.-C. Chang, W. C.-K. Yen, Y.-L. Wang, and J.-J. Liu, The NP-hardness of the connected p-median problem on bipartite graphs and split graphs, Chiang Mai Journal of Science (2013) 40:83-88. (SCIE)
    6. W. C.-K. Yen, The connected p-center problem on block graphs with forbidden vertices, Theoretical Computer Science (2012) 426-427:13-24. (SCI)
    7. W. C.-K. Yen, C.-C. Shih, and J.-J. Liu, The weighted minimum tuple 2-rainbow domination on graphs, World Academy of Science, Engineering and Technology (2012) 62:1183-1186.
    8. S.-H. Poon, W. C.-K. Yen, and C.-T. Ung, Domatic partition on several classes of graphs, G. Lin (Ed.): COCOA 2012, LNCS 7402, 245-256, 2012. (EI)
    9. W. C.-K. Yen, Algorithmic results of independent k-domination on weighted graphs, Chiang Mai Journal of Science (2011) 38 (special issue):58-70. (SCIE)
    10. C.-H. Lin, J.-J. Liu, Y.-L. Wang, and W. C.-K. Yen, The hub number of Sierpiński-like graphs, Theory of Computing Systems (2011) 49:588-600. (SCIE)
    11. J.-J. Liu, W. C.-K. Yen, and Y.-J. Chen, An optimal algorithm for untangling binary trees via rotations, The Computer Journal (2011) 54:1838-1844. (SCI)
  • 研討會論文 (Selected Conference Papers)
    1. W. C.-K. Yen, May 2023, “A unified approach for the weak {2}-domination and independent weak {2}-domination on weighted cactus graphs”, in Proceedings of the 40-th Workshop on Combinatorial Mathematics and Computation Theory, Taoyuan, Taiwan, Paper_17. (Best Paper Award Candidate)
    2. W. C.-K. Yen, Jun. 2022, “On variants of disjunctive domination on weighted graphs”, in Proceedings of the 39-th Workshop on Combinatorial Mathematics and Computation Theory, Taipei, Taiwan, 166-172.
    3. S.-C. Chang and W. C.-K. Yen, July, 2016, “On the ratio connected p-center problem”, Distance in graph 2016: A conference to celebrate the life and work of Mirka Miller, Ubud, Bali, Indonesia.
    4. W. C.-K. Yen, Dec. 2012, “2-rainbow domination and its practical variation on weighted graphs”, Proc. of International Computer Symposium 2012, Hualian, Taiwan, 59-68.
    5. W. C.-K. Yen, S. S.-M. Chen, and J.-J. Liu, S.-C. Chang, Sep. 2011, “Practical variants of the p-center problem on graphs”, The 2011 International Computer Science and Engineering Conference (ICSEC 2011), Poster Session. Computer Engineering Department, Kasetsart University, Thailand.
    6. W. C.-K. Yen, S.-C. Chang, S. C.-S. Yang, and S.-C. Hu, Apr. 2010, “The connected p-median problem on graphs with forbidden vertices”, in Proceedings of the 27-th Workshop on Combinatorial Mathematics and Computation Theory, Taichung, Taiwan, 168-173.
    7. W. C.-K. Yen and S. C.-S. Yang, Nov. 2009, “Finding connected p-centers on interval graphs”, in Proceedings of 2009 National Computer Symposium, Workshop on Algorithms and Bioinformatics, Taipei County, Taiwan, 10-15 (Excellent Paper Award).
    8. W. C.-K. Yen, S. C.-S. Yang, and S.-C. Hu, Apr. 2009, “The connected p-center problem on graphs with lengths on edges and weights on vertices”, in Proceedings of the 26-th Workshop on Combinatorial Mathematics and Computation Theory, Chiayi City, Taiwan, 274-281.
  • 研究計畫 (Selected Research Projects)
    1. 圖上加權權力相當支配及其相關問題之研究 (主持人) ，MOST 105-2221-E-128-002-，2016/08/01 ~ 2017/07/31。
    2. 圖上拘束支配及其變型問題之複雜度與演算法 (主持人) ，MOST 104-2221-E-128-001-，2015/08/01 ~ 2016/07/31。
    3. 圖上最小聚合中心問題新演算法之研究 (主持人) ，NSC 100-2221-E-128-004-，2011/08/01 ~ 2012/07/31。
    4. 圖上支配分割與完滿支配分割新演算法之研究 (主持人) ，NSC 99-2221-E-128 -003 -，2010/08/01 ~ 2011/07/31。
    5. 實用型重心問題演算法之研究 (主持人) ，NSC 98-2221-E-128-004-，2009/08/01 ~ 2011/01/31。
    6. 加權圖上最小k多重支配問題演算法新課題之研究 (主持人) ，NSC 97-2221-E-128 -002 -，2008/08/01 ~ 2009/07/31。

教科書及專書

  1. 演算法精鑰，顏重功、蔡英德著，普林斯頓國際有限公司，2021年第一版。
  2. 離散數學，顏重功著，普林斯頓國際有限公司，2019年第二版二刷、2016年第二版、2010年第一版。

獲獎及榮譽

  1. Excellent Paper Award of NCS 2009: C.-K. Yen and S. C.-S. Yang, Nov. 2009, “Finding connected p-centers on interval graphs”, in Proceedings of 2009 National Computer Symposium, Workshop on Algorithms and Bioinformatics, Taipei County, Taiwan, 10-15.
  2. 世新大學101學年度教師甲等研究獎。
  3. 世新大學96學年度教師甲等研究獎。
  4. 世新大學91學年度教師甲等研究獎。
  5. 國科會甲種研究獎 (89、86年度)
  6. 國科會大專專題計畫90年度研究創作紀念獎 (擔任指導教授) 。