| 2021 | A 4-Approximation of the $\frac{2\pi }{3}$-MST. Stav Ashur, Matthew J. Katz |
| 2021 | A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. Shelby Kimmel, R. Teal Witter |
| 2021 | A Stronger Lower Bound on Parametric Minimum Spanning Trees. David Eppstein |
| 2021 | A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). Joe Sawada, Aaron Williams |
| 2021 | ANN for Time Series Under the Fréchet Distance. Anne Driemel, Ioannis Psarros |
| 2021 | Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings Anna Lubiw, Mohammad R. Salavatipour |
| 2021 | Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. Joachim Gudmundsson, Yuan Sha |
| 2021 | Algorithms for the Line-Constrained Disk Coverage and Related Problems. Logan Pedersen, Haitao Wang |
| 2021 | An APTAS for Bin Packing with Clique-Graph Conflicts. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2021 | Better Distance Labeling for Unweighted Planar Graphs. Pawel Gawrychowski, Przemyslaw Uznanski |
| 2021 | Characterization of Super-Stable Matchings. Changyong Hu, Vijay K. Garg |
| 2021 | Computing Weighted Subset Transversals in H-Free Graphs. Nick Brettell, Matthew Johnson, Daniël Paulusma |
| 2021 | Computing the Fréchet Distance Between Uncertain Curves in One Dimension. Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek |
| 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, Jérôme Urhausen |
| 2021 | Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. Ioana O. Bercea, Guy Even |
| 2021 | Euclidean Maximum Matchings in the Plane - Local to Global. Ahmad Biniaz, Anil Maheshwari, Michiel Smid |
| 2021 | Exploration of k-Edge-Deficient Temporal Graphs. Thomas Erlebach, Jakob T. Spooner |
| 2021 | Fair Correlation Clustering with Global and Local Guarantees. Zachary Friggstad, Ramin Mousavi |
| 2021 | Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera |
| 2021 | Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee |
| 2021 | Generalized Disk Graphs. Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan |
| 2021 | Graph Pricing with Limited Supply. Zachary Friggstad, Maryam Mahboub |
| 2021 | HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields. Jim Apple |
| 2021 | How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias |
| 2021 | Improved Bounds on the Spanning Ratio of the Theta-5-Graph. Prosenjit Bose, Darryl Hill, Aurélien Ooms |
| 2021 | Incomplete Directed Perfect Phylogeny in Linear Time. Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski |
| 2021 | Independent Sets in Semi-random Hypergraphs. Yash Khanna, Anand Louis, Rameesh Paul |
| 2021 | Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen |
| 2021 | On Minimum Generalized Manhattan Connections. Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase |
| 2021 | On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose |
| 2021 | Online Bin Packing of Squares and Cubes. Leah Epstein, Loay Mualem |
| 2021 | Online Makespan Minimization with Budgeted Uncertainty. Susanne Albers, Maximilian Janke |
| 2021 | Parameterized Complexity of Categorical Clustering with Size Constraints. Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit |
| 2021 | Particle-Based Assembly Using Precise Global Control. Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt |
| 2021 | Pattern Matching in Doubling Spaces. Corentin Allair, Antoine Vigneron |
| 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 | Reachability Problems for Transmission Graphs. Shinwoo An, Eunjin Oh |
| 2021 | Reverse Shortest Path Problem for Unit-Disk Graphs. Haitao Wang, Yiming Zhao |
| 2021 | Routing on Heavy-Path WSPD-Spanners. Prosenjit Bose, Tyler Tuttle |
| 2021 | Scheduling with Testing on Multiple Identical Parallel Machines. Susanne Albers, Alexander Eckl |
| 2021 | Solving Problems on Generalized Convex Graphs via Mim-Width. Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma |
| 2021 | Strictly In-Place Algorithms for Permuting and Inverting Permutations. Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski |
| 2021 | Support Optimality and Adaptive Cuckoo Filters. Tsvi Kopelowitz, Samuel McCauley, Ely Porat |
| 2021 | The Minimum Moving Spanning Tree Problem. Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid |
| 2021 | The Neighborhood Polynomial of Chordal Graphs. Helena Bergold, Winfried Hochstättler, Uwe Mayer |
| 2021 | Uniform Embeddings for Robinson Similarity Matrices. Jeannette C. M. Janssen, Zhiyuan Zhang |
| 2021 | Upper and Lower Bounds for Fully Retroactive Graph Problems. Monika Henzinger, Xiaowei Wu |