- Regant Y. S. Hung, Hing-Fung Ting. Design and Analysis of Online Batching Systems. Algorithmica, 57(2):217-231, 2010.
- Takeshi Tokuyama. Foreword. Algorithmica, 56(1):1-2, 2010.
- Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi. Computing median and antimedian sets in median graphs. Algorithmica, 57(2):207-216, 2010.
- Annamária Kovács. New Approximation Bounds for Lpt Scheduling. Algorithmica, 57(2):413-433, 2010.
- Henrik Blunck, Jan Vahrenhold. In-Place Algorithms for Computing (Layers of) Maxima. Algorithmica, 57(1):1-21, 2010.
- Feodor F. Dragan, Chenyu Yan. Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica, 57(1):22-43, 2010.
- Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica, 57(1):44-61, 2010.
- Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. A Constant-Competitive Algorithm for Online OVSF Code Assignment. Algorithmica, 56(1):89-104, 2010.
- Xiaodong Hu, Jie Wang. Recent Advances in Computation and Combinatorial Optimization. Algorithmica, 56(3):281-282, 2010.
- Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica, 56(4):383-393, 2010.