| 2023 | Near-Linear Time Approximations for Cut Problems via Fair Cuts. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. | Shu Liu, Tingyi Wu, Chaoping Xing |
| 2023 | Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness. | Xin Lyu, Weihao Zhu |
| 2023 | Improved Approximation for Two-Edge-Connectivity. | Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli |
| 2023 | The ℓ | Yi Li, Honghao Lin, David P. Woodruff |
| 2023 | Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2023 | Low Degree Testing over the Reals. | Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida |
| 2023 | Player-optimal Stable Regret for Bandit Learning in Matching Markets. | Fang Kong, Shuai Li |
| 2023 | Approximation Algorithms for Steiner Tree Augmentation Problems. | R. Ravi, Weizhong Zhang, Michael Zlatin |
| 2023 | Sublinear-Time Algorithms for Max Cut, Max E2Lin( | Pan Peng, Yuichi Yoshida |
| 2023 | Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance. | Michal Kouck, Michael E. Saks |
| 2023 | The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. | Xinrui Jia, Ola Svensson, Weiqiang Yuan |
| 2023 | Minimizing Completion Times for Stochastic Jobs via Batched Free Times. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2023 | Parameterized Approximation Scheme for Biclique-free Max | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2023 | Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2023 | Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. | Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2023 | Approximate Trace Reconstruction from a Single Trace. | Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
| 2022 | Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ | Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun |
| 2022 | Improved Algorithms for Low Rank Approximation from Sparsity. | David P. Woodruff, Taisuke Yasuda |
| 2022 | Co-evolution of Opinion and Social Tie Dynamics Towards Structural Balance. | Haotian Wang, Feng Luo, Jie Gao |
| 2022 | Constructing Many Faces in Arrangements of Lines and Segments. | Haitao Wang |
| 2022 | Local Search for Weighted Tree Augmentation and Steiner Tree. | Vera Traub, Rico Zenklusen |
| 2022 | Testing matrix product states. | Mehdi Soleimanifar, John Wright |
| 2022 | A Lower Bound for the n-queens Problem. | Michael Simkin, Zur Luria |
| 2022 | A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method. | Miriam Schlter, Martin Skutella, Khai Van Tran |