- Dongxia Wang, Tim Muller, Jun Sun, “Provably Secure Decisions Based on Potentially Malicious Information”, IEEE Trans. Dependable and Secure Comput., 21, № 5, 2024, 4388
- Van Magnan, Cory Palmer, Ryan Wood, “A generalization of diversity for intersecting families”, European Journal of Combinatorics, 122, 2024, 104041
- Shuang Li, Dehai Liu, Deping Song, Tian Yao, “The Maximum Sum of Sizes of Non-Empty Cross t-Intersecting Families”, Graphs and Combinatorics, 40, № 5, 2024, 103
- Melissa Fuentes, Vikram Kamat, “On intersecting families of subgraphs of perfect matchings”, Discrete Mathematics, 348, № 7, 2025, 114460
- 帆 赵, “A Generalization of Hoffman’s Bound”, AAM, 14, № 03, 2025, 123
- Dániel T. Nagy, “An Erdős–Ko–Rado type theorem for subgraphs of perfect matchings”, Discrete Mathematics, 348, № 8, 2025, 114560
- Anyuan Tian, Yaokun Wu, “Stability of Large Rainbow Intersecting Families with Product Measure”, SIAM J. Discrete Math., 39, № 2, 2025, 973