| 2021 | Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. | Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil |
| 2021 | An Almost Optimal Edit Distance Oracle. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2021 | Fault Tolerant Max-Cut. | Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan |
| 2021 | Distributed Subgraph Finding: Progress and Challenges (Invited Talk). | Keren Censor-Hillel |
| 2021 | Sparsification of Directed Graphs via Cut Balance. | Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun |
| 2021 | Optimal Transformations of Games and Automata Using Muller Conditions. | Antonio Casares, Thomas Colcombet, Nathanal Fijalkow |
| 2021 | Lifting for Constant-Depth Circuits and Applications to MCSP. | Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
| 2021 | Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type. | Antonin Callard, Pascal Vanier |
| 2021 | Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. | Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli |
| 2021 | Symmetries and Complexity (Invited Talk). | Andrei A. Bulatov |
| 2021 | Additive Approximation Schemes for Load Balancing Problems. | Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese |
| 2021 | Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. | Karl Bringmann, Jasper Slusallek |
| 2021 | Fast n-Fold Boolean Convolution via Additive Combinatorics. | Karl Bringmann, Vasileios Nakos |
| 2021 | A Linear-Time n | Karl Bringmann, Debarati Das |
| 2021 | Beyond PCSP(1-in-3, NAE). | Alex Brandts, Stanislav Zivn |
| 2021 | Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials. | Cornelius Brand, Kevin Pratt |
| 2021 | Conditional Dichotomy of Boolean Ordered Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep |
| 2021 | Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. | Sbastien Bouchard, Yoann Dieudonn, Arnaud Labourel, Andrzej Pelc |
| 2021 | Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. | douard Bonnet, Colin Geniet, Eun Jung Kim, Stphan Thomass, Rmi Watrigant |
| 2021 | 4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}. | douard Bonnet |
| 2021 | Graph Similarity and Homomorphism Densities. | Jan Bker |
| 2021 | Direct Sum and Partitionability Testing over General Groups. | Andrej Bogdanov, Gautam Prakriya |
| 2021 | Datalog-Expressibility for Monadic and Guarded Second-Order Logic. | Manuel Bodirsky, Simon Knuer, Sebastian Rudolph |
| 2021 | Breaking O(nr) for Matroid Intersection. | Joakim Blikstad |