| 2021 | Repetition- and Linearity-Aware Rank/Select Dictionaries. | Paolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra |
| 2021 | Connected Coordinated Motion Planning with Bounded Stretch. | Sndor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer |
| 2021 | Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. | Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen |
| 2021 | Separated Red Blue Center Clustering. | Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar |
| 2021 | Algorithms and Complexity on Indexing Elastic Founder Graphs. | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mkinen |
| 2021 | A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. | Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes |
| 2021 | Dynamic Boolean Formula Evaluation. | Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro |
| 2021 | Group Evacuation on a Line by Agents with Different Communication Abilities. | Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende |
| 2021 | Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion. | Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski |
| 2021 | Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. | Kyungjin Cho, Eunjin Oh |
| 2021 | An Improved Approximation Algorithm for the Matching Augmentation Problem. | Joseph Cheriyan, Robert Cummings, Jack Dippel, Jasper Zhu |
| 2021 | Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. | Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia |
| 2021 | Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions. | Siu-Wing Cheng, Man Ting Wong |
| 2021 | Pattern Masking for Dictionary Matching. | Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski |
| 2021 | Identity Testing Under Label Mismatch. | Clment L. Canonne, Karl Wimmer |
| 2021 | Partitioning H-Free Graphs of Bounded Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | Spanning Properties of Variants of the Delaunay Graph (Invited Talk). | Prosenjit Bose |
| 2021 | The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. | Thomas Blsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor |
| 2021 | Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. | Mitchell Black, William Maxwell |
| 2021 | Approximating Longest Spanning Tree with Neighborhoods. | Ahmad Biniaz |
| 2021 | Maximum-Weight Matching in Sliding Windows and Beyond. | Leyla Biabani, Mark de Berg, Morteza Monemizadeh |
| 2021 | Untangling Circular Drawings: Algorithms and Complexity. | Sujoy Bhore, Guangping Li, Martin Nllenburg, Ignaz Rutter, Hsiang-Yun Wu |
| 2021 | Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. | Sujoy Bhore, Rahul Jain |
| 2021 | Dynamic Data Structures for k-Nearest Neighbor Queries. | Sarita de Berg, Frank Staals |
| 2021 | Clique-Based Separators for Geometric Intersection Graphs. | Mark de Berg, Sndor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |