| 2011 | A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. | Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon |
| 2011 | Matroid Secretary Problem in the Random Assignment Model. | Jos A. Soto |
| 2011 | An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. | Shay Solomon |
| 2011 | Rumor Spreading and Vertex Expansion on Regular Graphs. | Thomas Sauerwald, Alexandre Stauffer |
| 2011 | New Approximation Algorithms for Minimum Enclosing Convex Shapes. | Ankan Saha, S. V. N. Vishwanathan, Xinhua Zhang |
| 2011 | Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. | Tim Roughgarden, Florian Schoppmann |
| 2011 | Collapse. | Gnter Rote, Uri Zwick |
| 2011 | Approximating the Girth. | Liam Roditty, Roei Tov |
| 2011 | Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. | Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang |
| 2011 | Reflections for quantum query algorithms. | Ben Reichardt |
| 2011 | Faster quantum algorithm for evaluating game trees. | Ben Reichardt |
| 2011 | Graph Coloring via The Probabilistic Method. | Bruce A. Reed |
| 2011 | Efficient Sketches for the Set Query Problem. | Eric Price |
| 2011 | Multicommodity Facility Location under Group Steiner Access Cost. | Laura J. Poplawski, Rajmohan Rajaraman |
| 2011 | Randomized Variants of Johnson's Algorithm for MAX SAT. | Matthias Poloczek, Georg Schnitger |
| 2011 | Mobile Geometric Graphs: Detection, Coverage and Percolation. | Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer |
| 2011 | Survivable Network Design Problems in Wireless Networks. | Debmalya Panigrahi |
| 2011 | On the Degree Distribution of Random Planar Graphs. | Konstantinos Panagiotou, Angelika Steger |
| 2011 | Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. | Lorenzo Orecchia, Nisheeth K. Vishnoi |
| 2011 | Coloring random graphs online without creating monochromatic subgraphs. | Torsten Mtze, Thomas Rast, Reto Sphel |
| 2011 | Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. | Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis |
| 2011 | An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. | George B. Mertzios |
| 2011 | Online Stochastic Matching: Online Actions Based on Offline Statistics. | Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi |
| 2011 | Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication. | Avner Magen, Anastasios Zouzias |
| 2011 | Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |