最近教授之課程

97學年度第二學期	97學年度第一學期
休假進修	圖論 演算法

 

學校	職位
交通大學應用數學系	教授
交通大學應用數學系	副教授

畢業學校	國別	主修學門系所	學位
交通大學	中華民國	資訊工程	博士
交通大學	中華民國	應用數學1	碩士
交通大學	中華民國	資訊科學2	學士
臺中女中	中華民國
南投中興國中	中華民國
中興新村光榮國小	中華民國

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

• 交通大學傑出教學獎2次
• 交通大學應用數學系薪傳教學獎
• 交通大學績優導師
• 全國科展第二名

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

• 廣義的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
• 環式網路與連接網路之研究 (2/2), NSC92-2115-M-009-007

已畢業學生及其相關論文

 

畢業年度	學生姓名	論文題目
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

 

目前指導中的學生:

入學年度	學生	攻讀學位
94年9月	藍國元	博士
97年9月	邱鈺傑	博士
97年9月	吳思賢、黃思綸、羅健峰	碩士

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

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 (1990), “On some polygon decomposition problems,” Ph. D. dissertation, National Chiao Tung University, Taiwan.
4.	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.
5.	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.
6.	C. Y. Chen and F. K. Hwang (2000), “Equivalent nondegenerate L-shapes of double-loop networks,” Networks, Vol. 36, pp. 118-125.
7.	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.
8.	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.
9.	C. Y. Chen and K. P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659-665.
10.	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.
11.	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.
12.	C. Y. Chen (2003), “Any maximal planar graph with only one separating triangle is Hamiltonian,” Journal of Combinatorial Optimization, Vol. 7, pp. 79-86.
13.	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.
14.	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.
15.	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.
16.	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.
17.	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.
18.	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.
19.	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.
20.	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.
21.	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.
22.	J. K. Lan, W. Y. Chou, and C. Y. Chen (2009), “Efficient routing algorithms for generalized shuffle-exchange networks,” to appear in Discrete Mathematics, Algorithms and Applications.
23.	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.

• 電子郵件:cychen@mail.nctu.edu.tw
• 聯絡電話:(03)5731767
• 傳真:(03)5724679
• 辦公室:科學一館SA239