| 2026 | ACL | A Data-Centric Approach to Generalizable Speech Deepfake Detection. | Wen Huang, Yuchen Mao, Yanmin Qian |
| 2026 | ICALP | Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems. | Lin Chen, Tingwei Hu, Yuchen Mao, Yong Chen, Lili Mei, An Zhang, Guangting Chen, Guochuan Zhang |
| 2026 | SODA | Long Arithmetic Progressions in Sparse Subset Sums: A Computational Perspective. | Lin Chen, Yuchen Mao, Guochuan Zhang |
| 2025 | ICALP | Weakly Approximating Knapsack in Subquadratic Time. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2025 | ICLR | AgentTrek: Agent Trajectory Synthesis via Guiding Replay with Web Tutorials. | Yiheng Xu, Dunjie Lu, Zhennan Shen, Junli Wang, Zekun Wang, Yuchen Mao, Caiming Xiong, Tao Yu |
| 2025 | ICLR | Sharpness-Aware Minimization Efficiently Selects Flatter Minima Late In Training. | Zhanpeng Zhou, Mingze Wang, Yuchen Mao, Bingrui Li, Junchi Yan |
| 2025 | STOC | Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses. | Lin Chen, Yuchen Mao, Guochuan Zhang |
| 2024 | COCOA | An Equally-Split Bin Packing Problem. | Ding Zou, Jiayi Lian, Wei Lu, Yichao Duan, Xingyu Lu, Jun Zhou, Yuchen Mao, Guochuan Zhang |
| 2024 | FOCS | An Improved Pseudopolynomial Time Algorithm for Subset Sum. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2024 | SODA | Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2024 | STOC | A Nearly Quadratic-Time FPTAS for Knapsack. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2024 | STOC | Approximating Partition in Near-Linear Time. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2019 | ICALP | Restricted Max-Min Allocation: Approximation and Integrality Gap. | Siu-Wing Cheng, Yuchen Mao |
| 2018 | ICALP | Restricted Max-Min Fair Allocation. | Siu-Wing Cheng, Yuchen Mao |