• Chen C, Giessler P, Mamageishvili A*, et al. Sequential solutions in machine scheduling games[J]. Journal of Scheduling, 2024, 27(4): 363-373. (FMS-B, JCR Q3)
• Pan J, Chen C*, Xu Y. The price of anarchy for a berth allocation game[J]. Journal of Scheduling, 2024, 27(1): 51-60. (FMS-B, JCR Q3)
• Chen C, Wang F, Pan J, et al. Algorithm Design for an Online Berth Allocation Problem. Journal of Marine Science and Engineering, 2024, 12(10): 1722.(JCR Q1)
• C. Chen, H. Zhang* and Y. Xu, Online machine minimization with lookahead. Journal of Combinatorial Optimization, 2022, 43: 1149–1172.(JCR Q2, ABS 2, 中国数学会T2)
• C. Chen*, P. Penna, and Y. Xu, Online scheduling of jobs with favorite machines, Computers & Operations Research, 2020, 116: 104868. (JCR Q1, FMS-B, ABS 3)
• C. Chen* and Y. Xu, Coordination Mechanisms for Scheduling Selfish Jobs with Favorite Machines, Journal of Combinatorial Optimization, 2020, 40(2): 333–365. (JCR Q2, ABS 2, 中国数学会T2)
• C. Chen* and Y. Xu, The curse of rationality in sequential scheduling games, In International Conference on Web and Internet Economics (WINE 2020): 295-308.(CCF-A)
• C. Chen, P. Giessler, A. Mamageishvili*, M. Mihalak and P. Penna, Sequential Solutions in Machine Scheduling Games, In International Conference on Web and Internet Economics (WINE 2020): 309-322. (CCF-A)
• C. Chen* and Y. Xu, Selfish load balancing for jobs with favorite machines, Operations Research Letters, 2019, 47(1): 7-11.(FMS-B, ABS 2)
• C. Chen*, Y. Xu, Y. Zhu, and C. Sun, Online MapReduce scheduling problem of minimizing the makespan, Journal of Combinatorial Optimization, 2017, 33(2): 590-608. (JCR Q2, ABS 2, 中国数学会T2)
• C. Chen*, P. Penna, and Y. Xu, Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy, In International Conference on Combinatorial Optimization and Applications (COCOA 2017): 226-240.