Accepted Papers
1. Robert Crowston, Gregory Gutin, Mark Jones and Anders Yeo. A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Application
2. Frederic Havet and Leonardo Sampaio. On the Grundy number of a graph
3. Robert Ganian, Petr Hlineny, Joachim Kneis, Daniel Meister, Jan Obdrzalek, Peter Rossmanith and Somnath Sikdar. Are there any good digraph width measures?
4. Daniel Binkele-Raible and Henning Fernau. Enumerate & Measure: Improving Parameter Budget Management
5. Chris Calabro, Impagliazzo Russell and Ramamohan Paturi. On the Exact Complexity of Evaluating Quantified $k$-CNF
6. Thore Husfeldt and Nina Taslaman. The exponential time complexity of computing the probability that a graph is connected
7. Britta Dorn and Ildikó Schlotter. Multivariate Complexity Analysis of Swap Bribery
8. Katarína Cechlárová and Ildikó Schlotter. Computing the deficiency of housing markets with duplicate houses
9. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk and Jakub Wojtaszczyk. Improved FPT algorithm and quadratic kernel for Pathwidth One Vertex Deletion
10. Yixin Cao and Jianer Chen. Weighted Cluster Editing: Kernelization based on Edge-Cuts
11. Jesper Nederlof and Johan M. M. van Rooij. Inclusion/Exclusion Branching For Partial Dominating Set and Set Splitting
12. Nadja Betzler, Robert Bredereck and Rolf Niedermeier. Partial Kernelization for Rank Aggregation: Theory and Experiments
13. M. Praveen. Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
14. Yngve Villanger. Proper Interval Vertex Deletion
15. Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider and Anders Yeo. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
16. Sylvain Guillemot, Christophe Paul and Anthony Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems
17. Christian Hoffmann. Exponential Time Complexity of Weighted Counting of Independent Sets
18. Michael Fellows, Serge Gaspers and Frances Rosamond. Parameterizing by the Number of Numbers
19. M A Abhimanyu, B Radheshyam, Chintan Rao H, Venkata Koppula, Neeldhara Misra, Geevarghese Philip and Ramanujan M.S.. On the Kernelization Complexity of Colorful Motifs