| 2011 | Counting Plane Graphs: Flippability and Its Applications. | Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tth, Emo Welzl |
| 2011 | Space Efficient Data Structures for Dynamic Orthogonal Range Counting. | Meng He, J. Ian Munro |
| 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 | A (5/3 + ε)-Approximation for Strip Packing. | Rolf Harren, Klaus Jansen, Lars Prdel, Rob van Stee |
| 2011 | Density-Constrained Graph Clustering. | Robert Grke, Andrea Schumm, Dorothea Wagner |
| 2011 | Finding Longest Approximate Periodic Patterns. | Beat Gfeller |
| 2011 | Consistent Labeling of Rotating Maps. | Andreas Gemsa, Martin Nllenburg, Ignaz Rutter |
| 2011 | Resilient and Low Stretch Routing through Embedding into Tree Metrics. | Jie Gao, Dengpan Zhou |
| 2011 | On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. | Michael L. Fredman |
| 2011 | Upper Bounds for Maximally Greedy Binary Search Trees. | Kyle Fox |
| 2011 | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2011 | Horoball Hulls and Extents in Positive Definite Space. | P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian |
| 2011 | Inducing the LCP-Array. | Johannes Fischer |
| 2011 | Tracking Moving Objects with Few Handovers. | David Eppstein, Michael T. Goodrich, Maarten Lffler |
| 2011 | Flow Computations on Imprecise Terrains. | Anne Driemel, Herman J. Haverkort, Maarten Lffler, Rodrigo I. Silveira |
| 2011 | Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. | Christof Doll, Tanja Hartmann, Dorothea Wagner |
| 2011 | An O(n log n) Algorithm for a Load Balancing Problem on Paths. | Nikhil R. Devanur, Uriel Feige |
| 2011 | Flattening Fixed-Angle Chains Is Strongly NP-Hard. | Erik D. Demaine, Sarah Eisenstat |
| 2011 | Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. | Peter Damaschke, Leonid Molokov |
| 2011 | Computing the Frchet Distance between Folded Polygons. | Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
| 2011 | Binary Identification Problems for Weighted Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
| 2011 | Lossless Fault-Tolerant Data Structures with Additive Overhead. | Paul F. Christiano, Erik D. Demaine, Shaunak Kishore |
| 2011 | Beyond Triangulation: Covering Polygons with Triangles. | Tobias Christ |
| 2011 | New Algorithms for 1-D Facility Location and Path Equipartition Problems. | Danny Z. Chen, Haitao Wang |