Noon lectures

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | future lectures)

Noon Seminar is a seminar organized more or less regularly once or twice a week during the semester, and irregularly on the other times. The topic of the seminar may in general be from any field of mathematics or computer science. It usually starts at 12:20 and lasts 30-45 minutes, on Thursdays and sometimes Tuesdays. The seminar takes place in our building on Malá Strana, usually in the lecture room S6 on the 2nd floor. The language is English by default (alternatively Czech).

In year 2008, there were the following noon lectures:

18. 12. 2008
at 12:20 in S8
Natalio Krasnogor: An Evolutionary Algorithm Approach to Guiding the Evolution of Self-Organised Nanostructured Systems ( abstract )
11. 12. 2008
at 12:20 in S8
Claude Tardif: Interlacing adjoints of tournaments ( abstract )
11. 12. 2008
at 12:20 in S8
Benoit Larose: The complexity of the list homomorphism problem for graphs ( abstract )
27. 11. 2008
at 12:20 in S8
Patrice Ossona de Mendez: Restricted dualities for graphs ( abstract )
20. 11. 2008
at 12:20 in S8
Louis Esperet: A unified approach to distance-two coloring of graphs on surfaces ( abstract )
13. 11. 2008
at 12:20 in S8
Diana Piguet: Schelp's conjecture ( abstract )
06. 11. 2008
at 12:20 in S8
Jiří Fiala: On packing coloring for trees and grids ( abstract )
30. 10. 2008
at 12:20 in S6
Jorge Ramirez: Frobenius problem: Applications ( abstract )
23. 10. 2008
at 12:20 in S8
Peter Golovach: Spanners in sparse graphs ( abstract )
16. 10. 2008
at 12:20 in S8
Pavel Skums: Krausz dimension of graphs ( abstract )
09. 10. 2008
at 12:20 in S8
Daniel Král: Removal Lemma for systems of linear equations ( abstract )
11. 09. 2008
at 12:20, in S9
Mike Fellows: Some New Developments and Open Problems in Parametrized Algorithms and Complexity ( abstract )
21. 08. 2008
at 15:00 in S3
Matt DeVos: Seymour-Schrijver conjecture ( abstract )
19. 06. 2008
at 12:20, in S1
Andrzej Proskurowski: Computing minimum distortion embeddings into a path ( abstract )
12. 06. 2008
at 12:20 in S3
Tobias Mueller: Circular choosability is rational ( abstract )
05. 06. 2008
at 12:20 in S1
Jindrich Zapletal: A new Ramsey property on Polish spaces ( abstract )
15. 05. 2008
at 12:20, in S1
Jan Kratochvíl: Exact algorithms for Frequency Assignment: Branching versus Dynamic Programming ( abstract )
17. 04. 2008
at 12:20, in S1
Frank Ruskey: The mysterious behavior of "meta-Fibonacci" sequences ( abstract )
03. 04. 2008
at 12:20 in S1
Stefan Ratschan: Quasi-decidability and its Role in Hybrid Systems Verification ( abstract )
27. 03. 2008
at 12:20 in S1
Bernard Anderson: Automorphisms of the truth-table degrees ( abstract )
20. 03. 2008
at 12:20 in S1
Hossein Teimoori Faal: Karaji's L-Summing Method ( abstract )
13. 03. 2008
at 12:20 in S1
Josef Cibulka: Untangling planar graphs ( abstract )
06. 03. 2008
at 12:20 in
: University of Alberta ( abstract )
28. 02. 2008
at 12:20 in S1
Martin Loebl: Enumeration by matrix integrals ( abstract )
21. 02. 2008
at 12:20 in S5
Nicolas Lichiardopol: A new bound for a particular case of the Caccetta-Häggkvist conjecture ( abstract )
14. 02. 2008
at 12:20 in S5
Lubos Thoma: On graphs and their orientations ( abstract )
17. 01. 2008
at 12.20 in S5
Anastasios Sidiropoulos: Probabilistic Embeddings of Bounded Genus Graphs Into Planar Graphs ( abstract )

If you would like to receive announcements of the noon seminar and of the talks given by our visitors, send a message to Zdenek Dvorak.

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | future lectures)

Webmaster: kamweb.mff.cuni.cz         Modified: 09. 02. 2012