1.　C. N. Lai, “Optimal node-disjoint paths in folded hypercubes,” Journal of Parallel and Distributed Computing, vol. 147, pp. 100-107, January 2021. (SCI, EI) (科技部補助 MOST-107-2221-E-992-024)

2.　C. N. Lai, “Optimal construction of node-disjoint shortest paths in folded hypercubes,” Journal of Parallel and Distributed Computing, vol. 102, pp. 37-41, April 2017. (SCI, EI) (科技部補助 MOST-105-2221-E-022-012)

3.　C. N. Lai, “On the construction of all shortest node-disjoint paths in star networks,” Information Processing Letters, vol. 116, no. 4, pp. 299-303, April 2016. (SCI-E, EI) (科技部補助 MOST-104-2221-E-022-002)

4.　C. N. Lai, “On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups,” Theoretical Computer Science, vol. 571, pp. 10-20, 16 March 2015. (SCI, EI) (科技部補助 MOST-103-2221-E-022-010)

5.　C. N. Lai, “Constructing all shortest node-disjoint paths in torus networks,” Journal of Parallel and Distributed Computing, vol. 75, pp. 123-132, January 2015. (SCI, EI) (國科會補助 NSC-102-2221-E-022-016)

6.　C. N. Lai, “An efficient construction of one-to-many node-disjoint paths in folded hypercubes,” Journal of Parallel and Distributed Computing, vol. 74, no. 4, pp. 2310-2316, April 2014. (SCI, EI) (國科會補助 NSC-101-2221-E-022-019)

7.　D. R. Duh, Y. C. Lin, C. N. Lai, Y. L. Wang, “Two spanning disjoint paths with required length in generalized hypercubes,” Theoretical Computer Science, vol. 506, pp. 55-78, 30 Sep 2013. (SCI, EI)

8.　C. N. Lai, “Optimal construction of all shortest node-disjoint paths in hypercubes with applications,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 1129-1134, June 2012. (SCI, EI) (國科會補助 NSC-98-2221-E-022-007)

9.　C. N. Lai, “Routing functions – an effective technology for constructing node-disjoint paths in hypercubes,” Journal of National Kaohsiung Marine University (國立高雄海洋科技大學學報), vol. 26, pp. 81-95, 1 Mar 2012. (高海科大校內鼓勵教師學術期刊100AB005)

10.　C. N. Lai, “Two conditions for reducing the maximal length of node-disjoint paths in hypercubes,” Theoretical Computer Science, vol. 418, pp. 82-91, 10 Feb 2012. (SCI, EI) (國科會補助 NSC-99-2221-E-022-008及高海科大校內鼓勵教師學術期刊100AB005)

11.　G. C. Jheng, D. R. Duh and C. N. Lai, “Real-time reconfigurable cache for low-power embedded systems,” International Journal of Embedded Systems, vol. 4, no. 3/4, pp. 235-247, 2010. (EI)

12.　C. N. Lai and G. H. Chen, “w-Rabin numbers and strong w-Rabin numbers of folded hypercubes,” Networks, vol. 51, no. 3, pp. 171-177, 2008. (SCI, EI) (國科會補助 NSC-95-2221-E-022-007)

13.　C. N. Lai and G. H. Chen, “Strong Rabin numbers of folded hypercubes,” Theoretical Computer Science, vol. 341, no. 2, pp. 196-215, 2005. (SCI, EI) (國科會補助 NSC-93-2213-E-022-002)

14.　C. N. Lai, G. H. Chen, and D. R. Duh, “Constructing one-to-many disjoint paths in folded hypercubes,” IEEE Transactions on Computers, vol. 51, no. 1, pp. 33-45, 2002. (SCI, EI)

1.　C. N. Lai, “On the construction of optimal node-disjoint paths in folded hypercubes of even dimensions,” Proceedings of the 2019 International Conference on Parallel and Distributed Processing Techniques & Applications, pp. 54-58, July 2019. (科技部補助 MOST-107-2221-E-992-024)

2.　C. N. Lai, “On the construction of optimal node-disjoint paths in folded hypercubes of odd dimensions,” Proceedings of the 2018 International Conference on Parallel and Distributed Processing Techniques & Applications, pp. 173-177, July 2018. (科技部補助 MOST-106-2221-E-022-001)

3.　C. N. Lai, “On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups,” Proceedings of International Computer Symposium, 2014.

4.　C. N. Lai, “An Optimal Construction of Node-Disjoint Shortest Paths in Hypercubes,” Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, 2011, pp. 245-253.

5.　Y. C. Lin, D. R. Duh, C. N. Lai, and Y. L. Wang, “Two Spanning Disjoint Paths with Required length in Generalized Hypercubes,” Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, 2011, pp. 225-235.

6.　G. C. Jheng, D. R. Duh, and C. N. Lai, “Real-time Reconfigurable Cache for Embedded Systems,” Proceedings of the 25th Workshop on Combinatorial Mathematics and Computation Theory, 2008, pp. 181-187.

7.　C. N. Lai, G. H. Chen, and D. R. Duh, “One-to-many disjoint paths in hypercubes,” Proceedings of International Computer Symposium, 2000, pp. 275-281.

8.　C. N. Lai, G. H. Chen, and D. R. Duh, “Optimal one-to-many disjoint paths in folded hypercubes,” Proceedings of International Symposium on Parallel architectures, Algorithms, and Networks, 2000, pp. 148-153.

9.　C. N. Lai, Von-Wun Soo, H. L. Chen and Y. H. Chin, “A Study on Conflict Resolution for Goal-Driven Production Systems” Proc. of National Computer Symposium, Taiwan, 1989.