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



10:20On Multiway Cut parameterized above lower bounds
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk and Jakub Wojtaszczyk
10:45Parameterized Complexity of Firefighting Revisited
Marek Cygan, Fedor Fomin, and Erik Jan Van Leeuwen
11:10Parameterized Complexity in Multiple-Interval Graphs:Domination
Yong Zhang and Minghui Jiang
11:35A Faster Algorithm for Dominating Set Analyzed by the Potential Method
Yoichi Iwata
13:30Contracting graphs to paths and trees
Pinar Heggernes, Pim Van 'T Hof, Benjamin Leveque, Daniel Lokshtanov and Christophe Paul
13:55Increasing the Minimum Degree of a Graph by Contractions
Petr Golovach, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos
14:20Planar Disjoint-Paths Completion
Isolde Adler, Stavros Kolliopoulos and Dimitrios Thilikos
14:45Coffee Break
15:05Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
Peter Damaschke
15:30New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
Alexander Golovnev
15:55Improved Parameterized Algorithms for Above Average Constraint Satisfaction
Eun Jung Kim and Ryan Williams


9:00Excluding Topological Subgraphs (IPEC Invited Talk)
Martin Grohe
10:20Tutorial on Kernels
Hans L. Bodlaender
11:10On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
Bart Jansen and Stefan Kratsch
11:35Kernel Bounds for Path and Cycle Problems
Hans L. Bodlaender, Bart Jansen and Stefan Kratsch
13:30ATMOS Invited Talk
14:30Coffee break
14:50On the hardness of losing width
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh
15:15Safe approximation and its relation to kernelization
Jiong Guo, Iyad Kanj and Stefan Kratsch
15:40Simpler Linear-Time Kernelization for Planar Dominating Set
Torben Hagerup
16:05Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
Sepp Hartung, René Van Bevern, Rolf Niedermeier, Mathias Weller, and Frank Kammer
16:50Business meeting


10:20Tutorial on Width Measures
Fedor Fomin
11:10Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-width
Hajo Broersma, Petr Golovach and Viresh Patel
11:35Finding Good Decompositions for Dynamic Programming on Dense Graphs
Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, and Martin Vatshelle
13:30Algosensors Invited Talk
14:30Coffee break
14:50Parameterized Maximum Path Coloring
Michael Lampis
15:15On cutwidth parameterized by vertex cover
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk and Saket Saurabh
15:40Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Robert Ganian