| 2022 | Competitive Vertex Recoloring. | Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou |
| 2022 | Near-Optimal Algorithms for Stochastic Online Bin Packing. | Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas |
| 2022 | Towards a Theory of Algorithmic Proof Complexity (Invited Talk). | Albert Atserias |
| 2022 | Decremental Matching in General Graphs. | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
| 2022 | Computability of Finite Simplicial Complexes. | Djamel Eddine Amir, Mathieu Hoyrup |
| 2022 | Low-Degree Polynomials Extract From Local Sources. | Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, Joo Ribeiro |
| 2022 | Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras. | Josh Alman, Dean Hirsch |
| 2022 | Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games. | Xavier Allamigeon, Stphane Gaubert, Ricardo D. Katz, Mateusz Skomra |
| 2022 | Round-Optimal Lattice-Based Threshold Signatures, Revisited. | Shweta Agrawal, Damien Stehl, Anshu Yadav |
| 2022 | Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. | Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi |
| 2022 | Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. | Akash Kumar, Anand Louis, Rameesh Paul |
| 2022 | Fully Functional Parameterized Suffix Trees in Compact Space. | Arnab Ganguly, Rahul Shah, Sharma V. Thankachan |
| 2022 | Graph Reconstruction from Random Subgraphs. | Andrew McGregor, Rik Sengupta |
| 2022 | One-Pass Additive-Error Subset Selection for ℓ | Amit Deshpande, Rameshwar Pratap |
| 2022 | Parameterized Safety Verification of Round-Based Shared-Memory Systems. | Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger |
| 2022 | Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. | Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese |
| 2022 | Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. | Debarati Das, Tomasz Kociumaka, Barna Saha |
| 2022 | Separations Between Combinatorial Measures for Transitive Functions. | Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar |
| 2022 | Smoothed Analysis of the Komls Conjecture. | Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha |
| 2022 | Social Distancing Network Creation. | Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko |
| 2022 | Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk). | Madhu Sudan |
| 2021 | Deterministic Maximum Flows in Simple Graphs. | Tianyi Zhang |
| 2021 | Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. | Or Zamir |
| 2021 | Analytical Differential Calculus with Integration. | Han Xu, Zhenjiang Hu |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |