- Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada. Incremental Construction of Minimal Tree Automata. Algorithmica, 55(1):95-110, 2009.
- Hiroshi Nagamochi. A Detachment Algorithm for Inferring a Graph from Path Frequency. Algorithmica, 53(2):207-224, 2009.
- Miklos Santha, Mario Szegedy. Quantum and Classical Query Complexities of Local Search Are Polynomially Related. Algorithmica, 55(3):557-575, 2009.
- Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov. On Two Techniques of Combining Branching and Treewidth. Algorithmica, 54(2):181-207, 2009.
- Chandra Chekuri, Luca Trevisan. Foreword. Algorithmica, 55(1):111-112, 2009.
- Dorit Aharonov, Vaughan Jones, Zeph Landau. A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. Algorithmica, 55(3):395-421, 2009.
- Haim Kaplan, Natan Rubin, Micha Sharir. Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica, 55(2):283-310, 2009.
- Sashka Davis, Russell Impagliazzo. Models of Greedy Algorithms for Graph Problems. Algorithmica, 54(3):269-317, 2009.
- Frédéric Magniez, Ashwin Nayak. Foreword from the Guest Editors. Algorithmica, 55(3):393-394, 2009.
- Christopher Umans. Reconstructive Dispersers and Hitting Set Generators. Algorithmica, 55(1):134-156, 2009.