| 2012 | Leveling the Grid. | Sabine Cornelsen, Andreas Karrenbauer, Shujun Li |
| 2012 | Solving the Minimum String Cover Problem. | Stefan Canzar, Tobias Marschall, Sven Rahmann, Chris Schwiegelshohn |
| 2012 | Clique Cover on Sparse Networks. | Mathieu Blanchette, Ethan Kim, Adrian Vetta |
| 2011 | The Johnson-Lindenstrauss Transform: An Empirical Study. | Suresh Venkatasubramanian, Qiushi Wang |
| 2011 | Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. | Isabelle Stanton, Ali Pinar |
| 2011 | Exact Pattern Matching with Feed-Forward Bloom Filters. | Iulian Moraru, David G. Andersen |
| 2011 | Fast and Lightweight LCP-Array Construction Algorithms. | Simon Gog, Enno Ohlebusch |
| 2011 | 1D Vehicle Scheduling with Conflicts. | Torsten J. Gellert, Felix G. Knig |
| 2011 | Algorithms for Matching and Predicting Trajectories. | Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt |
| 2011 | Dependent Randomized Rounding: The Bipartite Case. | Benjamin Doerr, Marvin Knnemann, Magnus Wahlstrm |
| 2011 | Avoiding Communication in Numerical Linear Algebra. | James Demmel |
| 2011 | A Closer Look at the Closest String and Closest Substring Problem. | Markus Chimani, Matthias Woste, Sebastian Bcker |
| 2011 | An SDP Approach to Multi-level Crossing Minimization. | Markus Chimani, Philipp Hungerlnder, Michael Jnger, Petra Mutzel |
| 2011 | Approximate Map Matching with respect to the Frchet Distance. | Daniel Chen, Anne Driemel, Leonidas J. Guibas, Andy Nguyen, Carola Wenk |
| 2011 | Simple and Efficient Distribution-Sensitive Point Location, in Triangulations. | Pedro Machado Manhes de Castro, Olivier Devillers |
| 2011 | Disjoint-Path Facility Location: Theory and Practice. | Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen |
| 2011 | A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. | Guy E. Blelloch, Julian Shun |
| 2011 | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. | Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff |
| 2011 | Engineering a Topological Sorting Algorithm for Massive Graphs. | Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh |
| 2010 | Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums. | Christophe Weibel |
| 2010 | Fast Local Search for Steiner Trees in Graphs. | Eduardo Uchoa, Renato Fonseca F. Werneck |
| 2010 | Tabulation Based 5-Universal Hashing and Linear Probing. | Mikkel Thorup, Yin Zhang |
| 2010 | Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example. | Peter Sanders |
| 2010 | Conjunctive Filter: Breaking the Entropy Barrier. | Daisuke Okanohara, Yuichi Yoshida |
| 2010 | Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks. | Dhia Mahjoub, David W. Matula |