| 2026 | SAT | PALSAT: Deep Cooperation of Unit Propagation and Local Search in Incomplete SAT Solving. | Mingming Jin, Zhijie Kuang, Jiongzhi Zheng, Kun Mao, Kun He |
| 2025 | IJCAI | Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem. | Jiongzhi Zheng, Mingming Jin, Kun He |
| 2024 | AAAI | KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem. | Mingming Jin, Jiongzhi Zheng, Kun He |
| 2024 | ECAI | DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. | Jinghui Xue, Jiongzhi Zheng, Kun He, Chu-Min Li, Yanli Liu |
| 2024 | IJCAI | Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. | Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He |
| 2023 | AAAI | Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers. | Jiongzhi Zheng, Kun He, Jianrong Zhou |
| 2022 | IJCAI | BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. | Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Many |
| 2022 | IJCAI | A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. | Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu |
| 2021 | AAAI | Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. | Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li |