| 2012 | Rumor spreading and vertex expansion. | George Giakkoupis, Thomas Sauerwald |
| 2012 | Black-box reductions for cost-sharing mechanism design. | Konstantinos Georgiou, Chaitanya Swamy |
| 2012 | Improved output-sensitive quantum algorithms for Boolean matrix multiplication. | Franois Le Gall |
| 2012 | Networks cannot compute their diameter in sublinear time. | Silvio Frischknecht, Stephan Holzer, Roger Wattenhofer |
| 2012 | Ultra-fast rumor spreading in social networks. | Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald |
| 2012 | Subexponential parameterized algorithm for minimum fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2012 | Linear kernels for (connected) dominating set on | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2012 | Bidimensionality and geometric graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2012 | A matroid approach to stable matchings with lower quotas. | Tams Fleiner, Naoyuki Kamiyama |
| 2012 | Beyond myopic best response (in Cournot competition). | Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky |
| 2012 | Data reduction for weighted and outlier-resistant clustering. | Dan Feldman, Leonard J. Schulman |
| 2012 | Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer |
| 2012 | Global minimum cuts in surface embedded graphs. | Jeff Erickson, Kyle Fox, Amir Nayyeri |
| 2012 | An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. | David Eisenstat, Philip N. Klein, Claire Mathieu |
| 2012 | A simple algorithm for random colouring | Charilaos Efthymiou |
| 2012 | Packing anchored rectangles. | Adrian Dumitrescu, Csaba D. Tth |
| 2012 | A scaling algorithm for maximum weight matching in bipartite graphs. | Ran Duan, Hsin-Hao Su |
| 2012 | The maximum degree of random planar graphs. | Michael Drmota, Omer Gimnez, Marc Noy, Konstantinos Panagiotou, Angelika Steger |
| 2012 | Jaywalking your dog: computing the Frchet distance with shortcuts. | Anne Driemel, Sariel Har-Peled |
| 2012 | Gathering despite mischief. | Yoann Dieudonn, Andrzej Pelc, David Peleg |
| 2012 | Approximating fixation probabilities in the generalized Moran process. | Josep Daz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
| 2012 | Kernelization of packing problems. | Holger Dell, Dniel Marx |
| 2012 | The MAX-CUT of sparse random graphs. | Herv Daud, Conrado Martnez, Vonjy Rasendrahasina, Vlady Ravelomanana |
| 2012 | Learning | Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio |
| 2012 | Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. | Daniel Dadush, Santosh S. Vempala |