| 2012 | Online Sum-Radii Clustering. | Dimitris Fotakis, Paraschos Koutris |
| 2012 | A Characterization of Bispecial Sturmian Words. | Gabriele Fici |
| 2012 | Fast Balanced Partitioning Is Hard Even on Grids and Trees. | Andreas Emil Feldmann |
| 2012 | On the Impact of Fair Best Response Dynamics. | Angelo Fanelli, Luca Moscardelli, Alexander Skopalik |
| 2012 | Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. | Martin Doucha, Jan Kratochvl |
| 2012 | Finite State Transducers for Modular Mbius Number Systems. | Martin Delacourt, Petr Kurka |
| 2012 | Sitting Closer to Friends Than Enemies, Revisited. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2012 | Parameterized Study of the Test Cover Problem. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo |
| 2012 | Zero-Knowledge Proofs via Polynomial Representations. | Giovanni Di Crescenzo, Vadym Fedyukovych |
| 2012 | In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. | Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
| 2012 | Model Checking Stochastic Branching Processes. | Taolue Chen, Klaus Drger, Stefan Kiefer |
| 2012 | Pancake Flipping Is Hard. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 2012 | Computing with Large Populations Using Interactions. | Olivier Bournez, Pierre Fraigniaud, Xavier Koegler |
| 2012 | The Complexity of Rerouting Shortest Paths. | Paul S. Bonsma |
| 2012 | Smoothed Complexity Theory. | Markus Blser, Bodo Manthey |
| 2012 | Abelian Pattern Avoidance in Partial Words. | Francine Blanchet-Sadri, Sean Simmons |
| 2012 | New Advances in Reoptimizing the Minimum Steiner Tree Problem. | Davide Bil, Anna Zych |
| 2012 | Drawing Planar Graphs on Points Inside a Polygon. | Therese Biedl, Peter Floderus |
| 2012 | Solving Counter Parity Games. | Dietmar Berwanger, Lukasz Kaiser, Simon Leenich |
| 2012 | Mortality for 22 Matrices Is NP-Hard. | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
| 2012 | The Lower Reaches of Circuit Uniformity. | Christoph Behle, Andreas Krebs, Klaus-Jrn Lange, Pierre McKenzie |
| 2012 | The Robust Set Problem: Parameterized Complexity and Approximation. | Cristina Bazgan, Morgan Chopin |
| 2012 | Generating Functions of Timed Languages. | Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin |
| 2012 | Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
| 2012 | Approximate Graph Isomorphism. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Yadu Vasudev |