| 637 | -- | 639 | Christoph Dürr, Thomas Wilke. Preface of STACS 2012 Special Issue |
| 640 | -- | 657 | Marcin Mucha. 13/9 -Approximation for Graphic TSP |
| 658 | -- | 684 | Benjamin Doerr, Carola Winzen. Playing Mastermind with Constant-Size Memory |
| 685 | -- | 718 | Artur Jez. The Complexity of Compressed Membership Problems for Finite Automata |
| 719 | -- | 741 | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson. Linear-Space Data Structures for Range Mode Query in Arrays |
| 742 | -- | 770 | Jürn Laun. Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P |
| 771 | -- | 832 | Christopher H. Broadbent. On First-Order Logic and CPDA Graphs |
| 833 | -- | 855 | André Arnold, Henryk Michalewski, Damian Niwinski. On the Separation Question for Tree Languages |
| 856 | -- | 880 | Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa. Model-Theoretic Properties of ω-Automatic Structures |