| 2023 | Fault-Tolerant ST-Diameter Oracles. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | On Computing the Vertex Connectivity of 1-Plane Graphs. | Therese Biedl, Karthik Murali |
| 2023 | Streaming k-Edit Approximate Pattern Matching via String Decomposition. | Sudatta Bhattacharya, Michal Kouck |
| 2023 | Sublinear Time Eigenvalue Approximation via Random Sampling. | Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray |
| 2023 | A Dichotomy for Succinct Representations of Homomorphisms. | Christoph Berkholz, Harry Vinall-Smeeth |
| 2023 | Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians. | Thiago Bergamaschi |
| 2023 | Fast Approximation of Search Trees on Trees with Centroid Trees. | Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, Lszl Kozma |
| 2023 | Dynamic Averaging Load Balancing on Arbitrary Graphs. | Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau |
| 2023 | The Complexity of Presburger Arithmetic with Power or Powers. | Michael Benedikt, Dmitry Chistikov, Alessio Mansutti |
| 2023 | On the Limits of Decision: the Adjacent Fragment of First-Order Logic. | Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann |
| 2023 | Cumulative Memory Lower Bounds for Randomized and Quantum Computation. | Paul Beame, Niels Kornerup |
| 2023 | Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. | Siddharth Barman, Pooja Kulkarni |
| 2023 | Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. | Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur |
| 2023 | Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. | Yossi Azar, Danny Vainstein |
| 2023 | Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. | Amir Azarmehr, Soheil Behnezhad |
| 2023 | An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2023 | Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. | Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey |
| 2023 | An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. | Shyan Akmal, Ce Jin |
| 2023 | Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. | Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Srkijrvi, Jukka Suomela |
| 2023 | Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. | Daniel Agassy, Dani Dorfman, Haim Kaplan |
| 2023 | Stable Matching: Choosing Which Proposals to Make. | Ishan Agarwal, Richard Cole |
| 2023 | On Range Summary Queries. | Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei |
| 2023 | Optimal Decremental Connectivity in Non-Sparse Graphs. | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. | Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. | Shu Liu, Chaoping Xing, Chen Yuan |