| 2012 | Succinct Data Structures for Path Queries. | Meng He, J. Ian Munro, Gelin Zhou |
| 2012 | Improved Implementation of Point Location in General Two-Dimensional Subdivisions. | Michael Hemmer, Michal Kleinbort, Dan Halperin |
| 2012 | Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. | Frank Hellweg, Christian Sohler |
| 2012 | Approximation of Minimum Cost Homomorphisms. | Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey |
| 2012 | Resource Buying Games. | Tobias Harks, Britta Peis |
| 2012 | Maximum Multicommodity Flows over Time without Intermediate Storage. | Martin Gro, Martin Skutella |
| 2012 | Approximating Earliest Arrival Flows in Arbitrary Networks. | Martin Gro, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt |
| 2012 | On Min-Power Steiner Tree. | Fabrizio Grandoni |
| 2012 | Induced Disjoint Paths in Claw-Free Graphs. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2012 | Optimizing over the Growing Spectrahedron. | Joachim Giesen, Martin Jaggi, Sren Laue |
| 2012 | An Experimental Study of Dynamic Dominators. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni |
| 2012 | Knowledge, Level of Symmetry, and Time of Leader Election. | Emanuele G. Fusco, Andrzej Pelc |
| 2012 | A Polynomial Kernel for Proper Interval Vertex Deletion. | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
| 2012 | Lines through Segments in 3D Space. | Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin |
| 2012 | Faster Geometric Algorithms via Dynamic Determinant Computation. | Vissarion Fisikopoulos, Luis Mariano Pearanda |
| 2012 | Embedding Paths into Trees: VM Placement to Minimize Congestion. | Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde |
| 2012 | On the Complexity of Metric Dimension. | Josep Daz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen |
| 2012 | Better Bounds for Graph Bisection. | Daniel Delling, Renato Fonseca F. Werneck |
| 2012 | A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems. | James M. Davis, David P. Williamson |
| 2012 | Steiner Forest Orientation Problems. | Marek Cygan, Guy Kortsarz, Zeev Nutov |
| 2012 | A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski |
| 2012 | TSP Tours in Cubic Graphs: Beyond 4/3. | Jos R. Correa, Omar Larr, Jos A. Soto |
| 2012 | The Quantum Query Complexity of Read-Many Formulas. | Andrew M. Childs, Shelby Kimmel, Robin Kothari |
| 2012 | Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. | Shiri Chechik |
| 2012 | Data Structures on Event Graphs. | Bernard Chazelle, Wolfgang Mulzer |