| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2023 | Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk). | Thomas Vidick |
| 2023 | Action Codes. | Frits W. Vaandrager, Thorsten Wimann |
| 2023 | Frameworks for Nonclairvoyant Network Design with Deadlines or Delay. | Noam Touitou |
| 2023 | Faster Matroid Partition Algorithms. | Tatsuya Terao |
| 2023 | Sample-Based Distance-Approximation for Subsequence-Freeness. | Omer Cohen Sidon, Dana Ron |
| 2023 | The Support of Open Versus Closed Random Walks. | Thomas Sauerwald, He Sun, Danny Vagnozzi |
| 2023 | Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem. | Ittai Rubinstein |
| 2023 | Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. | Wojciech Rozowski, Tobias Kapp, Dexter Kozen, Todd Schmid, Alexandra Silva |
| 2023 | Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. | David E. Roberson, Tim Seppelt |
| 2023 | Convergence of the Number of Period Sets in Strings. | Eric Rivals, Michelle Sweering, Pengfei Wang |
| 2023 | Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. | Nicolas Resch, Chen Yuan, Yihan Zhang |
| 2023 | Scheduling Under Non-Uniform Job and Machine Delays. | Rajmohan Rajaraman, David Stalfa, Sheng Yang |
| 2023 | On Semantically-Deterministic Automata. | Bader Abu Radi, Orna Kupferman |
| 2023 | Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. | Minglong Qin, Penghui Yao |
| 2023 | The Communication Complexity of Set Intersection Under Product Distributions. | Rotem Oshman, Tal Roth |
| 2023 | Nearly Tight Spectral Sparsification of Directed Hypergraphs. | Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa |
| 2023 | Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. | Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2023 | Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. | Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | Online Demand Scheduling with Failovers. | Konstantina Mellou, Marco Molinaro, Rudy Zhou |
| 2023 | A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. | Claire Mathieu, Hang Zhou |
| 2023 | Breaking the All Subsets Barrier for Min k-Cut. | Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | On the Complexity of Diameter and Related Problems in Permutation Groups. | Markus Lohrey, Andreas Rosowski |
| 2023 | Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion. | Xiantao Li, Chunhao Wang |
| 2023 | Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching. | S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou |