Important Dates

June 20, 2011, 17:00 GMT Abstract registration
June 23, 2011, 17:00 GMT Paper submission
July 15, 2011 Notification of acceptance
September 7-9, 2011 Symposium
October 20, 2011 Final manuscript due

Important Links

Accepted Papers

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk and Jakub Wojtaszczyk. On Multiway Cut parameterized above lower bounds
Isolde Adler, Stavros Kolliopoulos and Dimitrios Thilikos. Planar Disjoint-Paths Completion
Peter Damaschke. Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
Hans L. Bodlaender, Bart Jansen and Stefan Kratsch. Kernel Bounds for Path and Cycle Problems
Robert Ganian. Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Jiong Guo, Iyad Kanj and Stefan Kratsch. Safe approximation and its relation to kernelization
Pinar Heggernes, Pim Van 'T Hof, Benjamin Leveque, Daniel Lokshtanov and Christophe Paul. Contracting graphs to paths and trees
Bart Jansen and Stefan Kratsch. On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
Yong Zhang and Minghui Jiang. Parameterized Complexity in Multiple-Interval Graphs:Domination
Hajo Broersma, Petr Golovach and Viresh Patel. Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-width
Alexander Golovnev. New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
Petr Golovach, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos. Increasing the Minimum Degree of a Graph by Contractions
Marek Cygan, Fedor Fomin and Erik Jan Van Leeuwen. Parameterized Complexity of Firefighting Revisited
Michael Lampis. Parameterized Maximum Path Coloring
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk and Saket Saurabh. On cutwidth parameterized by vertex cover
Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle. Finding Good Decompositions for Dynamic Programming on Dense Graphs
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk and Saket Saurabh. On the hardness of loosing width
Sepp Hartung, René Van Bevern, Rolf Niedermeier, Mathias Weller and Frank Kammer. Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
Yoichi Iwata. A Faster Algorithm for Dominating Set Analyzed by the Potential Method
Torben Hagerup. Linear-Time Kernelization for Planar Dominating Set
Eun Jung Kim and Ryan Williams. Improved Parameterized Algorithms for Above Average Constraint Satisfaction