| 2016 | Online Pricing with Impatient Bidders. | Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang |
| 2016 | Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. | Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala |
| 2016 | Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. | Radu Curticapean, Dniel Marx |
| 2016 | Approximately Efficient Double Auctions with Strong Budget Balance. | Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta |
| 2016 | Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities. | Michael B. Cohen |
| 2016 | The | Raphal Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya |
| 2016 | Weak duality for packing edge-disjoint odd ( | Ross Churchley, Bojan Mohar, Hehui Wu |
| 2016 | Obstructions for three-coloring graphs with one forbidden induced subgraph. | Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong |
| 2016 | Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. | Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova |
| 2016 | Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. | Mahdi Cheraghchi, Piotr Indyk |
| 2016 | Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions. | Xi Chen, Jinyu Xie |
| 2016 | An O(log | Lin Chen, Nicole Megow, Kevin Schewior |
| 2016 | Partial Resampling to Approximate Covering Integer Programs. | Antares Chen, David G. Harris, Aravind Srinivasan |
| 2016 | Markovian Hitters and the Complexity of Blind Rendezvous. | Sixia Chen, Matthew Dippel, Alexander Russell, Abhishek Samanta, Ravi Sundaram |
| 2016 | Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders. | Xue Chen |
| 2016 | A Fast Approximation for Maximum Weight Matroid Intersection. | Chandra Chekuri, Kent Quanrud |
| 2016 | Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. | Chandra Chekuri, Vivek Madan |
| 2016 | Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. | Chandra Chekuri, Vivek Madan |
| 2016 | Near-Optimal Light Spanners. | Shiri Chechik, Christian Wulff-Nilsen |
| 2016 | Simple Pricing Schemes For Consumers With Evolving Values. | Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan |
| 2016 | Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. | Guillaume Chapuy, Guillem Perarnau |
| 2016 | Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. | Timothy M. Chan, Ryan Williams |
| 2016 | Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. | T.-H. Hubert Chan, Shaofeng H.-C. Jiang |
| 2016 | Improved Deterministic Algorithms for Linear Programming in Low Dimensions. | Timothy M. Chan |
| 2016 | Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. | Amit Chakrabarti, Anthony Wirth |