| 2021 | Algorithms for the Line-Constrained Disk Coverage and Related Problems. | Logan Pedersen, Haitao Wang |
| 2021 | Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time. | Arne Leitert |
| 2021 | Diverse Partitions of Colored Points. | Marc J. van Kreveld, Bettina Speckmann, Jrme Urhausen |
| 2021 | Support Optimality and Adaptive Cuckoo Filters. | Tsvi Kopelowitz, Samuel McCauley, Ely Porat |
| 2021 | A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. | Shelby Kimmel, R. Teal Witter |
| 2021 | Independent Sets in Semi-random Hypergraphs. | Yash Khanna, Anand Louis, Rameesh Paul |
| 2021 | Particle-Based Assembly Using Precise Global Control. | Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt |
| 2021 | Uniform Embeddings for Robinson Similarity Matrices. | Jeannette C. M. Janssen, Zhiyuan Zhang |
| 2021 | Characterization of Super-Stable Matchings. | Changyong Hu, Vijay K. Garg |
| 2021 | Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. | Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Lffler, Frank Staals, Jrme Urhausen, Jordi L. Vermeulen |
| 2021 | Upper and Lower Bounds for Fully Retroactive Graph Problems. | Monika Henzinger, Xiaowei Wu |
| 2021 | Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. | Joachim Gudmundsson, Yuan Sha |
| 2021 | How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. | Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias |
| 2021 | Better Distance Labeling for Unweighted Planar Graphs. | Pawel Gawrychowski, Przemyslaw Uznanski |
| 2021 | Fair Correlation Clustering with Global and Local Guarantees. | Zachary Friggstad, Ramin Mousavi |
| 2021 | Graph Pricing with Limited Supply. | Zachary Friggstad, Maryam Mahboub |
| 2021 | Parameterized Complexity of Categorical Clustering with Size Constraints. | Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit |
| 2021 | Exploration of k-Edge-Deficient Temporal Graphs. | Thomas Erlebach, Jakob T. Spooner |
| 2021 | Online Bin Packing of Squares and Cubes. | Leah Epstein, Loay Mualem |
| 2021 | A Stronger Lower Bound on Parametric Minimum Spanning Trees. | David Eppstein |
| 2021 | Strictly In-Place Algorithms for Permuting and Inverting Permutations. | Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski |
| 2021 | ANN for Time Series Under the Frchet Distance. | Anne Driemel, Ioannis Psarros |
| 2021 | Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. | Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera |
| 2021 | Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. | Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
| 2021 | Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. | Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee |