Professor Chiuyuan Chen
Contact
 Email: cychen@nycu.edu.tw
 Tel: +88635731767
 Fax: +88635724679
 Address: Department of Applied Mathematics, National Yang Ming Chiao Tung University,1001 Ta Hsueh Road, Hsinchu, Taiwan 30050, ROC
Teaching
 Fall Semester, 2024：
 Mentor's Hours
 Introduction to Computer Science (I)
 Fundamental Graph Theory
 Spring Semester, 2024：
 Introduction to Computer Science (II)
 Mentor's Hours
Vitae
 Education
 Ph.D. in Computer Science and Information Engineering, National Chiao Tung University
 M.S. in Applied Mathematics, National Chiao Tung University
 B.S. in Computer and Information Science, National Chiao Tung University
 Research Areas
 Graph Theory
 The Design and Analysis of Computer Algorithms
 Interconnection Networks, Wireless Networks
 Positions, Honors and Awards
 Associate Professor, Department of Applied Mathematics, National Chiao Tung University
 Chairperson of Department of Applied Mathematics, National Chiao Tung University (20092013)
 Outstanding Teaching Award of National Chiao Tung University of 1999, 2001, 2014
 Teaching Award of Department of Applied Mathematics, National Chiao Tung University
 Editor, Discrete Mathematics, Algorithms and Applications
 Recent Research Projects

Graph theory and its application to the charging pad deployment problem in wireless rechargeable sensor networks (MOST 1102115MA49006 )

The shortest Hamiltonian cycle problem in graph theory and its application in charging tour scheduling problem in wireless rechargeable sensor networks (MOST 1092115M009010 )

The longest path problem and its application in barriercoverage problem in wireless sensor networks (MOST 1082115M009013 )

The study of continuous services of mobile servers and mutual transferability of dominating sets (1072115M009014)

Relaxed distance2 coloring and its applications to data collection in treebased wireless sensor networks (1062115M009007)

Selected Publications
 L.H. Hsu, C.Y. Chen, and E.Y. Jean (1987), "A class of additive multiplicative graph functions," Discrete Mathematics, Vol. 65, pp. 5363.
 C.Y. Chen and R.C. Chang (1990), "On the minimality of polygon triangulation," Bit, Vol. 30, pp. 570582.
 C.Y. Chen, C.C. Chang, and G.J. Chang (1997), "Proper interval graphs and the guard problem," Discrete Mathematics, Vol. 170, pp. 223230.
 C.Y. Chen and F.K. Hwang (2000), “Equivalent Lshapes of doubleloop networks for the degenerate case,” Journal of Interconnection Networks, Vol. 1, pp. 4760.
 C.Y. Chen and F.K. Hwang (2000), “Equivalent nondegenerate Lshapes of doubleloop networks,” Networks, Vol. 36, pp. 118125.
 C.Y. Chen and F.K. Hwang (2000), “The minimum distance diagram of doubleloop networks,” IEEE Transactions on Computers, Vol. 49, pp. 977979.
 F.K. Hwang, M.M. Liao and C.Y. Chen (2000), “Supermodularity in various partition problems,” (SCI) Journal of Global Optimization, Vol. 18, pp. 275282.
 C.Y. Chen and K.P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659665.
 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. 417424.
 R.C. Chan, C.Y. Chen, and Z.X. Hong (2002), “A simple algorithm to find the steps of doubleloop networks,” Discrete Applied Mathematics, Vol. 121, pp. 6172.
 C.Y. Chen (2003), “Any maximal planar graph with only one separating triangle is Hamiltonian,” Journal of Combinatorial Optimization, Vol. 7, pp. 7986.
 C.Y. Chen, F.K. Hwang, J.S. Lee, and S.J. Shih (2003), “The existence of hyperL triple loop networks,” Discrete Mathematics, Vol. 268, pp. 287291.
 G.J. Chang, C.Y. Chen, and Y.P. Chen (2004), “Vertex and tree arboricity of graphs,” Journal of Combinatorial Optimization, Vol. 8, pp. 295306.
 C.Y. Chen, F.K. Hwang, and J.K. Lan (2005), “Equivalence of buddy networks with arbitrary number of stages,” Networks, Vol. 46, pp. 171176.
 C.Y. Chen, C.S. Hung, and W.S. Tang (2006), “On the existence of hyperL tripleloop networks,” Discrete Mathematics, Vol. 306, pp. 11321138.
 C.Y. Chen and J.K. Luo (2006), “An efficient tagbased routing algorithm for the backward network of a bidirectional general shuffleexchange network,” IEEE Communications Letters, Vol. 10, No. 4, pp. 296298.
 J.S. Lee, J.K. Lan, and C.Y. Chen (2006), “On degenerate doubleloop Lshapes,” Journal of Interconnection Networks, Vol. 7, No. 2, pp. 195215.
 C.Y. Chen, J.K. Lan, and W.S. Tang (2006), “An efficient algorithm to find a doubleloop network that realizes a given Lshape,” Theoretical Computer Science, Vol. 359, pp. 6976.
 V.W. Liu, C.Y. Chen, and R.B. Chen (2007), “Optimal alltoall personalized exchange in dnary banyan multistage interconnection networks,” Journal of Combinatorial Optimization, Vol. 14, pp. 131142.
 K.S. Hu, S.S. Yeoh, C.Y. Chen, and L.H. Hsu (2007), “Nodepancyclicity and edgepancyclicity of hypercube variants,” Information Processing Letters, Vol. 102, pp. 17.
 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. 757762.
 J.K. Lan, W.Y. Chou, and C.Y. Chen (2009), “Efficient routing algorithms for generalized shuffleexchange networks,” Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267281.
 W.Y. Chou and C.Y. Chen (2010), “Alltoall personalized exchange in generalized shuffleexchange networks,” Theoretical Computer Science, Vol. 411, pp. 16691684.
 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. 22372252.
 W.Y. Chiu, C.Y. Chen, S.Y. Tsai (2014), “A 4nmove selfstabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon,” Information Processing Letters, 114, 515518.
 S.M. Lo, W.H. Lin, C.Y. Chen, and Y.C. Tseng (2017), “Optimal coloring for data collection in treebased wireless sensor networks,” Theoretical Computer Science, 700, 2336.
 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, 4152.
 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), “Receiverinitiated data collection in wakeup radio enabled mIoT networks: Achieving collisionfree transmissions by hashing and partitioning,” IEEE Transactions on Green Communications and Networking, Vol. 5, No. 2, 868883.
(A) Refereed Papers：
go back