• 師資陣容

    • 行政技術人員

陳秋媛 CHIUYUAN CHEN 合聘教授
  • Ph. D. in Computer Engineering, National Chiao Tung Univ.
  • 03-5712121 # 31767

經歷

【學術經歷與榮譽】
國立交通大學應用數學系副教授
國立交通大學應用數學系系主任(2009-2013)
DMAA期刊(Discrete Mathematics, Algorithms and Applications)編輯
國立交通大學傑出教學獎3次
交通大學應用數學系薪傳教學獎
國立交通大學績優導師
  

研究興趣

Computer Algorithms, Graph Theory, The Application of Graph Theory to Interconnection Networks and Wireless Networks

研究計畫

圖論在無線感測網路的定位及訊息傳送等問題上的應用(104-2115-M-009 -008 -)
無線感測網路的連接圖的二步著色問題(103-2115-M-009-012-)
圖論在無線感測網路中的應用(資料匯集以及定位問題等)(102-2115-M-009-010-)
圖論在無線網路上之應用(100-2115-M-009-004-MY2) 

代表著作

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), “Equivalent L-shapes of double-loop networks for the degenerate case,” Journal of Interconnection Networks, Vol. 1, pp. 47-60.
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), “The minimum distance diagram of double-loop networks,” IEEE Transactions on Computers, Vol. 49, pp. 977-979.
7. 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.
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. 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.
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 (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 realizes 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, 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.
22. 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.
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.
25. 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.