| 2022 | The Sparse Parity Matrix. | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana |
| 2022 | Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2022 | An Improved Local Search Algorithm for k-Median. | Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic |
| 2022 | CLAP: A New Algorithm for Promise CSPs. | Lorenzo Ciardo, Stanislav Zivn |
| 2022 | Approximating Fair Clustering with Cascaded Norm Objectives. | Eden Chlamtc, Yury Makarychev, Ali Vakilian |
| 2022 | Faster Algorithms for Bounded-Difference Min-Plus Product. | Shucheng Chi, Ran Duan, Tianle Xie |
| 2022 | Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time. | Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff |
| 2022 | Tight running times for minimum <italic>ℓ | Lin Chen, Liangde Tao, Jos Verschae |
| 2022 | Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. | Antares Chen, Jonathan Shi, Luca Trevisan |
| 2022 | Distribution-free Testing for Halfspaces (Almost) Requires PAC Learning. | Xi Chen, Shyamal Patel |
| 2022 | Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. | Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu |
| 2022 | Average-Case Subset Balancing Problems. | Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio |
| 2022 | Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2022 | Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. | Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
| 2022 | Computational Hardness of the Hylland-Zeckhauser Scheme. | Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis |
| 2022 | Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
| 2022 | Nearly 2-Approximate Distance Oracles in Subquadratic Time. | Shiri Chechik, Tianyi Zhang |
| 2022 | Metric Distortion Bounds for Randomized Social Choice. | Moses Charikar, Prasanna Ramakrishnan |
| 2022 | Near-Optimal Explainable k-Means for All Dimensions. | Moses Charikar, Lunjia Hu |
| 2022 | Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. | Timothy M. Chan, Da Wei Zheng |
| 2022 | Dynamic Geometric Set Cover, Revisited. | Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue |
| 2022 | Augmenting Edge Connectivity via Isolating Cuts. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2022 | Efficient generation of elimination trees and graph associahedra. | Jean Cardinal, Arturo Merino, Torsten Mtze |
| 2022 | Single-Sample Prophet Inequalities via Greedy-Ordered Selection. | Constantine Caramanis, Paul Dtting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhuser |
| 2022 | Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. | Manuel Cceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu |