| 945 | -- | 947 | Ernst W. Mayr. Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015) |
| 948 | -- | 986 | Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities |
| 987 | -- | 1010 | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan. Minimum-Cost Flows in Unit-Capacity Networks |
| 1011 | -- | 1036 | Telikepalli Kavitha. New Pairwise Spanners |
| 1037 | -- | 1053 | Jakub Lacki, Piotr Sankowski. Optimal Decremental Connectivity in Planar Graphs |
| 1054 | -- | 1083 | Jacob Holm, Eva Rotenberg. Dynamic Planar Embeddings of Dynamic Graphs |
| 1084 | -- | 1127 | Pascal Schweitzer. Towards an Isomorphism Dichotomy for Hereditary Graph Classes |
| 1128 | -- | 1177 | Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. The Advice Complexity of a Class of Hard Online Problems |
| 1178 | -- | 1213 | Martin Delacourt, Benjamin Hellouin de Menibus. Characterisation of Limit Measures of Higher-Dimensional Cellular Automata |
| 1214 | -- | 1236 | Mathieu Hoyrup, Cristobal Rojas. On the Information Carried by Programs About the Objects they Compute |
| 1237 | -- | 1251 | Neeraj Kayal, Chandan Saha 0001. Multi-k-ic Depth Three Circuit Lower Bound |
| 1252 | -- | 1253 | Andrew Lewis-Pye, Wolfgang Merkle. Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015) |
| 1254 | -- | 1287 | Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan 0001, Dan Teng, Siyuan Zou. Semiautomatic Structures |
| 1288 | -- | 1314 | Ludwig Staiger. Exact Constructive and Computable Dimensions |
| 1315 | -- | 1336 | Bruno Bauwens, Alexander Shen, Hayato Takahashi. Conditional Probabilities and van Lambalgen's Theorem Revisited |
| 1337 | -- | 1352 | Tom F. Sterkenburg. A Generalized Characterization of Algorithmic Probability |
| 1353 | -- | 1375 | Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise Computability and Image Randomness |
| 1376 | -- | 1426 | Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer. On the Uniform Computational Content of Computability Theory |
| 1427 | -- | 1439 | Bjørn Kjos-Hanssen. On the Complexity of Automatic Complexity |
| 1440 | -- | 1450 | Nikolai K. Vereshchagin. Short lists with short programs from programs of functions and strings |