| 2011 | A (5/3 + ε)-Approximation for Strip Packing. Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee |
| 2011 | A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
| 2011 | A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. Yakov Nekrich |
| 2011 | A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. Zhou Xu, Xiaofan Lai |
| 2011 | Adjacency-Preserving Spatial Treemaps. Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira |
| 2011 | Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings Frank Dehne, John Iacono, Jörg-Rüdiger Sack |
| 2011 | An O(n log n) Algorithm for a Load Balancing Problem on Paths. Nikhil R. Devanur, Uriel Feige |
| 2011 | Beyond Triangulation: Covering Polygons with Triangles. Tobias Christ |
| 2011 | Binary Identification Problems for Weighted Trees. Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
| 2011 | Closest Pair and the Post Office Problem for Stochastic Points. Pegah Kamousi, Timothy M. Chan, Subhash Suri |
| 2011 | Competitive Search in Symmetric Trees. David G. Kirkpatrick, Sandra Zilles |
| 2011 | Computing the Fréchet Distance between Folded Polygons. Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
| 2011 | Connecting a Set of Circles with Minimum Sum of Radii. Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides |
| 2011 | Consistent Labeling of Rotating Maps. Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter |
| 2011 | Constructing Orthogonal de Bruijn Sequences. Yaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena |
| 2011 | Convex Transversals. Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang |
| 2011 | Counting Plane Graphs: Flippability and Its Applications. Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl |
| 2011 | Density-Constrained Graph Clustering. Robert Görke, Andrea Schumm, Dorothea Wagner |
| 2011 | Enumerating Minimal Subset Feedback Vertex Sets. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2011 | Faster Algorithms for Minimum-Link Paths with Restricted Orientations. Valentin Polishchuk, Mikko Sysikaski |
| 2011 | Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young |
| 2011 | Feedback Vertex Set in Mixed Graphs. Paul S. Bonsma, Daniel Lokshtanov |
| 2011 | Finding Longest Approximate Periodic Patterns. Beat Gfeller |
| 2011 | Flattening Fixed-Angle Chains Is Strongly NP-Hard. Erik D. Demaine, Sarah Eisenstat |
| 2011 | Flow Computations on Imprecise Terrains. Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira |
| 2011 | Frequency Capping in Online Advertising. Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor |
| 2011 | Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. Christof Doll, Tanja Hartmann, Dorothea Wagner |
| 2011 | Geometric Computations on Indecisive Points. Allan Jørgensen, Maarten Löffler, Jeff M. Phillips |
| 2011 | Horoball Hulls and Extents in Positive Definite Space. P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian |
| 2011 | How to Cover a Point Set with a V-Shape of Minimum Width. Boris Aronov, Muriel Dulieu |
| 2011 | Improved Distance Queries in Planar Graphs. Yahav Nussbaum |
| 2011 | Inducing the LCP-Array. Johannes Fischer |
| 2011 | Lossless Fault-Tolerant Data Structures with Additive Overhead. Paul F. Christiano, Erik D. Demaine, Shaunak Kishore |
| 2011 | Multi-target Ray Searching Problems. Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou |
| 2011 | Multicut in Trees Viewed through the Eyes of Vertex Cover. Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang |
| 2011 | Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. Philip N. Klein, Shay Mozes |
| 2011 | New Algorithms for 1-D Facility Location and Path Equipartition Problems. Danny Z. Chen, Haitao Wang |
| 2011 | On Rectilinear Partitions with Minimum Stabbing Number. Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele |
| 2011 | On the Area Requirements of Euclidean Minimum Spanning Trees. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella |
| 2011 | On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. Michael L. Fredman |
| 2011 | Orthogonal Cartograms with Few Corners Per Face. Therese Biedl, Lesvia Elena Ruiz Velázquez |
| 2011 | PTAS for Densest k-Subgraph in Interval Graphs. Tim Nonner |
| 2011 | Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. Peter Damaschke, Leonid Molokov |
| 2011 | Path Minima Queries in Dynamic Weighted Trees. Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao |
| 2011 | Piecewise-Linear Approximations of Uncertain Functions. Mohammad Ali Abam, Mark de Berg, Amirali Khosravi |
| 2011 | Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. János Pach, Gábor Tardos |
| 2011 | Planar Subgraphs without Low-Degree Nodes. Evangelos Kranakis, Oscar Morales-Ponce, Jukka Suomela |
| 2011 | Register Loading via Linear Programming. Gruia Calinescu, Minming Li |
| 2011 | Resilient and Low Stretch Routing through Embedding into Tree Metrics. Jie Gao, Dengpan Zhou |
| 2011 | Reversing Longest Previous Factor Tables is Hard. Jing He, Hongyu Liang, Guang Yang |
| 2011 | Searching in Dynamic Tree-Like Partial Orders. Brent Heeringa, Marius Catalin Iordan, Louis Theran |
| 2011 | Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
| 2011 | Space Efficient Data Structures for Dynamic Orthogonal Range Counting. Meng He, J. Ian Munro |
| 2011 | Streaming Algorithms for 2-Coloring Uniform Hypergraphs. Jaikumar Radhakrishnan, Saswata Shannigrahi |
| 2011 | Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. Timothy M. Chan, Vinayak Pathak |
| 2011 | Succinct 2D Dictionary Matching with No Slowdown. Shoshana Neuburger, Dina Sokol |
| 2011 | Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari |
| 2011 | The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. Shay Solomon |
| 2011 | Theory vs. Practice in the Design and Analysis of Algorithms. Robert Endre Tarjan |
| 2011 | Tracking Moving Objects with Few Handovers. David Eppstein, Michael T. Goodrich, Maarten Löffler |
| 2011 | Upper Bounds for Maximally Greedy Binary Search Trees. Kyle Fox |
| 2011 | Witness Rectangle Graphs. Boris Aronov, Muriel Dulieu, Ferran Hurtado |