|
國立臺北商業大學資訊與決策科學研究所所長
國立臺北商專附設空中進修學校講師兼課務組組長
國立臺北商專附設空中進修學校講師兼註冊組組長
2D/3D動畫、網頁設計、遊戲程式設計、模型製作
平面動畫、3D動畫
- 期刊論文
- 2013 Ranking and Unranking of Non-regular Trees in Gray-code Order, IEICE Transactions (SCI Expanded)
- 2012 Ranking and Unranking t-ary Trees in a Gray-code Order, The Computer Journal (SCI Expanded)
- 2012 Ranking and unranking of well-formed Parenthesis Strings: a unified approach, Chiang Mai Journal of Science (SCI Expanded)
- 2009 The Interchange Graphs of Tournaments with Minimum Score Vectors are Exactly Hypercubes, Graphs and Combinatorics (SCI)
- 2007 The existence and uniqueness of strong kings in tournaments, Discrete Mathematics (SCI)
- 2006 A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs, Ars combinatorial (SCI)
- 研討會論文
- 2011 Domination number of directed tori C8 ◊ Cn, Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory (CMCT)
- 2011 Efficient algorithms for ranking and unranking well-formed parenthesis strings in diverse representations, Proceedings of 4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC)
- 2011 Domination number of Cartesian product of directed cycles C7 ◊ Cn, Proceedings of 4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC)
- 2010 The Interchange Graphs of Non-isomorphic Tournaments with Special Score Vectors are Hypercubes. (特定得分序列下非同構競賽圖之交換圖是超立方體圖), 2010 NTCB Conference on Information Management and Practices
- 2009 On the number of universal arcs in cycle-connected bipartite tournaments, Proceeding of the 26th Workshop on Combinatorial Mathematics and Computation Theory (CMCT)
- 2007 The number of king sets of caterpillar digraphs with regular legs, proceeding of the 24th Workshop on Combinatorial Mathematics and Computation Theory (CMCT)
- 2005 On the Bound of Number of Strong Kings in Tournaments, Proceedings of the 22th Workshop on Combinatorial Mathematics and Computation Theory
- 著作
- 《網頁設計》(中華電視股份有限公司,2013)
- 《計算機概論》(勁園台科大圖書有限公司,2015)
|
