The program committee of IWPEC accepted 24 papers, out of 38 submitted papers. The average quality of the submitted papers was very high. Below, you can read the list of accepted papers.
Parameterized Complexity of Independence and Domination on Geometric Graphs, by Marx
The Parameterized Complexity of Maximality and Minimality Problems, by Chen, Flum
Fixed-Parameter Complexity of Minimum Profile Problems, by Gutin, Szeider, Yeo
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel, by Burrage, Estivill-Castro, Fellows, Langston, Mac, Rosamond
Parameterizing MAXSNP problems above Guaranteed Values, by Mahajan, Raman, Sikdar
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width, by Meer, Rautenbach
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs, by Kara, Kratochvil
Applying modular decomposition to parameterized bicluster editing, by Protti, Dantas da Silva, Szwarcfiter
Randomized approximations of parameterized counting problems, by Müller
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results, by Cai, Huang
An Exact Algorithm for the Minimum Dominating Clique Problem, by Kratsch, Liedloff
Finding a Minimum Feedback Vertex Set in time O(1.7548^n), by Fomin, Gaspers, Pyatkin
On Parameterized Approximability, by Chen, Grohe, Grueber
Parameterized Approximation Algorithms, by Downey, Fellows, McCartin
The Cluster Editing Problem: Implementations and Experiments, by Dehne, Langston, Luo, Pitre, Shaw, Zhang
On the Effeictive Enumerability of NP Problems, by Chen, Kanj, Meng, Xia, Zhang
The Parameterized Complexity of Enumerating Frequent Itemsets, by Hamilton, Chaytor, Wareham
Fixed-parameter tractability results for Full-Degree Spanning Tree and its dual, by Guo, Niedermeier, Wernicke
On the parameterized complexity of d-dimensional point set pattern matching, by Cabello, Giannopoulos, Knauer
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms, by Sloper, Telle
Kernels: Annotated, Proper and Induced, by Abu-Khzam, Fernau
Random Separation: A New Methodology for Solving Fixed-Cardinality Optimization Problems, by Cai, Chan, Chan
Edge Dominating Set: efficient enumeration-based exact algorithms, by Fernau
Greedy Localization, Color-Coding, and Dynamic programming: Improved Algorithms for Matching and Packing Problems, by Liu, Lu, Chen, Sze
