| 2022 | Online Graph Algorithms with Predictions. | Yossi Azar, Debmalya Panigrahi, Noam Touitou |
| 2022 | Distortion-Oblivious Algorithms for Minimizing Flow Time. | Yossi Azar, Stefano Leonardi, Noam Touitou |
| 2022 | Perfect Matching in Random Graphs is as Hard as Tseitin. | Per Austrin, Kilian Risse |
| 2022 | Promise Constraint Satisfaction and Width. | Albert Atserias, Vctor Dalmau |
| 2022 | Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. | Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
| 2022 | A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. | Sepehr Assadi |
| 2022 | Optimal Oblivious Parallel RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi |
| 2022 | Robust Secretary and Prophet Algorithms for Packing Integer Programs. | C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla |
| 2022 | Untangling Planar Graphs and Curves by Staying Positive. | Santiago Aranguri, Hsien-Chih Chang, Dylan Fridman |
| 2022 | Algorithms Using Local Graph Features to Predict Epidemics. | Yeganeh Alimohammadi, Christian Borgs, Amin Saberi |
| 2022 | Near-Optimal Quantum Algorithms for String Problems. | Shyan Akmal, Ce Jin |
| 2022 | Robust Load Balancing with Machine Learned Advice. | Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng |
| 2022 | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. | Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski |
| 2022 | Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2021 | Tight Distributed Sketching Lower Bound for Connectivity. | Huacheng Yu |
| 2021 | Beating the probabilistic lower bound on perfect hashing. | Chaoping Xing, Chen Yuan |
| 2021 | Front Matter. | |
| 2021 | Shortest Paths Among Obstacles in the Plane Revisited. | Haitao Wang |
| 2021 | Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. | Stefan Walzer |
| 2021 | Average Sensitivity of Graph Algorithms. | Nithin Varma, Yuichi Yoshida |
| 2021 | SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. | David Steurer, Stefan Tiegel |
| 2021 | Deterministic Replacement Path Covering. | Karthik C. S., Merav Parter |
| 2021 | The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. | Matthieu Rosenfeld |
| 2021 | Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. | Dana Ron, Asaf Rosin |