.

 

最近教授之課程

102學年度第一學期 101學年度第二學期
  • 計算機概論(一)
  • 離散數學專題(一)
  • 計算機概論(二)

 

Profile

目前任職及經歷
學校 職位
交通大學應用數學系 教授
交通大學應用數學系 副教授
主要學歷
畢業學校 國別 主修學門系所 學位
交通大學 中華民國 資訊工程 博士
交通大學 中華民國 應用數學1 碩士
交通大學 中華民國 資訊科學2 學士
台中女中 中華民國    
南投中興國中 中華民國    
中興新村光榮國小 中華民國    

備註1: 交通大學應用數學研究所組合數學組第一屆
備註2: 交通大學資訊科學系第一屆

獲獎

  • 交通大學傑出教學獎2次
  • 交通大學應用數學系薪傳教學獎
  • 交通大學績優導師

Research field

研究領域

  • 圖論 (Graph Theory)
  • 演算法 (The Design and Analysis of Computer Algorithms)
  • 連接網路及無線網路 (Interconnection Networks, Wireless Networks)

近年國科會計劃

  • 圖論在無線網路上之應用, 100-2115-M-009-004-MY2
  • 廣義的shuffle-exchange網路之訊息傳送演算法之設計, NSC97-2628-M-009-006-MY3
  • 混合的弦環式網路, 環式網路, 及連接網路之研究, NSC95-2115-M-009-013-MY2
  • 雙環式網路, 三環式網路, 及連接網路之研究 (2/2), NSC94-2115-M-009-006
  • 雙環式網路, 三環式網路, 及連接網路之研究 (1/2), NSC93-2115-M-009-011

Students

已畢業學生及其相關論文

 
畢業年度 學生姓名 論文題目
81 曾淑美 碩士論文: On covering polygons with rectangles (與張鎮華教授共同指導)
81 黃季豐 碩士論文: On partitioning orthogonal polygons into convex quadrilaterals
82 余琍琳 碩士論文: Characterizing grid intersection graphs
82 張伯綸 碩士論文: On partitioning simple polygons into uniformly monotone parts
82 藍彭聖 碩士論文: The feedback vertex set problem for various digraphs
82 林修懿 碩士論文: Planar visibility graphs
83 張勤振 C. Y. Chen, C. C. Chang, and G. J. Chang (1997), "Proper interval graphs and the guard problem," Discrete Mathematics, Vol. 170, pp. 223-230.
84 吳凱平 C. Y. Chen and K. P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659-665.
84 陳亞萍 G. J. Chang, C. Y. Chen, and Y. P. Chen (2004), “Vertex and tree arboricity of graphs,” Journal of Combinatorial Optimization, Vol. 8, pp. 295-306.
85 徐素琪 碩士論文: Covering simple polygons by rectangles
85 賴佳宏 碩士論文: Covering convex polygons by rectangles
89 王治平 碩士論文: Double-loop networks with minimum diameter
90 張欣心 碩士論文: Some experimental results on double-loop networks
91 石舜仁 C. Y. Chen, F. K. Hwang, J. S. Lee, and S. J. Shih (2003), “The existence of hyper-L triple loop networks,” Discrete Mathematics, Vol. 268, pp. 287-291.
91 陳沅百 碩士論文: A fault-tolerant two terminals routing algorithm of double-loop networks
陳沅百獲組合數學新苗論文獎
91 陳麗玲 碩士論文: The case study of concept learning on graph theory of a junior student
92 洪志欣 R. C. Chan, C. Y. Chen, and Z. X. Hong (2002), “A simple algorithm to find the steps of double-loop networks,” Discrete Applied Mathematics, Vol. 121, pp. 61-72.
C. Y. Chen, C. S. Hung, and W. S. Tang (2006), “On the existence of hyper-L triple-loop networks,” Discrete Mathematics, Vol. 306, pp. 1132-1138.
93 陳建瑋 碩士論文: The study of chordal ring networks
93 唐文祥 C. Y. Chen, C. S. Hung, and W. S. Tang (2006), “On the existence of hyper-L triple-loop networks,” Discrete Mathematics, Vol. 306, pp. 1132-1138.
C. Y. Chen, J. K. Lan, and W. S. Tang (2006), “An efficient algorithm to find a double-loop network that realizes a given L-shape,” Theoretical Computer Science, Vol. 359, pp. 69-76.
唐文祥獲組合數學新苗論文獎
94 劉維展 V. W. Liu, C. Y. Chen, and R. B. Chen (2007), “Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks,” Journal of Combinatorial Optimization, Vol. 14, pp. 131-142.
劉維展獲組合數學新苗論文獎, 及台灣作業研究學會論文獎第三名
J. K. Lan, V. W. Liu, and C. Y. Chen* (2009), “Improved upper and lower bounds on the optimization of mixed chordal ring networks,” Information Processing Letters, Vol. 109, pp. 757-762.
94 藍國元 C. Y. Chen, F. K. Hwang, and J. K. Lan (2005), “Equivalence of buddy networks with arbitrary number of stages,” Networks, Vol. 46, pp. 171-176.
C. Y. Chen, J. K. Lan, and W. S. Tang (2006), “An efficient algorithm to find a double-loop network that realizes a given L-shape,” Theoretical Computer Science, Vol. 359, pp. 69-76.
J. S. Lee, J. K. Lan, and C. Y. Chen (2006), “On degenerate double-loop L-sapes,” Journal of Interconnection Networks, Vol. 7, No. 2, pp. 195-215.
94 蔡宜諴 碩士論文: A study on line-based duplication and its applications
95 胡世謙 K. S. Hu, S. S. Yeoh, C. Y. Chen, and L. H. Hsu (2007), “Node-pancyclicity and edge-pancyclicity of hypercube variants,” Information Processing Letters, Vol. 102, pp. 1-7.
95 羅經凱 C. Y. Chen and J. K. Luo (2006), “An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network,” IEEE Communications Letters, Vol. 10, No. 4, pp. 296-298.
96 洪秋美 碩士論文: The study of hypercubes and their variants
96 陳柏澍 V. W. Liu, C. Y. Chen, and R. B. Chen, “Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks,” to appear in Journal of Combinatorial Optimization.
陳柏澍獲組合數學新苗論文獎
97 林威雄 碩士論文: The performance analysis of three routing algorithms of general shuffle-exchange networks
97 邱鈺傑 J. K. Lan, W. Y. Chou, and C. Y. Chen, “Efficient routing algorithms for generalized shuffle-exchange networks,” to appear in Discrete Mathematics, Algorithms and Applications.
邱鈺傑獲組合數學新苗論文獎
97 黃志文 碩士論文: On the crosstalk-free rearrangeability of combined optical multistage interconnection networks.
97 陳子鴻 碩士論文: Routing permutations in the baseline network and in the omega network.
98 黃信菖 碩士論文: The diameter-edge-invariant property of chordal ring networks.
98 蔡松育 碩士論文: The rigidity property and the unique localization problem of sensor networks
98 劉宜君 碩士論文: Constructing independent spanning trees for hypercubes and locally twisted cubes
劉宜君獲組合數學新苗論文獎
98 劉士慶 碩士論文: On the diameter of chordal ring networks
98 曾慧棻 碩士論文: On the all-to-all personalized exchange problem in chordal ring networks
99 藍國元 J. K. Lan, W. Y. Chou, and C. Y. Chen (2009), Efficient routing algorithms for generalized shuffle-exchange networks, Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267-281.
J. K. Lan, V. W. Liu, and C. Y. Chen (2009), Improved upper and lower bounds on the optimization of mixed chordal ring networks, Information Processing Letters, Vol. 109, pp. 757-762.
博士論文: On distance-related problems of mixed chordal ring networks

