| 2023 | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2023 | Private Convex Optimization in General Norms. | Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian |
| 2023 | Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. | Stefan Gller, Pawel Parys |
| 2023 | Instability of backoff protocols with arbitrary arrival rates. | Leslie Ann Goldberg, John Lapinskas |
| 2023 | Conflict-free hypergraph matchings. | Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Khn, Lyuben Lichev |
| 2023 | Excluding Single-Crossing Matching Minors in Bipartite Graphs. | Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2023 | Spatial mixing and the random-cluster dynamics on lattices. | Reza Gheissari, Alistair Sinclair |
| 2023 | Faster Computation of 3-Edge-Connected Components in Digraphs. | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
| 2023 | Graph Classes with Few Minimal Separators. II. A Dichotomy. | Peter Gartland, Daniel Lokshtanov |
| 2023 | Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. | Peter Gartland, Daniel Lokshtanov |
| 2023 | Subexponential mixing for partition chains on grid-like graphs. | Alan M. Frieze, Wesley Pegden |
| 2023 | Shrunk subspaces via operator Sinkhorn iteration. | Cole Franks, Tasuku Soma, Michel X. Goemans |
| 2023 | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. | Jacob Focke, Dniel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
| 2023 | Fast Distributed Brooks' Theorem. | Manuela Fischer, Magns M. Halldrsson, Yannic Maus |
| 2023 | Simple Mechanisms for Non-linear Agents. | Yiding Feng, Jason D. Hartline, Yingkai Li |
| 2023 | Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential Privacy. | Vitaly Feldman, Audra McMillan, Kunal Talwar |
| 2023 | Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. | Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Vclav Rozhon |
| 2023 | "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. | Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
| 2023 | Optimal Square Detection Over General Alphabets. | Jonas Ellert, Pawel Gawrychowski, Garance Gourdel |
| 2023 | Interactive Coding with Small Memory. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2023 | Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. | Franois Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz |
| 2023 | A Nearly Time-Optimal Distributed Approximation of Minimum Cost | Michal Dory, Mohsen Ghaffari |