| 2026 | ICALP | A Faster Directed Single-Source Shortest Path Algorithm. | Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin |
| 2026 | INFOCOM | Adaptive Two-timescale Joint Service Placement and Request Scheduling for Efficient Edge AIGC. | Changfu Xu, Xiao Mao, Haiyang Huang, Zhiqing Tang, Haodong Zou, Yuzhu Liang |
| 2026 | STOC | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2026 | STOC | Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time. | Xiao Mao, Aviad Rubinstein |
| 2025 | STOC | Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. | Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin |
| 2024 | STOC | (1 - ε)-Approximation of Knapsack in Nearly Quadratic Time. | Xiao Mao |
| 2024 | STOC | Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. | Xiao Mao |
| 2023 | SODA | Approximating Knapsack and Partition via Dense Subset Sums. | Mingyang Deng, Ce Jin, Xiao Mao |
| 2023 | SODA | On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach. | Mingyang Deng, Xiao Mao, Ziqian Zhong |
| 2021 | FOCS | Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance. | Xiao Mao |