藍國元獲組合數學新苗論文獎
99 黃思綸 碩士論文: A polynomial-time approximation algorithm for the constrained connected dominating set problem in wireless networks
黃思綸獲組合數學新苗論文獎
99 吳思賢 碩士論文: A polynomial-time approximation scheme for the minimum-weighted independent dominating set problem in wireless networks (論文內容曾於第五屆無線、隨意及感測網路研討會發表)
99 羅健峰 碩士論文: Using a connected dominating set as the virtual backbone of a wireless network
100 蔡詩妤 碩士論文: An efficient self-stabilizing algorithm for the minimal dominating set problem under a distributed scheduler
100 何恭毅 碩士論文: On the imperfection ratio of unit disk graphs
101 袁智龍 碩士論文: On the study of position-based routing algorithms for wireless ad hoc networks

 

目前指導中的學生:

入學年度 學生 攻讀學位
97年9月 邱鈺傑 博士
99年9月 王奕倫 碩士
100年9月 趙彥呈、呂竺晏、林紹鈞 碩士

  • 我非常歡迎對圖論演算法或對網路相關之問題有興趣, 認真, 肯努力, 對自己要求高的研究生 加入我們的研究行列.
  • 我曾指導過的學生中有多位均有期刊論文.我曾指導過的學生中絕大多數是到新竹科學園區, 工研院, 資策會就業, 或擔任教職.
  • 我曾指導過的學生中
    • 張勤振已完成交通大學資訊科學研究所博士學位, 目前任教於國立聯合大學
    • 陳亞萍正攻讀中山大學應用數學研究所博士學位
    • 唐文祥已完成交通大學電信研究所博士學位, 目前於工研院服務
    • 藍國元已完成交通大學應用數學研究所博士學位, 目前在台灣大學擔任博士後
    • 邱鈺傑正攻讀交通大學應用數學研究所博士學位
    • 羅經凱正攻讀臺灣大學電機工程研究所博士

