| 2021 | Bidirectional String Anchors: A New String Sampling Mechanism. | Grigorios Loukides, Solon P. Pissis |
| 2021 | Efficient Algorithms for Least Square Piecewise Polynomial Regression. | Daniel Lokshtanov, Subhash Suri, Jie Xue |
| 2021 | An Efficient Reduction of a Gammoid to a Partition Matroid. | Marilena Leichter, Benjamin Moseley, Kirk Pruhs |
| 2021 | Telescoping Filter: A Practical Adaptive Filter. | David J. Lee, Samuel McCauley, Shikha Singh, Max Stein |
| 2021 | Finding an Approximate Mode of a Kernel Density Estimate. | Jasper C. H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, Wai Ming Tai |
| 2021 | Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. | Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu |
| 2021 | QCSP on Reflexive Tournaments. | Benot Larose, Petar Markovic, Barnaby Martin, Danil Paulusma, Siani Smith, Stanislav Zivn |
| 2021 | Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. | Boris Klemz |
| 2021 | Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. | Dominik Kempa, Ben Langmead |
| 2021 | Parameterized Algorithms for Diverse Multistage Problems. | Leon Kellerhals, Malte Renken, Philipp Zschoche |
| 2021 | Certified Approximation Algorithms for the Fermat Point and n-Ellipses. | Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap |
| 2021 | Closing the Gap for Single Resource Constraint Scheduling. | Klaus Jansen, Malin Rau |
| 2021 | Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. | Zhiyang He, Jason Li, Magnus Wahlstrm |
| 2021 | Improved Approximation Algorithms for Tverberg Partitions. | Sariel Har-Peled, Timothy Zhou |
| 2021 | Quantum Sub-Gaussian Mean Estimator. | Yassine Hamoudi |
| 2021 | Deep Multilevel Graph Partitioning. | Lars Gottesbren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier |
| 2021 | Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). | Lukas Glomb, Benno Hoch, Frauke Liers, Florian Rsel |
| 2021 | Computing the 4-Edge-Connected Components of a Graph in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2021 | Space Efficient Two-Dimensional Orthogonal Colored Range Counting. | Younan Gao, Meng He |
| 2021 | Compression by Contracting Straight-Line Programs. | Moses Ganardi |
| 2021 | Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. | Alejandro Flores-Velazco, David M. Mount |
| 2021 | Experimental Comparison of PC-Trees and PQ-Trees. | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter |
| 2021 | Differentially Private Algorithms for Graphs Under Continual Observation. | Hendrik Fichtenberger, Monika Henzinger, Lara Ost |
| 2021 | Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. | Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
| 2021 | Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. | Zdenek Dvork, Abhiruk Lahiri |