| 1 | | David Pisinger |
| | Linear Time Algorithms for Knapsack Problems with Bounded Weights |
| | Journal of Algorithms, Volume 33, Issue 1, October 1999, Pages 1-14 |
| 2 | | Andrew V Goldberg |
| | An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm |
| | Journal of Algorithms, Volume 22, Issue 1, January 1997, Pages 1-29 |
| 3 | | Michel X. Goemans | Martin Skutella |
| | Cooperative facility location games |
| | Journal of Algorithms, Volume 50, Issue 2, February 2004, Pages 194-214 |
| 4 | | Tomás Feder | Rajeev Motwani | Liadan O'Callaghan | Chris Olston | Rina Panigrahy |
| | Computing shortest paths with uncertainty |
| | Journal of Algorithms, Volume 62, Issue 1, January 2007, Pages 1-18 |
| 5 | | Esther M. Arkin | Refael Hassin | Asaf Levin |
| | Approximations for minimum and min-max vehicle routing problems |
| | Journal of Algorithms, Volume 59, Issue 1, April 2006, Pages 1-18 |
| 6 | | Martijn van Otterlo |
| | Intensional dynamic programming. A Rosetta stone for structured dynamic programming |
| | Journal of Algorithms, Volume 64, Issue 4, October 2009, Pages 169-191 |
| 7 | | Graham Cormode | S. Muthukrishnan |
| | An improved data stream summary: the count-min sketch and its applications |
| | Journal of Algorithms, Volume 55, Issue 1, April 2005, Pages 58-75 |
| 8 | | Yijie Han |
| | Deterministic sorting in O(nloglogn) time and linear space |
| | Journal of Algorithms, Volume 50, Issue 1, January 2004, Pages 96-105 |
| 9 | | Igor E. Zverovich |
| | A new kind of graph coloring |
| | Journal of Algorithms, Volume 58, Issue 2, February 2006, Pages 118-133 |
| 10 | | |
| | Editorial Board |
| | Journal of Algorithms, Volume 64, Issue 4, October 2009, Pages IFC- |
