| 2022 | Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. | Zachary Friggstad, Mahya Jamshidian |
| 2022 | Longest Cycle Above Erdős-Gallai Bound. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | Improved Search of Relevant Points for Nearest-Neighbor Classification. | Alejandro Flores-Velazco |
| 2022 | There and Back Again: On Applying Data Reduction Rules by Undoing Others. | Aleksander Figiel, Vincent Froese, Andr Nichterlein, Rolf Niedermeier |
| 2022 | Submodular Maximization Subject to Matroid Intersection on the Fly. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. | Esther Ezra, Micha Sharir |
| 2022 | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2022 | Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. | Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlter |
| 2022 | Lyndon Arrays Simplified. | Jonas Ellert |
| 2022 | Finding a Cluster in Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | SAT Backdoors: Depth Beats Size. | Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | A Local Search Algorithm for Large Maximum Weight Independent Set Problems. | Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen |
| 2022 | Turbocharging Heuristics for Weak Coloring Numbers. | Alexander Dobler, Manuel Sorge, Anas Villedieu |
| 2022 | Fast Computation of Zigzag Persistence. | Tamal K. Dey, Tao Hou |
| 2022 | Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem. | Dipan Dey, Manoj Gupta |
| 2022 | A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. | Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
| 2022 | A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. | Syamantak Das, Andreas Wiese |
| 2022 | Conditional Lower Bounds for Dynamic Geometric Measure Problems. | Justin Dallant, John Iacono |
| 2022 | Determinants from Homomorphisms. | Radu Curticapean |
| 2022 | Spanner Approximations in Practice. | Markus Chimani, Finn Stutzenstein |
| 2022 | Approximate Circular Pattern Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | Approximation Algorithms for Continuous Clustering and Facility Location Problems. | Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar |
| 2022 | Counting Simplices in Hypergraph Streams. | Amit Chakrabarti, Themistoklis Haris |
| 2022 | Width Helps and Hinders Splitting Flows. | Manuel Cceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams |
| 2022 | Search-Space Reduction via Essential Vertices. | Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon |