| 2026 | Local Homophily on Bicolored Graphs is bfP-Complete. | Pablo Concha-Vega |
| 2026 | On the Structure of Generalized Flows over Time: Why Storage is Unnecessary. | Siyuan Chen, Shengminjie Chen, Suixiang Gao, Zheyu Jiang, Dun Ma, Wenguo Yang |
| 2026 | Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique. | Parinya Chalermsook, Wanchote Jiamjitrak, Ly Orgo, Minoo Zarsav |
| 2026 | Maximizing the Margin Between Desirable and Undesirable Elements in a Covering Problem. | Sophie Boileau, Andrew Hong, David Liben-Nowell, Alistair Pattison, Anna N. Rafferty, Charlie Roslansky |
| 2026 | Discrete Homotopy and Promise Constraint Satisfaction Problem. | Arash Beikmohammadi, Andrei A. Bulatov |
| 2026 | Distance Recoloring. | Niranka Banerjee, Christian Engels, Duc A. Hoang |
| 2026 | On the Arithmetic Complexity of Euler Tours. | Nikhil Balaji, Prasad Chaugule, Nitin Saurabh |
| 2026 | Feedback Set Problems on Bounded-Degree (Planar) Graphs. | Tian Bai, Yixin Cao, Mingyu Xiao |
| 2026 | A Competitive Algorithm for the Online Stochastic Resource Allocation Problem with Departures. | Yusuf Amidu, Khaled Elbassioni, Adriana F. Gabor |
| 2025 | From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems. | Jianqi Zhou, Zhongyi Zhang, Yinghui Wen, Jiong Guo |
| 2025 | An FPT Factor-11 Approximation Algorithm for TSP. | Jianqi Zhou, Zhongyi Zhang, Jiong Guo |
| 2025 | A Robust Distributed Minimax Learning Method Against Model Poisoning Attacks. | Tingting Zhang, Yuan Yuan, Xiao Zhang, Yifei Zou, Zhipeng Cai, Dongxiao Yu |
| 2025 | Doubly Constrained Fair Clustering for General p-Norms. | Lunhao Zhang, Pengzhi Gao, Peng Zhang |
| 2025 | Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits. | Zichun Ye, Chihao Zhang, Jiahao Zhao |
| 2025 | Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date. | Yaru Yang, Honglin Ding, Wentao He |
| 2025 | An Improved Approximation Algorithm for the Minimum k-Star Partition Problem. | Tong Xu, Wei Yu, Zhaohui Liu |
| 2025 | Vertex-Critical (P | Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang |
| 2025 | Optimal Framework for Clustering with Noisy Queries. | Jinghui Xia, Zengfeng Huang |
| 2025 | On Online Approximation Algorithms for Two-Stage Bins. | Guangwei Wu, Hongyun He, Guozhen Rong, Feng Shi, Yongjie Yang |
| 2025 | A Nearly-4log n Depth Lower Bound for Formulas With Restriction on Top. | Hao Wu |
| 2025 | Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be? | Yinghui Wen, Xin Tong, Jiong Guo, Aizhong Zhou |
| 2025 | Redefining Entity Integration: Theoretical Insights for GNN-Based Recommender Systems. | Yifei Wang, Jiayan Zhu, Yao Xu, Xin Li, Jiamou Liu |
| 2025 | A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem. | Yuan Wang, Jianhang Sun, Zhipeng L, Zhouxing Su, Junwen Ding, Qingyun Zhang |
| 2025 | Adaptive Weighting-Based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows. | Yuxuan Wang, Yunhao Li, Zhouxing Su, Junwen Ding, Qingyun Zhang, Zhipeng L |
| 2025 | Massively Parallel Approximate Steiner Tree Algorithms. | Chilei Wang, Qiang-Sheng Hua, Hai Jin |