| Approximating knapsack and partition via dense subset sums M Deng, C Jin, X Mao Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 22 | 2023 |
| Breaking the cubic barrier for (unweighted) tree edit distance X Mao SIAM Journal on Computing, FOCS21-195-FOCS21-223, 2023 | 12 | 2023 |
| On problems related to unbounded subsetsum: A unified combinatorial approach M Deng, X Mao, Z Zhong Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |
| Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time X Mao Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1141-1152, 2024 | 5 | 2024 |
| Shortest non-separating st-path on chordal graphs X Mao arXiv preprint arXiv:2101.03519, 2021 | 2 | 2021 |
| (1 − 𝜀)-Approximation of Knapsack in Nearly Quadratic Time X Mao Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 295-306, 2024 | | 2024 |
| Dynamic Programming meets Fine-grained Complexity X Mao Massachusetts Institute of Technology, 2022 | | 2022 |
| A natural extension to the convex hull problem and a novel solution X Mao arXiv preprint arXiv:2012.01216, 2020 | | 2020 |