| 2011 | A $\frac{3}{2}$ Approximation for a Constrained Forest Problem. Basile Couëtoux |
| 2011 | A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane. Danny Z. Chen, Haitao Wang |
| 2011 | AdCell: Ad Allocation in Cellular Networks. Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha |
| 2011 | Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings Camil Demetrescu, Magnús M. Halldórsson |
| 2011 | Algorithms for Finding a Maximum Non-k-linked Graph. Yusuke Kobayashi, Yuichi Yoshida |
| 2011 | Algorithms for Solving Rubik's Cubes. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow |
| 2011 | Alphabet-Independent Compressed Text Indexing. Djamal Belazzougui, Gonzalo Navarro |
| 2011 | An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Andreas Emil Feldmann, Peter Widmayer |
| 2011 | An Experimental Study on Approximating K Shortest Simple Paths. Asaf Frieder, Liam Roditty |
| 2011 | An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee |
| 2011 | Approximate Counting of Cycles in Streams. Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun |
| 2011 | Approximate Distance Queries for Weighted Polyhedral Surfaces. Hristo N. Djidjev, Christian Sommer |
| 2011 | Approximating Minimum Manhattan Networks in Higher Dimensions. Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff |
| 2011 | Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. Loukas Georgiadis |
| 2011 | Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. Andreas S. Schulz, Claudio Telha |
| 2011 | Approximation Algorithms for Conflict-Free Vehicle Routing. Kaspar Schüpbach, Rico Zenklusen |
| 2011 | Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. Marek Chrobak, Lukasz Jez, Jirí Sgall |
| 2011 | Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis |
| 2011 | Bounds on Greedy Algorithms for MAX SAT. Matthias Poloczek |
| 2011 | Can Nearest Neighbor Searching Be Simple and Always Fast? Victor Alvarez, David G. Kirkpatrick, Raimund Seidel |
| 2011 | Cover-Decomposition and Polychromatic Numbers. Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott |
| 2011 | Cuckoo Hashing with Pages. Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
| 2011 | Deterministic Discrepancy Minimization. Nikhil Bansal, Joel Spencer |
| 2011 | Distribution-Aware Compressed Full-Text Indexes. Paolo Ferragina, Jouni Sirén, Rossano Venturini |
| 2011 | Engineering Multilevel Graph Partitioning Algorithms. Peter Sanders, Christian Schulz |
| 2011 | Exact Algorithm for the Maximum Induced Planar Subgraph Problem. Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2011 | External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. Michael T. Goodrich, Pawel Pszona |
| 2011 | Fast Sub-exponential Algorithms and Compactness in Planar Graphs. Dimitrios M. Thilikos |
| 2011 | Hitting Sets Online and Vertex Ranking. Guy Even, Shakhar Smorodinsky |
| 2011 | Hitting and Harvesting Pumpkins. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
| 2011 | How Profitable Are Strategic Behaviors in a Market? Ning Chen, Xiaotie Deng, Jie Zhang |
| 2011 | Improved Algorithms for Partial Curve Matching. Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
| 2011 | Improved Approximation Algorithms for Bipartite Correlation Clustering. Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen |
| 2011 | Improved Approximations for k-Exchange Systems - (Extended Abstract). Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward |
| 2011 | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga |
| 2011 | Isomorphism of (mis)Labeled Graphs. Pascal Schweitzer |
| 2011 | Maximum Flows by Incremental Breadth-First Search. Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2011 | Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. Jakub Lacki, Piotr Sankowski |
| 2011 | Mixed-Criticality Scheduling of Sporadic Task Systems. Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie |
| 2011 | Motion Planning via Manifold Samples. Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin |
| 2011 | Multi-parameter Mechanism Design under Budget and Matroid Constraints. Monika Henzinger, Angelina Vidali |
| 2011 | Near-Popular Matchings in the Roommates Problem. Chien-Chung Huang, Telikepalli Kavitha |
| 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 Vondrák |
| 2011 | On the Approximation Performance of Fictitious Play in Finite Games. Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre |
| 2011 | On the Configuration-LP for Scheduling on Unrelated Machines. José Verschae, Andreas Wiese |
| 2011 | One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. Lukasz Jez |
| 2011 | Optimal Discovery Strategies in White Space Networks. Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda |
| 2011 | Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. Rui A. Ferreira, Roberto Grossi, Romeo Rizzi |
| 2011 | Passenger Flow-Oriented Train Disposition. Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee |
| 2011 | Paths, Flowers and Vertex Cover. Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. Pawel Gawrychowski |
| 2011 | Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. Akiyoshi Shioura |
| 2011 | Preprocess, Set, Query! Ely Porat, Liam Roditty |
| 2011 | Quantified Linear Programs: A Computational Study. Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf |
| 2011 | Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir |
| 2011 | Recoverable Robustness by Column Generation. Paul C. Bouman, J. M. van den Akker, J. A. Hoogeveen |
| 2011 | Resource Allocation for Covering Time Varying Demands. Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal |
| 2011 | Robust Algorithms for Preemptive Scheduling. Leah Epstein, Asaf Levin |
| 2011 | Scheduling Partially Ordered Jobs Faster Than 2 n. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | Scope-Based Route Planning. Petr Hlinený, Ondrej Moris |
| 2011 | Smoothed Performance Guarantees for Local Search. Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld |
| 2011 | Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa |
| 2011 | Submodular Max-SAT. Yossi Azar, Iftah Gamzu, Ran Roth |
| 2011 | The Hospitals/Residents Problem with Quota Lower Bounds. Koki Hamada, Kazuo Iwama, Shuichi Miyazaki |
| 2011 | The Union of Probabilistic Boxes: Maintaining the Volume. Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri |
| 2011 | Tolerant Algorithms. Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff |
| 2011 | Two-Bounded-Space Bin Packing Revisited. Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger |