| 2023 | On Differentially Private Counting on Trees. | Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Kewen Wu |
| 2023 | Flipper Games for Monadically Stable Graph Classes. | Jakub Gajarsk, Nikolas Mhlmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | Parallel Self-Testing of EPR Pairs Under Computational Assumptions. | Honghao Fu, Daochen Wang, Qi Zhao |
| 2023 | An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. | Zachary Friggstad, Ramin Mousavi |
| 2023 | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | Approximating Long Cycle Above Dirac's Guarantee. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. | Robert Ferens, Marek Szykula |
| 2023 | Truthful Matching with Online Items and Offline Agents. | Michal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhuser |
| 2023 | The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. | Austen Z. Fan, Paraschos Koutris, Hangdong Zhao |
| 2023 | Optimal Adjacency Labels for Subgraphs of Cartesian Products. | Louis Esperet, Nathaniel Harms, Viktor Zamaraev |
| 2023 | Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems. | Javier Esparza, Vincent P. Grande |
| 2023 | Improved Mixing for the Convex Polygon Triangulation Flip Walk. | David Eppstein, Daniel Frishberg |
| 2023 | Broadcasting with Random Matrices. | Charilaos Efthymiou, Kostas Zampetakis |
| 2023 | On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n). | Charilaos Efthymiou, Weiming Feng |
| 2023 | Protecting Single-Hop Radio Networks from Message Drops. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2023 | Triangle Counting with Local Edge Differential Privacy. | Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam Smith |
| 2023 | On Sparsification of Stochastic Packing Problems. | Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel |
| 2023 | Connected k-Center and k-Diameter Clustering. | Lukas Drexler, Jan Eube, Kelin Luo, Heiko Rglin, Melanie Schmidt, Julian Wargalla |
| 2023 | Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. | Jan Dreier, Nikolas Mhlmann, Sebastian Siebertz, Szymon Torunczyk |
| 2023 | Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach. | Andrzej Dorobisz, Jakub Kozik |
| 2023 | Incremental Maximization via Continuization. | Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker |
| 2023 | Optimal (Degree+1)-Coloring in Congested Clique. | Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
| 2023 | New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. | Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld |
| 2023 | A General Framework for Learning-Augmented Online Allocation. | Ilan Reuven Cohen, Debmalya Panigrahi |
| 2023 | Online Learning and Disambiguations of Partial Concept Classes. | TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini |