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 2007, there were the following noon lectures:

20. 12. 2007
at 12:20 in S5
Standa Zivny: The Expressive Power of Valued Constraints: Hierarchies and Collapses ( abstract )
13. 12. 2007
at 12:20 in S5
Miklos Maroti: Weak near-unanimity and constraint satisfaction problems ( abstract )
29. 11. 2007
at 12:20 in S5
Francesc Comellas: The Hierarchical Product of Graphs ( abstract )
15. 11. 2007
at 12.20 in S5
Petr Golovach: On tractability of Cops and Robbers game ( abstract )
21. 09. 2007
at 12:10 in S6
Jerrold R. Griggs: Large families of subsets avoiding a given configuration ( abstract )
19. 07. 2007
at 12:20 in S6
Viola Meszaros: The Slope Number of $K_{n,m}$ ( abstract )
28. 06. 2007
at 12:20 in S5
Jean-Sébastien Sereni: The Bermond-Thomassen conjecture ( abstract )
14. 06. 2007
at 12:20 in S5
Vít Jelínek: Monochromatic triangles in two-colored plane ( abstract )
07. 06. 2007
at 12:20 in S5
Milan Hladík: Systems of linear equations inside given intervals ( abstract )
31. 05. 2007
at 12:20 in S5
Dmitry Gavinsky: Classical Interaction Cannot Replace a Quantum Message ( abstract )
24. 05. 2007
at 12:20 in S5
Michael Rubinstein: Primes, the Riemann Hypothesis, and Random Matrices ( abstract )
03. 05. 2007
at 13:00 in S5
Dániel Marx: On tree width, bramble size, and expansion ( abstract )
03. 05. 2007
at 12:20 in S5
Italo Dejter: Dominating sets in graphs ( abstract )
12. 04. 2007
at 12:20 in S5
Mike Newman: A little about covering arrays, some independent sets and a graph core ( abstract )
05. 04. 2007
at 12:20 in S5
Ales Privetivy: How many points can be reconstructed from k projections? ( abstract )
29. 03. 2007
at 12:20 in S5
Hossein Teimoori Faal: The ABC-Conjecture: Beyond The Fermat Last Theorem ( abstract )
22. 03. 2007
at 12:20 in S5
Petr Skovron: Removing degeneracy may require unbounded dimension increase ( abstract )
15. 03. 2007
at 12:20 in S5
Martin Klazar: How many ordered factorizations may n have? ( abstract )
08. 03. 2007
at 12:20 in S5
Jan Kratochvil: Exact algorithms for generalized domination ( abstract )
22. 02. 2007
at 12:20 in S5
Tomas Bily: Digital cell ( abstract )
15. 02. 2007
at 12:20 in S5
Michael Stiebitz: Edge Colourings of Graphs ( abstract )
08. 02. 2007
at 12:20 in S5
Jan Foniok: Computing amoebas using semidefinite programming ( abstract )
01. 02. 2007
at 12:20 in S5
: ( abstract )
25. 01. 2007
at 12:20 in S5
: ( abstract )
18. 01. 2007
at 12:20 in S5
Jiří Fink: Perfect Matchings Extend to Hamilton Cycles in Hypercubes ( abstract )
11. 01. 2007
at 12:20 in S5
Attila Por: Conway's Angel ( abstract )
04. 01. 2007
at 12:20 in S5
: ( 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