- Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica, 59(4):471-488, 2011.
- Zachary Friggstad, Mohammad R. Salavatipour. Approximability of Packing Disjoint Cycles. Algorithmica, 60(2):395-400, 2011.
- Lukasz Kowalik, Marcin Mucha. 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica, 59(2):240-255, 2011.
- Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy Spinrad, Jayme Luiz Szwarcfiter. Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica, 59(2):215-239, 2011.
- Anupam Gupta, Kunal Talwar. Making Doubling Metrics Geodesic. Algorithmica, 59(1):66-80, 2011.
- Dirk Sudholt. Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima. Algorithmica, 59(3):343-368, 2011.
- Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum ::::k::::-Way Cut Problem. Algorithmica, 59(4):510-520, 2011.
- Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani. Finding a Minimum-depth Embedding of a Planar Graph in ::::O::::(::::n:::::::4:::) Time. Algorithmica, 60(4):890-937, 2011.
- Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. Peeling Meshed Potatoes. Algorithmica, 60(2):349-367, 2011.
- Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle. Detecting Regular Visit Patterns. Algorithmica, 60(4):829-852, 2011.