A Fast Algorithm for SAT in Terms of Formula Length. - Junqiang Peng 001; Mingyu Xiao 001 (SAT, 2021)

Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. - Binglin Tao; Mingyu Xiao 001; Bakhadyr Khoussainov; Junqiang Peng 001 (INFOCOM, 2022)

Fast Algorithms for SAT with Bounded Occurrences of Variables. - Junqiang Peng 001; Mingyu Xiao 001 (IJCAI, 2023)

Further improvements for SAT in terms of formula length. - Junqiang Peng 001; Mingyu Xiao 001 (Inf. Comput., 2023)

A Fast Algorithm for MaxSAT above Half Number of Clauses. - Junqiang Peng 001; Mingyu Xiao 001 (IJCAI, 2024)

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. - Jingyang Zhao 001; Mingyu Xiao 001; Junqiang Peng 001; Ziliang Xiong (AAAI, 2025)

Fast exact algorithms for the SAT problem with bounded occurrences of variables. - Junqiang Peng 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Systematic Parameter Decision in Approximate Model Counting. - Jinping Lei; Toru Takisaka; Junqiang Peng 001; Mingyu Xiao 001 (CoRR, 2025)

New Algorithms for #2-SAT and #3-SAT. - Junqiang Peng 001; Zimo Sheng; Mingyu Xiao 001 (CoRR, 2025)