| 2013 | Parameterized Complexity of 1-Planarity. | Michael J. Bannister, Sergio Cabello, David Eppstein |
| 2013 | Socially Stable Matchings in the Hospitals/Residents Problem. | Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove, Emmanouil Pountourakis |
| 2013 | Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. | Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sbastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Gnter Rote, Torsten Ueckerdt |
| 2013 | Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. | Tetsuo Asano, David G. Kirkpatrick |
| 2013 | Distance-Sensitive Planar Point Location. | Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann |
| 2013 | On (Dynamic) Range Minimum Queries in External Memory. | Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava |
| 2013 | Smart-Grid Electricity Allocation via Strip Packing with Slicing. | Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak |
| 2013 | Bundling Three Convex Polygons to Minimize Area or Perimeter. | Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park |
| 2013 | On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects. | Mahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette |
| 2011 | A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. | Zhou Xu, Xiaofan Lai |
| 2011 | Theory vs. Practice in the Design and Analysis of Algorithms. | Robert Endre Tarjan |
| 2011 | The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. | Shay Solomon |
| 2011 | Streaming Algorithms for 2-Coloring Uniform Hypergraphs. | Jaikumar Radhakrishnan, Saswata Shannigrahi |
| 2011 | Faster Algorithms for Minimum-Link Paths with Restricted Orientations. | Valentin Polishchuk, Mikko Sysikaski |
| 2011 | Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. | Jnos Pach, Gbor Tardos |
| 2011 | Improved Distance Queries in Planar Graphs. | Yahav Nussbaum |
| 2011 | PTAS for Densest k-Subgraph in Interval Graphs. | Tim Nonner |
| 2011 | Succinct 2D Dictionary Matching with No Slowdown. | Shoshana Neuburger, Dina Sokol |
| 2011 | A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. | Yakov Nekrich |
| 2011 | Constructing Orthogonal de Bruijn Sequences. | Yaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena |
| 2011 | Planar Subgraphs without Low-Degree Nodes. | Evangelos Kranakis, Oscar Morales-Ponce, Jukka Suomela |
| 2011 | Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. | Philip N. Klein, Shay Mozes |
| 2011 | Competitive Search in Symmetric Trees. | David G. Kirkpatrick, Sandra Zilles |
| 2011 | Closest Pair and the Post Office Problem for Stochastic Points. | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
| 2011 | Geometric Computations on Indecisive Points. | Allan Jrgensen, Maarten Lffler, Jeff M. Phillips |