| 2025 | Approximation Algorithms for the Maximum Connected Submodular Functions. | Qinqin Gong, Zixuan Wang, Yang Lv, Ruiqi Yang |
| 2025 | Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints. | Qinqin Gong, Chunlin Hao, Donglei Du, Ruiqi Yang |
| 2025 | Erdős-Szekeres Maker-Breaker Games. | Aleksa Dzuklevski, Dmtr Plvlgyi, Alexey Pokrovskiy, Csaba D. Tth, Toms Valla, Lander Verlinde |
| 2025 | New Lower Bound and Algorithm for Online Geometric Hitting Set Problem. | Minati De, Ratnadip Mandal, Satyam Singh |
| 2025 | A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem. | Long-Shang Cho, Kai-Wei Chang, Chin Lung Lu |
| 2025 | A Dynamic Working Set Method for Compressed Sensing. | Siu-Wing Cheng, Man Ting Wong |
| 2025 | Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities. | Zheng Chen, Bin Deng, Bo Li, Minming Li, Weidong Li, Guochuan Zhang |
| 2025 | Discrete Effort Distribution via Regret-Enabled Greedy Algorithm. | Song Cao, Taikun Zhu, Kai Jin |
| 2025 | Revisit the Partial Coloring Method: Prefix Spencer and Sampling. | Dongrun Cai, Xue Chen, Wenxuan Shu, Haoyu Wang, Guangyi Zou |
| 2025 | Hunting a Rabbit Is Hard. | Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni |
| 2025 | Minimum-Membership Geometric Dominating Set: Complexity and Algorithms. | Bhavya Bansal, Raghunath Reddy Madireddy, Supantha Pandit |
| 2025 | On the Distortion of Multi-winner Election Using Single-Candidate Ballots. | Gennaro Auricchio, Zeyu Ren, Zihe Wang, Jie Zhang |
| 2025 | On the Complexity of 2-Club Cluster Editing with Vertex Splitting. | Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann, Sergio Thoumi |
| 2024 | Target Influence Maximization Against Overexposure Under Threshold-Dependent Model in Online Social Networks. | Xiaoping Zhu, Jianming Zhu, Guoqing Wang, Peikun Ni |
| 2024 | Hedonic Games for Federated Learning with Model Sharing Data. | Yuqing Zhu, Chuanwen Luo, Deying Li |
| 2024 | An Innovative Irregular Nesting Algorithm for Flaw Avoidance. | Hongji Zhu, Liping Chen, Shuguang Han |
| 2024 | An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. | Jianqi Zhou, Zhongyi Zhang, Jiong Guo |
| 2024 | Private Neural Network Training with Packed Secret Sharing. | Hengcheng Zhou |
| 2024 | New Teaching Philosophy of Theoretical Computer Science Courses in AI Era Data Structure as an Example. | Guanjie Zheng, Yiheng Wang, Ziyang Su, Yong Yu |
| 2024 | Single Machine Lot Scheduling to Minimize Maximum Weighted Completion Time. | Feifeng Zheng, Na Li, Ming Liu, Yinfeng Xu |
| 2024 | Bicriteria Approximation Algorithms for the Unit Disk Coverage Problem. | Hao Zhang, Xiya Zheng, Xiaofei Liu |
| 2024 | Generative Flow Networks for Influence Maximization in Social Networks. | Zizhen Zhang, Deying Li, Yongcai Wang, Wenping Chen, Yuqing Zhu |
| 2024 | Exploration of K12 Multi Level Information and AI Talent Training Model. | Jie Zhang, Ying Jin |
| 2024 | HR-Tree: A Hybrid PMem-DRAM and Write-Optimized R-Tree for Spatial Data Storage. | Rui Zhang, Yukai Huang, Lulu Chen, Shangyi Sun, Ming Yan, Jie Wu |
| 2024 | On the Minimum Edge Bisection of Graph. | Kun You, Bin Tang, Yifeng Chen, Baoliu Ye |