Apr 23, 2013 Comments Off on Schedule
Schedule
5th May (Sunday)
15:00 ? Hotel Check In
19:00 ? 21:00: Welcome Reception
6th May (Monday)
07:30 ? 08:50: Breakfast
08:50 ? 09:00: NII Shonan Introduction Talk
09:00 ? 09:30: Dimitrios M. Thilikos: From parameterized complexity to heuristics
09:30 ? 10:00: Rod Downey: What have I been doing recently in parameterized complexity
10:00 ? 10:30: Tea Break
10:30 ? 11:15: Fedor V. Fomin: Parameterized k-OPT
11:45 ? 13:30: Lunch
13:30 ? 14:15: Sebastian Boecker: The Matrix Representation with Flipping problem and the FlipCut heuristic
14:15 ? 15:00: David Bryant: Combinatorial optimization using diversities
15:15 ? 16:00: Tea Break
16:00 ? 16:45: Gregory Gutin😕 Exponential Neighborhoods
18:00 ? 19:30: Dinner
7th May (Tueday)
09:15 ? 10:00: Benjamin Burton, Exploring parameterised complexity in computational topology
10:00 ? 10:30: Tea Break
10:30 ? 11:15:?Falk Hüfner, Implementing and testing fixed-parameter algorithms
11:45 ? 13:30: Lunch
13:30 ? 14:15: Hadas Shachnai, Tractable Parameterizations for the Minimum Linear Arrangement Problem
14:15 ? 15:00: Peter Shaw, Solving Hard Problems Incrementaly
15:00 ? 15:45: Faisal Abu Khzam, Practical Aspects of Fixed-Parameter Algorithms: An Implementations’ Viewpoint
15:45 ? 16:15: Tea Break
16:15 ? 18:00: Open problem session
18:00 ? 19:30: Dinner
8th May (Wednesday)
09:15 ? 10:00: Siamak Tazari? Deconstructing Algorithms: From Theory to Engineering
10:00 ? 10:30: Tea Break
10:30 ? 11:15: Yota Otachi, Graph Isomorphism Problem Parameterized by Width Parameters
11:15 ? 11:30: Photo session! (Please be at the lecture room R208 at 11:15)
11:45 ? 13:30: Lunch
9th May (Thursday)
09:15 ? 10:00:? ?Peter Rossmanith,? Implementing Courcelle’s Theorem
10:00 ? 10:30: Tea Break
10:30 ? 11:15: ?Manuel Sorge, Some Algorithmic Challenges in Arc Routing
11:45 ? 13:30: Lunch
13:30 ? 14:15: Patricia Evans, Inferring Haplotypes from Genotypes on a Pedigree
14:15 ? 15:00: Kazuo Iwama,? Parameterized Testability
15:00 ? 15:45:?Sebastian Boecker, Cluster Editing in Practice
15:45 ? 16:15: Tea Break
16:15 ? 18:00: Open problem session
18:00 ? 19:30: Dinner
10th May (Friday)
09:15 ? 10:00:? Christophe Paul, Linear kernel via conflict packing – application to FAST and dense RTI problems.
10:00 ? 10:30: Tea Break
10:30 ? 11:15: Takeaki Uno, FPT for Scalable Mining Algorithms
11:45 ? 13:30: Lunch
13:30 ? 14:15: Yoshio Okamoto, Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
14:15 ? 15:00:?Gregory Gutin, Domination Analysis of Heuristics
15:00 – 15:45: Daniel Lokshtanov, LP-Based Parameterized Algorithms for Separation Problems
11th May (Saturday)
7:30 ? 9:00: Breakfast
9:00 ? 9:45: Discussions
9:45 ? 10:15: Tea Break
10:15 ? 11:45: Discussions
11:45 ? 14:00: Lunch
