| 2021 | Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. | Haim Kaplan, Jay Tenenbaum |
| 2021 | An Improved Sketching Algorithm for Edit Distance. | Ce Jin, Jelani Nelson, Kewen Wu |
| 2021 | A Ramsey Theorem for Finite Monoids. | Ismal Jecker |
| 2021 | b-Coloring Parameterized by Clique-Width. | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
| 2021 | Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. | Jacob Holm, Eva Rotenberg |
| 2021 | Digraph Coloring and Distance to Acyclicity. | Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | Parameterised Counting in Logspace. | Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao |
| 2021 | Geometric Cover with Outliers Removal. | Zhengyang Guo, Yi Li |
| 2021 | Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. | Joshua A. Grochow, Youming Qiao, Gang Tang |
| 2021 | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2021 | Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. | Stefan Gller, Mathieu Hilaire |
| 2021 | Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. | Daniel Gibney, Sharma V. Thankachan |
| 2021 | Efficiently Testing Simon's Congruence. | Pawel Gawrychowski, Maria Kosche, Tore Ko, Florin Manea, Stefan Siemer |
| 2021 | Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. | Jugal Garg, Edin Husic, Lszl A. Vgh |
| 2021 | Rice-Like Theorems for Automata Networks. | Guilhem Gamard, Pierre Guillon, Kvin Perrot, Guillaume Theyssier |
| 2021 | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | Solving One Variable Word Equations in the Free Group in Cubic Time. | Robert Ferens, Artur Jez |
| 2021 | A Faster Algorithm for Finding Tarski Fixed Points. | John Fearnley, Rahul Savani |
| 2021 | Church Synthesis on Register Automata over Linearly Ordered Data Domains. | Lo Exibard, Emmanuel Filiot, Ayrat Khalimov |
| 2021 | Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. | Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima |
| 2021 | Barrington Plays Cards: The Complexity of Card-Based Protocols. | Pavel Dvork, Michal Kouck |
| 2021 | The Edit Distance to k-Subsequence Universality. | Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Ko, Florin Manea, Stefan Siemer |
| 2021 | Inference and Mutual Information on Random Factor Graphs. | Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Nola Mller, Konstantinos Panagiotou, Matija Pasch |
| 2021 | One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. | Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida |
| 2021 | Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. | Timothy M. Chan, Saladi Rahul |