| 2013 | Shift Finding in Sub-Linear Time. | Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh |
| 2013 | Morphing Planar Graph Drawings with a Polynomial Number of Steps. | Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson |
| 2013 | Reporting neighbors in high-dimensional Euclidean spaces. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2013 | Local-Search based Approximation Algorithms for Mobile Facility Location Problems. | Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy |
| 2013 | Distance Oracles for Stretch Less Than 2. | Rachit Agarwal, Philip Brighten Godfrey |
| 2013 | Computing the Discrete Frchet Distance in Subquadratic Time. | Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir |
| 2013 | Low-distortion Inference of Latent Similarities from a Multiplex Social Network. | Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins |
| 2012 | Matroidal degree-bounded minimum spanning trees. | Rico Zenklusen |
| 2012 | On a linear program for minimum-weight triangulation. | Arman Yousefi, Neal E. Young |
| 2012 | Approximate distance oracles with improved preprocessing time. | Christian Wulff-Nilsen |
| 2012 | A universally-truthful approximation scheme for multi-unit auctions. | Berthold Vcking |
| 2012 | The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. | Vijay V. Vazirani |
| 2012 | A near-linear algorithm for projective clustering integer points. | Kasturi R. Varadarajan, Xin Xiao |
| 2012 | Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. | Alistair Sinclair, Piyush Srivastava, Marc Thurley |
| 2012 | Algorithms for the transportation problem in geometric settings. | R. Sharathkumar, Pankaj K. Agarwal |
| 2012 | Concentration and moment inequalities for polynomials of independent random variables. | Warren Schudy, Maxim Sviridenko |
| 2012 | A proof of the Boyd-Carr conjecture. | Frans Schalekamp, David P. Williamson, Anke van Zuylen |
| 2012 | The entropy rounding method in approximation algorithms. | Thomas Rothvo |
| 2012 | Subquadratic time approximation algorithms for the girth. | Liam Roditty, Virginia Vassilevska Williams |
| 2012 | Approximating CSPs with global cardinality constraints using SDP hierarchies. | Prasad Raghavendra, Ning Tan |
| 2012 | Sublinear time, measurement-optimal, sparse recovery for all. | Ely Porat, Martin J. Strauss |
| 2012 | On the hardness of pricing loss-leaders. | Preyas Popat, Yi Wu |
| 2012 | Lower bounds for number-in-hand multiparty communication complexity, made easy. | Jeff M. Phillips, Elad Verbin, Qin Zhang |
| 2012 | A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. | Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld |
| 2012 | On multiplicative λ-approximations and some geometric applications. | Ilan Newman, Yuri Rabinovich |