陳秋媛（Chiuyuan Chen）特聘教授

聯絡方式

Email: cychen@nycu.edu.tw
電話: 03-571-2121 或校內分機 31767
傳真: 03-572-4679
地址: 300 新竹市大學路1001號陽明交通大學應用數學系
相關網站:

近兩學期教授課程

111 學年度第一學期：
- 導師時間
- 計算機概論（一）

111 學年度第二學期：
- 計算機概論（二）
- 導師時間

履歷

學歷
- 國立交通大學資訊工程博士 (指導教授：張瑞川博士)
- 國立交通大學應用數學系碩士 (指導教授：徐力行博士)(組合數學組第一屆)
- 國立交通大學資訊科學學士 (資訊科學系第一屆)

學術專長暨研究領域
- 圖論 (Graph Theory)
- 演算法 (The Design and Analysis of Computer Algorithms)
- 連接網路及無線網路 (Interconnection Networks, Wireless Networks)

學術經歷與榮譽

近五年研究計劃

指導研究生

研究趣向

圖論在連接網路及無線網路上的應用

著作選集

(A) Refereed Papers：

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.
C.Y. Chen and R.C. Chang (1990), "On the minimality of polygon triangulation," Bit, Vol. 30, pp. 570-582.
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.
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.
C.Y. Chen and F.K. Hwang (2000), “Equivalent nondegenerate L-shapes of double-loop networks,” Networks, Vol. 36, pp. 118-125.
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.
F.K. Hwang, M.M. Liao and C.Y. Chen (2000), “Supermodularity in various partition problems,” (SCI) Journal of Global Optimization, Vol. 18, pp. 275-282.
C.Y. Chen and K.P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659-665.
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.
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 (2003), “Any maximal planar graph with only one separating triangle is Hamiltonian,” Journal of Combinatorial Optimization, Vol. 7, pp. 79-86.
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.
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.
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, 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 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.
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.
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.
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.
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.
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.
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.
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.
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.
W.Y. Chiu, C.Y. Chen, S.-Y. Tsai (2014), “A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon,” Information Processing Letters, 114, 515-518.
S.M. Lo, W.H. Lin, C.Y. Chen, and Y.C. Tseng (2017), “Optimal coloring for data collection in tree-based wireless sensor networks,” Theoretical Computer Science, 700, 23-36.
K.-T. Chu, W.-H. Lin, and C.Y. Chen (2019), Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs, Discrete Applied Mathematics, 259, 41-52.
Y.-N. Chen, W.-H. Lin, C.Y. Chen (2020), “An effective sensor deployment scheme that ensures multilevel coverage of wireless sensor networks with uncertain properties,” Sensors, 20, 1831; doi:10.3390/s20071831.
C.-A. Hsu, C.H. Tsai, F. Y. Li, C.Y. Chen, and Y.-C. Tseng (2021), “Receiver-initiated data collection in wake-up radio enabled mIoT networks: Achieving collision-free transmissions by hashing and partitioning,” IEEE Transactions on Green Communications and Networking, Vol. 5, No. 2, 868-883.

go back