| 2012 | Hierarchical Hub Labelings for Shortest Paths. | Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2012 | Preemptive Coordination Mechanisms for Unrelated Machines. | Fidaa Abed, Chien-Chung Huang |
| 2011 | The Union of Probabilistic Boxes: Maintaining the Volume. | Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri |
| 2011 | On the Configuration-LP for Scheduling on Unrelated Machines. | Jos Verschae, Andreas Wiese |
| 2011 | Fast Sub-exponential Algorithms and Compactness in Planar Graphs. | Dimitrios M. Thilikos |
| 2011 | Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. | Akiyoshi Shioura |
| 2011 | Isomorphism of (mis)Labeled Graphs. | Pascal Schweitzer |
| 2011 | Approximation Algorithms for Conflict-Free Vehicle Routing. | Kaspar Schpbach, Rico Zenklusen |
| 2011 | Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. | Andreas S. Schulz, Claudio Telha |
| 2011 | Engineering Multilevel Graph Partitioning Algorithms. | Peter Sanders, Christian Schulz |
| 2011 | Motion Planning via Manifold Samples. | Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin |
| 2011 | Paths, Flowers and Vertex Cover. | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | Preprocess, Set, Query! | Ely Porat, Liam Roditty |
| 2011 | Bounds on Greedy Algorithms for MAX SAT. | Matthias Poloczek |
| 2011 | Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. | Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir |
| 2011 | Approximate Counting of Cycles in Streams. | Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun |
| 2011 | Improved Algorithms for Partial Curve Matching. | Anil Maheshwari, Jrg-Rdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
| 2011 | An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. | Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee |
| 2011 | Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. | Jakub Lacki, Piotr Sankowski |
| 2011 | Algorithms for Finding a Maximum Non-k-linked Graph. | Yusuke Kobayashi, Yuichi Yoshida |
| 2011 | Tolerant Algorithms. | Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff |
| 2011 | Hitting and Harvesting Pumpkins. | Gwenal Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stphan Thomass |
| 2011 | One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. | Lukasz Jez |
| 2011 | Near-Popular Matchings in the Roommates Problem. | Chien-Chung Huang, Telikepalli Kavitha |
| 2011 | Scope-Based Route Planning. | Petr Hlinen, Ondrej Moris |