Prof. Emo Welzl and Prof. Bernd Gärtner
|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)
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