Conference Location: ECS (Engineering Computer Science) 125, University of Victoria.

Wednesday, May 14, 2008

4:00 pm - 7:00 pm Registration

Thursday, May 15, 2008

8:00 am - 9:00 am Breakfast & Registration

9:00 am - 9:50 am Invited Talk
Algorithmic Meta-Theorems (Stephan Kreutzer)

9:50 am - 10:20 am Coffee Break

10:20 am - 10:45 am
The Time Complexity of Constraint Satisfaction (Patrick Traxler)

10:45 am - 11:10 am
A tighter bound for counting max-weight solutions to 2SAT instances (Magnus Wahlstr"om)

11:10 am - 11:35 am
Some fixed-parameter tractable classes of hypergraph duality and related problems (Khaled Elbassioni, Matthias Hagen and Imran Rauf)

11:35 am - 1:20 pm Lunch

1:20 pm - 2:10 pm Invited Talk
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Jianer Chen)

2:10 pm - 2:35 pm Exact Algorithms for Edge Domination (Johan M. M. van Rooij and Hans Bodlaender)

2:35 pm - 3:00 pm An O*(1.0977^n) exact algorithm for max independent set in sparse graphs
(Nicolas Bourgeois, Bruno Escoffier and Vangelis Paschos)

3:00 pm - 3:20 pm Coffee Break

3:20 pm- 3:45 pm Fixed Structure Complexity (Yonatan Aumann and Yair Dombb)

3:45 pm- 4:10 pm Wheel-free deletion is W[2]-Hard
(Daniel Lokshtanov)

4:10 pm- 4:35 pm A Purely Democratic Characterization of W[1] (Michael Fellows, Danny Hermelin, Moritz Mueller and Frances A. Rosamond)

5:00 pm - 6:00 pm Business meeting

7:00 pm - 9:00 pm Reception (ECS 660)

Friday, May 16, 2008

8:00 am- 9:00 am Breakfast

9:00 am - 9:50 am Invited Talk
Algorithmic Graph Minors and Bidimensionality (Erik D. Demaine)

9:50 am - 10:10 am Coffee Break

10:10 am - 10:35 am A Linear Kernel for Planar Feedback Vertex Set (Eelko Penninkx and Hans L. Bodlaender)

10:35 am - 11:00 am Capacitated Domination and Covering: A Parameterized Perspective (Michael Dom, Daniel Lokshtanov, Saket Saurabh and Yngve Villanger)

11:00 am - 11:25 am Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
(Omid Amini, Ignasi Sau and Saket Saurabh)

11:25 am - 11:50 am FPT algorithms for path-transversals and cycle-transversals problems in graphs (Sylvain Guillemot)

11:50 am - 1:40 pm Lunch

1:40 pm - 2:05 pm An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees (Sebastian Boecker, Quang Bao Anh Bui and Anke Truss)

2:05 pm - 2:25 pm New fixed-parameter algorithms for the minimum quartet inconsistency problem
(Maw-Shang Chang, Chuang-Chieh Lin and Peter Rossmanith)

2:25 pm - 2:50 pm Parameterized complexity and approximability of the SLCS problem(Sylvain Guillemot)

2:50 pm - 3:20 pm Coffee Break

3:20 pm - 3:45 pm Parameterized Derandomization
(Moritz Mueller)

3:45 pm - 4:10 pm Parameterized Chess (Allan Scott and Ulrike Stege)