| 2 | -- | 0 | . Pawel Przybylowicz wins the 2012 Information-Based Complexity Young Researcher Award |
| 4 | -- | 26 | Leslaw Gajek, Wojciech Niemiro, Piotr Pokarowski. Optimal Monte Carlo integration with fixed relative precision |
| 27 | -- | 43 | Chao-Wen Huang, Chia-Wei Lee, Huang-Ming Gao, Sun-Yuan Hsieh. The internal Steiner tree problem: Hardness and approximations |
| 44 | -- | 52 | Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann. Efficient algorithms for the longest common subsequence problem with sequential substring constraints |
| 53 | -- | 75 | Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer. On the complexity of solving quadratic Boolean systems |
| 76 | -- | 91 | Markus Hegland, Grzegorz W. Wasilkowski. On tractability of approximation in special function spaces |
| 92 | -- | 138 | Joos Heintz, Bart Kuijpers, Andres Rojas Paredes. Software Engineering and complexity in effective Algebraic Geometry |
| 139 | -- | 0 | Grzegorz W. Wasilkowski. Erratum to "Liberating the dimension for L2-approximation" [Journal of Complexity 28 (2012) 304-319] |