Publications

Table: Publications
# Author, title, and source
1. L. H. Hsu, C. Y. Chen, and E. Y. Jean (1987), A class of additive multiplicative graph functions, Discrete Mathematics, Vol. 65, pp. 53-63.
2. C. Y. Chen and R. C. Chang (1990), On the minimality of polygon triangulation, Bit, Vol. 30, pp. 570-582.
3. C. Y. Chen, C. C. Chang, and G. J. Chang (1997), Proper interval graphs and the guard problem, Discrete Mathematics, Vol. 170, pp. 223-230.
4. C. Y. Chen and F. K. Hwang (2000), The minimum distance diagram of double-loop networks, IEEE Transactions on Computers, Vol. 49, pp. 977-979.
5. C. Y. Chen and F. K. Hwang (2000), Equivalent nondegenerate L-shapes of double-loop networks, Networks, Vol. 36, pp. 118-125.
6. C. Y. Chen and F. K. Hwang (2000), Equivalent L-shapes of double-loop networks for the degenerate case, Journal of Interconnection Networks, Vol. 1, pp. 47-60.
7. F. K. Hwang, M. M. Liao, and C. Y. Chen (2000), Supermodularity in various partition problems, Journal of Global Optimization, Vol. 18, pp. 275-282.
8. C. Y. Chen and K. P. Wu (2001), Disproving a conjecture on planar visibility graphs, Theoretical Computer Science, Vol. 255, pp. 659-665.
9. R. C. Chan, C. Y. Chen, and Z. X. Hong (2002), A simple algorithm to find the steps of double-loop networks, Discrete Applied Mathematics, Vol. 121, pp. 61-72.
10. C. Y. Chen (2002), A necessary condition for a graph to be the visibility graph of a simple polygon, Theoretical Computer Science, Vol. 276, pp. 417-424.
11. C. Y. Chen (2003), Any maximal planar graph with only one separating triangle is Hamiltonian, Journal of Combinatorial Optimization, Vol. 7, pp. 79-86.
12. C. Y. Chen, F. K. Hwang, J. S. Lee and S. J. Shih (2003), The existence of hyper-L triple loop networks, Discrete Mathematics, Vol. 268, pp. 287-291.
13. G. J. Chang, C. Y. Chen, and Y. P. Chen (2004), Vertex and tree arboricity of graphs, Journal of Combinatorial Optimization, Vol. 8, pp. 295-306.
14. C. Y. Chen, F. K. Hwang, and J. K. Lan (2005), Equivalence of buddy networks with arbitrary number of stages, Networks, Vol. 46, pp. 171-176.
15. C. Y. Chen, C. S. Hung, and W. S. Tang (2006), On the existence of hyper-L triple-loop networks, Discrete Mathematics, Vol. 306, pp. 1132-1138.
16. C. Y. Chen and J. K. Luo (2006), An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network, IEEE Communications Letters, Vol. 10, No. 4, pp. 296-298.
17. J. S. Lee, J. K. Lan, and C. Y. Chen (2006), On degenerate double-loop L-shapes, Journal of Interconnection Networks, Vol. 7, No. 2, pp. 195-215.
18. C. Y. Chen, J. K. Lan, and W. S. Tang (2006), An efficient algorithm to find a double-loop network that realized a given L-shape, Theoretical Computer Science, Vol. 359, pp. 69-76.
19. V. W. Liu, C. Y. Chen, and R. B. Chen (2007), Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks, Journal of Combinatorial Optimization, Vol. 14, pp. 131-142.
20. K. S. Hu, S. S. Yeoh, C. Y. Chen, and L. H. Hsu (2007), Node-pancyclicity and edge-pancyclicity of hypercube variants, Information Processing Letters, Vol. 102, pp. 1-7.
21. J. K. Lan, W. Y. Chou, and C. Y. Chen (2009), Efficient routing algorithms for generalized shuffle-exchange networks, Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267-281.
22. J. K. Lan, V. W. Liu, and C. Y. Chen (2009), Improved upper and lower bounds on the optimization of mixed chordal ring networks, Information Processing Letters, Vol. 109, pp. 757-762.
23. W. Y. Chou and C. Y. Chen (2010), All-to-all personalized exchange in generalized shuffle-exchange networks, Theoretical Computer Science, Vol. 411, pp. 1669-1684.
24. Y. J. Liu, J. K. Lan, W. Y. Chou and C. Y. Chen (2011), Constructing independent spanning trees for locally twisted cubes, Theoretical Computer Science, Vol. 412, pp. 2237-2252.

Life photo

Comb groups My family My family My students My family Comb groups