| 2023 | 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, July 10-14, 2023 Kousha Etessami, Uriel Feige, Gabriele Puppis |
| 2023 | A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk). Anna R. Karlin |
| 2023 | A 4/3 Approximation for 2-Vertex-Connectivity. Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli |
| 2023 | A Dichotomy for Succinct Representations of Homomorphisms. Christoph Berkholz, Harry Vinall-Smeeth |
| 2023 | A General Framework for Learning-Augmented Online Allocation. Ilan Reuven Cohen, Debmalya Panigrahi |
| 2023 | A Hyperbolic Extension of Kadison-Singer Type Results. Ruizhe Zhang, Xinzhi Zhang |
| 2023 | A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. Jakob Bæk Tejs Houen, Mikkel Thorup |
| 2023 | A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. Claire Mathieu, Hang Zhou |
| 2023 | Action Codes. Frits W. Vaandrager, Thorsten Wißmann |
| 2023 | Algebraic Recognition of Regular Functions. Mikolaj Bojanczyk, Lê Thành Dung Nguyên |
| 2023 | An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). Rasmus Kyng |
| 2023 | An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2023 | An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Shyan Akmal, Ce Jin |
| 2023 | An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. Zachary Friggstad, Ramin Mousavi |
| 2023 | An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. Pan Peng, Yuyang Wang |
| 2023 | Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel |
| 2023 | Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance. Siu-Wing Cheng, Haoqiang Huang |
| 2023 | Approximating Long Cycle Above Dirac's Guarantee. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm. Jun-Ting Hsieh, Pravesh K. Kothari |
| 2023 | Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. Siddharth Barman, Pooja Kulkarni |
| 2023 | Approximation Algorithms for Network Design in Non-Uniform Fault Models. Chandra Chekuri, Rhea Jain |
| 2023 | Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction Problem. Ittai Rubinstein |
| 2023 | Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems. Javier Esparza, Vincent P. Grande |
| 2023 | Breaking the All Subsets Barrier for Min k-Cut. Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | Broadcasting with Random Matrices. Charilaos Efthymiou, Kostas Zampetakis |
| 2023 | Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2023 | Characterising Memory in Infinite Games. Antonio Casares, Pierre Ohlmann |
| 2023 | Checking Refinement of Asynchronous Programs Against Context-Free Specifications. Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2023 | Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller |
| 2023 | Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. Robert Ferens, Marek Szykula |
| 2023 | Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus. Titouan Carette, Etienne Moutot, Thomas Perez, Renaud Vilmart |
| 2023 | Compound Logics for Modification Problems. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | Connected k-Center and k-Diameter Clustering. Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla |
| 2023 | Context-Bounded Analysis of Concurrent Programs (Invited Talk). Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2023 | Convergence of the Number of Period Sets in Strings. Eric Rivals, Michelle Sweering, Pengfei Wang |
| 2023 | Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki |
| 2023 | Cumulative Memory Lower Bounds for Randomized and Quantum Computation. Paul Beame, Niels Kornerup |
| 2023 | Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. Minglong Qin, Penghui Yao |
| 2023 | Deterministic Regular Functions of Infinite Words. Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter |
| 2023 | Dynamic Averaging Load Balancing on Arbitrary Graphs. Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau |
| 2023 | Efficient Caching with Reserves via Marking. Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2023 | Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. Gramoz Goranci, Monika Henzinger |
| 2023 | Ellipsoid Fitting up to a Constant. Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu |
| 2023 | Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. Daniel Agassy, Dani Dorfman, Haim Kaplan |
| 2023 | Fast Approximation of Search Trees on Trees with Centroid Trees. Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma |
| 2023 | Faster Matroid Partition Algorithms. Tatsuya Terao |
| 2023 | Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | Faster Submodular Maximization for Several Classes of Matroids. Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng |
| 2023 | Fault-Tolerant ST-Diameter Oracles. Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | Finding Almost Tight Witness Trees. Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità |
| 2023 | First Order Logic on Pathwidth Revisited Again. Michael Lampis |
| 2023 | Flipper Games for Monadically Stable Graph Classes. Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | Frameworks for Nonclairvoyant Network Design with Deadlines or Delay. Noam Touitou |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. Adam Karczmarz, Piotr Sankowski |
| 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 | How to Play Optimally for Regular Objectives? Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove |
| 2023 | Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur |
| 2023 | Improved Hardness Results for the Guided Local Hamiltonian Problem. Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans |
| 2023 | Improved Mixing for the Convex Polygon Triangulation Flip Walk. David Eppstein, Daniel Frishberg |
| 2023 | Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians. Thiago Bergamaschi |
| 2023 | Incremental Maximization via Continuization. Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker |
| 2023 | Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk |
| 2023 | Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing. Hadley Black, Iden Kalemaj, Sofya Raskhodnikova |
| 2023 | Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. David E. Roberson, Tim Seppelt |
| 2023 | Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes. Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei, Yu Zheng |
| 2023 | List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. Shu Liu, Chaoping Xing, Chen Yuan |
| 2023 | Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach. Andrzej Dorobisz, Jakub Kozik |
| 2023 | Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela |
| 2023 | Low Sample Complexity Participatory Budgeting. Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, Ashish Goel |
| 2023 | Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey |
| 2023 | Lower Bounds for Pseudo-Deterministic Counting in a Stream. Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir |
| 2023 | Matching Augmentation via Simultaneous Contractions. Mohit Garg, Felix Hommelsheim, Nicole Megow |
| 2023 | Minimum Chain Cover in Almost Linear Time. Manuel Cáceres |
| 2023 | Monadic NIP in Monotone Classes of Relational Structures. Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos |
| 2023 | Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. Yossi Azar, Danny Vainstein |
| 2023 | Nearly Tight Spectral Sparsification of Directed Hypergraphs. Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa |
| 2023 | Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems. Shi Li |
| 2023 | Network Satisfaction Problems Solved by k-Consistency. Manuel Bodirsky, Simon Knäuer |
| 2023 | New Additive Emulators. Shimon Kogan, Merav Parter |
| 2023 | New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu |
| 2023 | New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld |
| 2023 | Nominal Topology for Data Languages. Fabian Birkmann, Stefan Milius, Henning Urbat |
| 2023 | Nondeterministic Interactive Refutations for Nearest Boolean Vector. Andrej Bogdanov, Alon Rosen |
| 2023 | On Computing the Vertex Connectivity of 1-Plane Graphs. Therese Biedl, Karthik Murali |
| 2023 | On Differentially Private Counting on Trees. Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Kewen Wu |
| 2023 | On Finding Constrained Independent Sets in Cycles. Ishay Haviv |
| 2023 | On Range Summary Queries. Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei |
| 2023 | On Semantically-Deterministic Automata. Bader Abu Radi, Orna Kupferman |
| 2023 | On Sparsification of Stochastic Packing Problems. Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel |
| 2023 | On the Complexity of Diameter and Related Problems in Permutation Groups. Markus Lohrey, Andreas Rosowski |
| 2023 | On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k. Timothy M. Chan, Qizheng He, Yuancheng Yu |
| 2023 | On the Limits of Decision: the Adjacent Fragment of First-Order Logic. Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann |
| 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 | Online Demand Scheduling with Failovers. Konstantina Mellou, Marco Molinaro, Rudy Zhou |
| 2023 | Online Learning and Disambiguations of Partial Concept Classes. TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini |
| 2023 | Optimal (Degree+1)-Coloring in Congested Clique. Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
| 2023 | Optimal Adjacency Labels for Subgraphs of Cartesian Products. Louis Esperet, Nathaniel Harms, Viktor Zamaraev |
| 2023 | Optimal Decremental Connectivity in Non-Sparse Graphs. Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | Ortho-Radial Drawing in Near-Linear Time. Yi-Jun Chang |
| 2023 | Parallel Self-Testing of EPR Pairs Under Computational Assumptions. Honghao Fu, Daochen Wang, Qi Zhao |
| 2023 | Parameter Estimation for Gibbs Distributions. David G. Harris, Vladimir Kolmogorov |
| 2023 | Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Leslie Ann Goldberg, Marc Roth |
| 2023 | Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk |
| 2023 | Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint. Jin-Yi Cai, Ben Young |
| 2023 | Population Protocols with Unordered Data. Michael Blondin, François Ladouceur |
| 2023 | Positivity Problems for Reversible Linear Recurrence Sequences. George Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell |
| 2023 | Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva |
| 2023 | Protecting Single-Hop Radio Networks from Message Drops. Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2023 | Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. Yanlin Chen, Ronald de Wolf |
| 2023 | Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk). Thomas Vidick |
| 2023 | Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More. Alexandru Gheorghiu, Tony Metger, Alexander Poremba |
| 2023 | Regular Methods for Operator Precedence Languages. Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Saraç |
| 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 | Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. Amir Azarmehr, Soheil Behnezhad |
| 2023 | Sample-Based Distance-Approximation for Subsequence-Freeness. Omer Cohen Sidon, Dana Ron |
| 2023 | Scheduling Under Non-Uniform Job and Machine Delays. Rajmohan Rajaraman, David Stalfa, Sheng Yang |
| 2023 | Searching for Regularity in Bounded Functions. Siddharth Iyer, Michael Whitmeyer |
| 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 |
| 2023 | Stable Matching: Choosing Which Proposals to Make. Ishan Agarwal, Richard Cole |
| 2023 | Streaming k-Edit Approximate Pattern Matching via String Decomposition. Sudatta Bhattacharya, Michal Koucký |
| 2023 | Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | Sublinear Time Eigenvalue Approximation via Random Sampling. Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray |
| 2023 | The Communication Complexity of Set Intersection Under Product Distributions. Rotem Oshman, Tal Roth |
| 2023 | The Complexity of Presburger Arithmetic with Power or Powers. Michael Benedikt, Dmitry Chistikov, Alessio Mansutti |
| 2023 | The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. Austen Z. Fan, Paraschos Koutris, Hangdong Zhao |
| 2023 | The Geometry of Tree-Based Sorting. Guy E. Blelloch, Magdalen Dobson |
| 2023 | The Identity Problem in ℤ ≀ ℤ Is Decidable. Ruiwen Dong |
| 2023 | The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly. Daniel Hader, Matthew J. Patitz |
| 2023 | The Skolem Landscape (Invited Talk). James Worrell |
| 2023 | The Support of Open Versus Closed Random Walks. Thomas Sauerwald, He Sun, Danny Vagnozzi |
| 2023 | The Wrong Direction of Jensen's Inequality Is Algorithmically Right. Or Zamir |
| 2023 | Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. Michal Wlodarczyk |
| 2023 | Triangle Counting with Local Edge Differential Privacy. Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam Smith |
| 2023 | Truthful Matching with Online Items and Offline Agents. Michal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser |
| 2023 | Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. Petr Hlinený, Jan Jedelský |
| 2023 | Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. Moritz Lichter |
| 2023 | Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. Nicolas Resch, Chen Yuan, Yihan Zhang |