| 2012 | A New Algorithm for Parameterized MAX-SAT. Ivan Bliznets, Alexander Golovnev |
| 2012 | A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. Cédric Bentz |
| 2012 | An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei |
| 2012 | An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem. Faisal N. Abu-Khzam, Mazen Bou Khuzam |
| 2012 | Computing Directed Pathwidth in O(1.89 n ) Time. Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano |
| 2012 | Enumerating Neighbour and Closest Strings. Naomi Nishimura, Narges Simjour |
| 2012 | Fast Monotone Summation over Disjoint Sets. Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
| 2012 | Finding Dense Subgraphs of Sparse Graphs. Christian Komusiewicz, Manuel Sorge |
| 2012 | Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. Marcin Pilipczuk, Michal Pilipczuk |
| 2012 | Homomorphic Hashing for Sparse Coefficient Extraction. Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2012 | Instance Compression for the Polynomial Hierarchy and beyond. Chiranjit Chakraborty, Rahul Santhanam |
| 2012 | MSOL Restricted Contractibility to Planar Graphs. James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil |
| 2012 | New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao |
| 2012 | Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging. Lukasz Kowalik |
| 2012 | On Tractable Parameterizations of Graph Isomorphism. Adam Bouland, Anuj Dawar, Eryk Kopczynski |
| 2012 | On the Space Complexity of Parameterized Problems. Michael Elberfeld, Christoph Stockhusen, Till Tantau |
| 2012 | Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Sepp Hartung, Christian Komusiewicz, André Nichterlein |
| 2012 | Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings Dimitrios M. Thilikos, Gerhard J. Woeginger |
| 2012 | Polynomial Time and Parameterized Approximation Algorithms for Boxicity. Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
| 2012 | Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk |
| 2012 | Randomized Techniques for Parameterized Algorithms. Dániel Marx |
| 2012 | Restricted and Swap Common Superstring: A Parameterized View. Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2012 | Some Definitorial Suggestions for Parameterized Proof Complexity. Jörg Flum, Moritz Müller |
| 2012 | The Exponential Time Hypothesis and the Parameterized Clique Problem. Yijia Chen, Kord Eickmeyer, Jörg Flum |
| 2012 | The Path Taken for k-Path. Andreas Björklund |
| 2012 | Weighted Counting of k-Matchings Is #W[1]-Hard. Markus Bläser, Radu Curticapean |