| 2014 | Tight Bounds for Rumor Spreading with Vertex Expansion. | George Giakkoupis |
| 2014 | Relative Errors for Deterministic Low-Rank Matrix Approximations. | Mina Ghashami, Jeff M. Phillips |
| 2014 | Partitioning into Expanders. | Shayan Oveis Gharan, Luca Trevisan |
| 2014 | On Computability of Equilibria in Markets with Production. | Jugal Garg, Vijay V. Vazirani |
| 2014 | Arboricity and spanning-tree packing in random graphs with an application to load balancing. | Pu Gao, Xavier Prez-Gimnez, Cristiane M. Sato |
| 2014 | Robust Satisfiability of Systems of Equations. | Peter Franek, Marek Krcl |
| 2014 | Large induced subgraphs via triangulations and CMSO. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2014 | Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2014 | Bicriteria data compression. | Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini |
| 2014 | A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. | Esther Ezra |
| 2014 | Smoothed Analysis of Local Search for the Maximum-Cut Problem. | Michael Etscheid, Heiko Rglin |
| 2014 | Approximating | David Eisenstat, Philip N. Klein, Claire Mathieu |
| 2014 | Space complexity of list | Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2014 | MCMC sampling colourings and independent sets of | Charilaos Efthymiou |
| 2014 | On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. | Herbert Edelsbrunner, Salman Parsa |
| 2014 | Constrained Signaling in Auction Design. | Shaddin Dughmi, Nicole Immorlica, Aaron Roth |
| 2014 | Uniform random sampling of simple branched coverings of the sphere by itself. | Enrica Duchi, Dominique Poulalhon, Gilles Schaeffer |
| 2014 | Timing in chemical reaction networks. | David Doty |
| 2014 | Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. | Martin Dietzfelbinger, Philipp Woelfel |
| 2014 | Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms. | Nikhil R. Devanur, Zhiyi Huang |
| 2014 | Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover. | Amol Deshpande, Lisa Hellerstein, Devorah Kletenik |
| 2014 | The Complexity of Optimal Mechanism Design. | Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos |
| 2014 | A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. | Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio |
| 2014 | A Cubic Algorithm for Computing Gaussian Volume. | Ben Cousins, Santosh S. Vempala |
| 2014 | Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. | Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington |