| 2017 | Low-Rank PSD Approximation in Input-Sparsity Time. | Kenneth L. Clarkson, David P. Woodruff |
| 2017 | Better upper bounds on the Fredi-Hajnal limits of permutations. | Josef Cibulka, Jan Kyncl |
| 2017 | A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering. | Tobias Christiani |
| 2017 | Approximation Algorithms for Label Cover and The Log-Density Threshold. | Eden Chlamtc, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan |
| 2017 | Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. | Eden Chlamtc, Michael Dinitz, Yury Makarychev |
| 2017 | Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. | Eden Chlamtc, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit |
| 2017 | On Rationality of Nonnegative Matrix Factorization. | Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell |
| 2017 | Core congestion is inherent in hyperbolic networks. | Victor Chepoi, Feodor F. Dragan, Yann Vaxs |
| 2017 | Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. | Xue Chen, Yuan Zhou |
| 2017 | Competitive analysis of the top- | Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider |
| 2017 | Playing Anonymous Games using Simple Strategies. | Yu Cheng, Ilias Diakonikolas, Alistair Stewart |
| 2017 | Computing minimum cuts in hypergraphs. | Chandra Chekuri, Chao Xu |
| 2017 | Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. | Chandra Chekuri, Kent Quanrud |
| 2017 | Approximating Multicut and the Demand Graph. | Chandra Chekuri, Vivek Madan |
| 2017 | Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis |
| 2017 | (1 + ∊)-Approximate | Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan |
| 2017 | Tight Network Topology Dependent Bounds on Rounds of Communication. | Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra |
| 2017 | Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. | Moses Charikar, Vaggos Chatziafratis |
| 2017 | Random Walks and Evolving Sets: Faster Convergences and Limitations. | Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau |
| 2017 | Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. | T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang |
| 2017 | Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces. | Cameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert Schweller, Luis Vega, Tim Wylie |
| 2017 | Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. | Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz |
| 2017 | Local Search for Max-Sum Diversification. | Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen |
| 2017 | When and Why the Topological Coverage Criterion Works. | Nicholas J. Cavanna, Kirk P. Gardner, Donald R. Sheehy |
| 2017 | The Complexity of Simulation and Matrix Multiplication. | Massimo Cairo, Romeo Rizzi |