| 2011 | Multi-parameter Mechanism Design under Budget and Matroid Constraints. | Monika Henzinger, Angelina Vidali |
| 2011 | The Hospitals/Residents Problem with Quota Lower Bounds. | Koki Hamada, Kazuo Iwama, Shuichi Miyazaki |
| 2011 | External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. | Michael T. Goodrich, Pawel Pszona |
| 2011 | On the Approximation Performance of Fictitious Play in Finite Games. | Paul W. Goldberg, Rahul Savani, Troels Bjerre Srensen, Carmine Ventre |
| 2011 | Maximum Flows by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2011 | On Isolating Points Using Disks. | Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan |
| 2011 | On Variants of the Matroid Secretary Problem. | Shayan Oveis Gharan, Jan Vondrk |
| 2011 | Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. | Loukas Georgiadis |
| 2011 | Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. | Pawel Gawrychowski |
| 2011 | An Experimental Study on Approximating K Shortest Simple Paths. | Asaf Frieder, Liam Roditty |
| 2011 | Exact Algorithm for the Maximum Induced Planar Subgraph Problem. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2011 | Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. | Rui A. Ferreira, Roberto Grossi, Romeo Rizzi |
| 2011 | Distribution-Aware Compressed Full-Text Indexes. | Paolo Ferragina, Jouni Sirn, Rossano Venturini |
| 2011 | An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. | Andreas Emil Feldmann, Peter Widmayer |
| 2011 | Improved Approximations for k-Exchange Systems - (Extended Abstract). | Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward |
| 2011 | Hitting Sets Online and Vertex Ranking. | Guy Even, Shakhar Smorodinsky |
| 2011 | Robust Algorithms for Preemptive Scheduling. | Leah Epstein, Asaf Levin |
| 2011 | Quantified Linear Programs: A Computational Study. | Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf |
| 2011 | Approximate Distance Queries for Weighted Polyhedral Surfaces. | Hristo N. Djidjev, Christian Sommer |
| 2011 | Cuckoo Hashing with Pages. | Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
| 2011 | Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. | Josep Daz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa |
| 2011 | Algorithms for Solving Rubik's Cubes. | Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow |
| 2011 | Approximating Minimum Manhattan Networks in Higher Dimensions. | Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff |
| 2011 | Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. | Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis |
| 2011 | Scheduling Partially Ordered Jobs Faster Than 2 n. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |