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

05. 05. 2017 at 12:20 in S6 |
Martin Balko:
A superlinear lower bound on the number of 5-holes
( abstract ) |

04. 05. 2017 at 12:20 in S6 |
Martin Balko:
Covering lattice points by subspaces and counting point-hyperplane incidences
( abstract ) |

23. 03. 2017 at 12:20 in S6 |
Marcin Pilipczuk:
Subexponential Parameterized Algorithms for Planar Graphs, Apex-Minor-Free Graphs and Graphs of Polynomial Growth via Low Treewidth Pattern Covering
( abstract ) |

09. 03. 2017 at 12:20 in S6 |
Anup Rao:
Lower bounds on Non-adaptive Data Structures for Median and Predecessor search
( abstract ) |

23. 02. 2017 at 12:20 in S6 |
Jan Kynčl:
Simple realizability of complete abstract topological graphs simplified
( abstract ) |

09. 02. 2017 at 12:20 in S1 |
Daqing Yang:
Generalizations of theorems of Nash-Williams and Hakimi on graph decompositions
( abstract ) |

12. 01. 2017 at 12:20 in S6 |
Stephan Wagner:
Paths vs. stars in the local profile of trees
( 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