| 2023 | The Price of Stability for First Price Auction. | Yaonan Jin, Pinyan Lu |
| 2023 | Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity. | Yaonan Jin, Daogao Liu, Zhao Song |
| 2023 | Small subgraphs with large average degree. | Oliver Janzer, Benny Sudakov, Istvn Tomon |
| 2023 | Spencer's theorem in nearly input-sparsity time. | Vishesh Jain, Ashwin Sah, Mehtaab Sawhney |
| 2023 | A tight quasi-polynomial bound for Global Label Min-Cut. | Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Uverton S. Souza |
| 2023 | On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. | Gbor Ivanyos, Youming Qiao |
| 2023 | Efficient resilient functions. | Peter Ivanov, Raghu Meka, Emanuele Viola |
| 2023 | Improved Approximations for Unrelated Machine Scheduling. | Sungjin Im, Shi Li |
| 2023 | Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. | Christian Ikenmeyer, Igor Pak, Greta Panova |
| 2023 | Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. | Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright |
| 2023 | Query Complexity of Inversion Minimization on Trees. | Ivan Hu, Dieter van Melkebeek, Andrew Morgan |
| 2023 | Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. | Shang-En Huang, Seth Pettie, Leqi Zhu |
| 2023 | Maintaining Expander Decompositions via Sparse Cuts. | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
| 2023 | A simple and sharper proof of the hypergraph Moore bound. | Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty |
| 2023 | A Subquadratic | Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann |
| 2023 | Massively Parallel Computation on Embedded Planar Graphs. | Jacob Holm, Jakub Tetek |
| 2023 | A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. | Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu |
| 2023 | Almost Tight Error Bounds on Differentially Private Continual Counting. | Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
| 2023 | Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. | Penny Haxell, Tibor Szab |
| 2023 | Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. | Meike Hatzel, Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2023 | Halving by a Thousand Cuts or Punctures. | Sariel Har-Peled, Da Wei Zheng |
| 2023 | Map matching queries on realistic input graphs under the Frchet distance. | Joachim Gudmundsson, Martin P. Seybold, Sampson Wong |
| 2023 | A Nearly Tight Analysis of Greedy k-means++. | Christoph Grunau, Ahmet Alper zdogru, Vclav Rozhon, Jakub Tetek |
| 2023 | Improved Bi-point Rounding Algorithms and a Golden Barrier for | Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh |
| 2023 | Fair allocation of a multiset of indivisible items. | Pranay Gorantla, Kunal Marwaha, Santhoshini Velusamy |