| 2011 | A Nonlinear Approach to Dimension Reduction. | Lee-Ad Gottlieb, Robert Krauthgamer |
| 2011 | On the Randomness Requirements of Rumor Spreading. | George Giakkoupis, Philipp Woelfel |
| 2011 | Submodular Maximization by Simulated Annealing. | Shayan Oveis Gharan, Jan Vondrk |
| 2011 | The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus. | Shayan Oveis Gharan, Amin Saberi |
| 2011 | The Local Lemma is Tight for SAT. | Heidi Gebauer, Tibor Szab, Gbor Tardos |
| 2011 | Optimal pattern matching in LZW compressed strings. | Pawel Gawrychowski |
| 2011 | Packing tight Hamilton cycles in 3-uniform hypergraphs. | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
| 2011 | A subexponential lower bound for the Random Facet algorithm for Parity Games. | Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick |
| 2011 | Where computer vision needs help from computer science. | William T. Freeman |
| 2011 | Computing the Independence Number of Intersection Graphs. | Jacob Fox, Jnos Pach |
| 2011 | Online Scheduling on Identical Machines using SRPT. | Kyle Fox, Benjamin Moseley |
| 2011 | Overlap properties of geometric expanders. | Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, Jnos Pach |
| 2011 | The Multiple-Orientability Thresholds for Random Hypergraphs. | Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou |
| 2011 | On the Complexity of Time-Dependent Shortest Paths. | Luca Foschini, John Hershberger, Subhash Suri |
| 2011 | Bidimensionality and EPTAS. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2011 | On Buffon Machines and Numbers. | Philippe Flajolet, Maryse Pelletier, Michle Soria |
| 2011 | Exponential Time Improvement for min-wise Based Algorithms. | Guy Feigenblat, Ely Porat, Ariel Shiftan |
| 2011 | An algorithmic decomposition of claw-free graphs leading to an O(n | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer |
| 2011 | Improved Bound for the Union of Fat Triangles. | Esther Ezra, Boris Aronov, Micha Sharir |
| 2011 | Computing Replacement Paths in Surface Embedded Graphs. | Jeff Erickson, Amir Nayyeri |
| 2011 | Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. | Jeff Erickson, Amir Nayyeri |
| 2011 | Shortest Non-Crossing Walks in the Plane. | Jeff Erickson, Amir Nayyeri |
| 2011 | Approximating the Statistics of various Properties in Randomly Weighted Graphs. | Yuval Emek, Amos Korman, Yuval Shavitt |
| 2011 | Bin Packing via Discrepancy of Permutations. | Friedrich Eisenbrand, Dmtr Plvlgyi, Thomas Rothvo |
| 2011 | Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. | Jeff Edmonds, Sungjin Im, Benjamin Moseley |