| 2012 | Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers Dániel Marx, Peter Rossmanith |
| 2011 | A Faster Algorithm for Dominating Set Analyzed by the Potential Method. Yoichi Iwata |
| 2011 | Contracting Graphs to Paths and Trees. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
| 2011 | Finding Good Decompositions for Dynamic Programming on Dense Graphs. Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle |
| 2011 | Improved Parameterized Algorithms for above Average Constraint Satisfaction. Eun Jung Kim, Ryan Williams |
| 2011 | Increasing the Minimum Degree of a Graph by Contractions. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
| 2011 | Kernel Bounds for Path and Cycle Problems. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller |
| 2011 | New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree. Alexander Golovnev |
| 2011 | On Cutwidth Parameterized by Vertex Cover. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2011 | On Multiway Cut Parameterized above Lower Bounds. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. Bart M. P. Jansen, Stefan Kratsch |
| 2011 | On the Hardness of Losing Width. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2011 | Parameterized Complexity in Multiple-Interval Graphs: Domination. Minghui Jiang, Yong Zhang |
| 2011 | Parameterized Complexity of Firefighting Revisited. Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen |
| 2011 | Parameterized Maximum Path Coloring. Michael Lampis |
| 2011 | Planar Disjoint-Paths Completion. Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos |
| 2011 | Safe Approximation and Its Relation to Kernelization. Jiong Guo, Iyad A. Kanj, Stefan Kratsch |
| 2011 | Simpler Linear-Time Kernelization for Planar Dominating Set. Torben Hagerup |
| 2011 | Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. Peter Damaschke |
| 2011 | Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. Hajo Broersma, Petr A. Golovach, Viresh Patel |
| 2011 | Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. Robert Ganian |