# Professor Chiuyuan Chen

##### Contact

- Email: cychen@mail.nctu.edu.tw
- Tel: +886-3-5731767
- Fax: +886-3-5724679
- Address: Department of Applied Mathematics, National Chiao Tung University,1001 Ta Hsueh Road, Hsinchu, Taiwan 30050, ROC

##### Teaching

- Fall Semester, 2018：
- Introduction to Computer Science (I)
- Mentor's Hours

- Spring Semester, 2018：
- (sabbatical leave)

##### 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 (2009-2013)
- 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
- Relaxed distance-2 coloring and its applications to data collection in tree-based wireless sensor networks (106-2115-M-009-007-)
- The application of graph theory to belt barrier coverage, hole healing, and data collection in wireless sensor networks (105-2115-M-009-012-)
- The application of graph theory to the localization and routing problems in wireless sensor networks (104-2115-M-009-008-)
- Distance-two coloring for the adjacency graphs of wireless sensor networks (103-2115-M-009-012-)
- The application of Graph Theory to wireless sensor networks (data aggregation and localization problems) (102-2115-M-009-010-)

##### 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. 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, Optimal coloring for data collection in tree-based wireless sensor networks, to appear in Theoretical Computer Science.

(A) Refereed Papers：

go back