Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, January 15, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Fedor Fomin (Univ. of Bergen, Norway)

Parameterized Algorithms for Directed Maximum Leaf Problems

We discuss a proof that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem.

Joint work with Noga Alon, Gregory Gutin, Michael Krivelevich and Saket Saurabh.

Automatic MiSe System Software Version 1.4803M | admin login