| 2026 | AAAI | How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? | Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao |
| 2026 | WWW | Sustained Vertex Cover on Temporal Graphs. | Junqiang Peng, Tian Bai, Jingyang Zhao, Mingyu Xiao |
| 2026 | SAT | New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions. | Sanjay Jain, Junqiang Peng, Frank Stephan, Haoyun Tang, Mingyu Xiao |
| 2025 | AAAI | Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. | Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong |
| 2025 | IJCAI | New Algorithms for #2-SAT and #3-SAT. | Junqiang Peng, Zimo Sheng, Mingyu Xiao |
| 2024 | IJCAI | A Fast Algorithm for MaxSAT above Half Number of Clauses. | Junqiang Peng, Mingyu Xiao |
| 2023 | IJCAI | Fast Algorithms for SAT with Bounded Occurrences of Variables. | Junqiang Peng, Mingyu Xiao |
| 2022 | INFOCOM | Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. | Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng |
| 2021 | SAT | A Fast Algorithm for SAT in Terms of Formula Length. | Junqiang Peng, Mingyu Xiao |