| 2023 | Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. | Moritz Lichter |
| 2023 | First Order Logic on Pathwidth Revisited Again. | Michael Lampis |
| 2023 | An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). | Rasmus Kyng |
| 2023 | Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. | Marvin Knnemann, Filip Mazowiecki, Lia Schtze, Henry Sinclair-Banks, Karol Wegrzycki |
| 2023 | New Additive Emulators. | Shimon Kogan, Merav Parter |
| 2023 | Positivity Problems for Reversible Linear Recurrence Sequences. | George Kenison, Joris Nieuwveld, Jol Ouaknine, James Worrell |
| 2023 | A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk). | Anna R. Karlin |
| 2023 | Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. | Adam Karczmarz, Piotr Sankowski |
| 2023 | Searching for Regularity in Bounded Functions. | Siddharth Iyer, Michael Whitmeyer |
| 2023 | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto |
| 2023 | Rerouting Planar Curves and Disjoint Paths. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2023 | Efficient Caching with Reserves via Marking. | Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2023 | Finding Almost Tight Witness Trees. | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanit |
| 2023 | Ellipsoid Fitting up to a Constant. | Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu |
| 2023 | Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. | Jun-Ting Hsieh, Pravesh K. Kothari |
| 2023 | A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. | Jakob Bk Tejs Houen, Mikkel Thorup |
| 2023 | Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. | Petr Hlinen, Jan Jedelsk |
| 2023 | Faster Submodular Maximization for Several Classes of Matroids. | Monika Henzinger, Paul Liu, Jan Vondrk, Da Wei Zheng |
| 2023 | Regular Methods for Operator Precedence Languages. | Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Sara |
| 2023 | On Finding Constrained Independent Sets in Cycles. | Ishay Haviv |
| 2023 | The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly. | Daniel Hader, Matthew J. Patitz |
| 2023 | Low Sample Complexity Participatory Budgeting. | Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, Ashish Goel |
| 2023 | Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. | Gramoz Goranci, Monika Henzinger |
| 2023 | Parameterised and Fine-Grained Subgraph Counting, Modulo 2. | Leslie Ann Goldberg, Marc Roth |
| 2023 | Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More. | Alexandru Gheorghiu, Tony Metger, Alexander Poremba |