| 2022 | On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem. | Kim-Manuel Klein |
| 2022 | An Upper Bound and Linear-Space Queries on the LZ-End Parsing. | Dominik Kempa, Barna Saha |
| 2022 | The popular assignment problem: when cardinality is more important than popularity. | Telikepalli Kavitha, Tams Kirly, Jannik Matuschke, Ildik Schlotter, Ulrike Schmidt-Kraepelin |
| 2022 | Scalar and Matrix Chernoff Bounds from ℓ | Tali Kaufman, Rasmus Kyng, Federico Sold |
| 2022 | Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths. | Adam Karczmarz |
| 2022 | Simulating a stack using queues. | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
| 2022 | Online Weighted Matching with a Sample. | Haim Kaplan, David Naori, Danny Raz |
| 2022 | Fixed-Price Approximations in Bilateral Trade. | Zi Yang Kang, Francisco Pernice, Jan Vondrk |
| 2022 | Simulating Random Walks in Random Streams. | John Kallaugher, Michael Kapralov, Eric Price |
| 2022 | Algorithmic trade-offs for girth approximation in undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2022 | A Sublinear Bound on the Page Number of Upward Planar Graphs. | Paul Jungeblut, Laura Merker, Torsten Ueckerdt |
| 2022 | Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. | Jiashuo Jiang, Will Ma, Jiawei Zhang |
| 2022 | Approximately counting independent sets in bipartite graphs via graph containers. | Matthew Jenssen, Aditya Potukuchi, Will Perkins |
| 2022 | Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. | Aditya Jayaprakash, Mohammad R. Salavatipour |
| 2022 | Monotone edge flips to an orientation of maximum edge-connectivity la Nash-Williams. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | Frequency Estimation with One-Sided Error. | Piotr Indyk, Shyam Narayanan, David P. Woodruff |
| 2022 | On complete classes of valuated matroids. | Edin Husic, Georg Loho, Ben Smith, Lszl A. Vgh |
| 2022 | Algorithmic Thresholds for Refuting Random Polynomial Systems. | Jun-Ting Hsieh, Pravesh K. Kothari |
| 2022 | Preprocessing Imprecise Points for the Pareto Front. | Ivor van der Hoog, Irina Kostitsyna, Maarten Lffler, Bettina Speckmann |
| 2022 | The Complexity of Average-Case Dynamic Subgraph Counting. | Monika Henzinger, Andrea Lincoln, Barna Saha |
| 2022 | Deterministic algorithms for the Lovsz Local Lemma: simpler, more general, and more parallel. | David G. Harris |
| 2022 | Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. | Venkatesan Guruswami, Sai Sandeep |
| 2022 | Online Discrepancy with Recourse for Vectors and Graphs. | Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla |
| 2022 | Cubic upper and lower bounds for subtrajectory clustering under the continuous Frchet distance. | Joachim Gudmundsson, Sampson Wong |
| 2022 | A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. | Joachim Gudmundsson, Martin P. Seybold |