# Noon lectures

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 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:30 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 2016, there were the following noon lectures:

22. 12. 2016 at 12:20 in S6 | Matas Šileikis: Concentration of extension counts in random graphs ( abstract ) |

15. 12. 2016 at 12:20 in S6 | Petr Glivický: (Un)provability of Fermat's last theorem and Catalan's conjecture in formal arithmetics ( abstract ) |

08. 12. 2016 at 12:20 in S6 | Marthe Bonamy: Kempe equivalence of colourings ( abstract ) |

06. 12. 2016 at 14:00 in S1 | Lutz Warnke: The phase transition in the random d-process ( abstract ) |

01. 12. 2016 at 12:20 in S6 | Torsten Mütze: Trimming and gluing Gray codes ( abstract ) |

10. 11. 2016 at 12:20 in S6 | Arnaud de Mesmay: On the complexity of optimal homotopies ( abstract ) |

03. 11. 2016 at 12:20 in S6 | Alexandr Kazda: Beyond perfect matchings: Solving edge-CSP for even delta-matroids ( abstract ) |

24. 10. 2016 at 14:00 in S4 | Alexandr Kazda: Constraint Satisfaction Problems and the Datalog language (CSI candidate talk) ( abstract ) |

21. 10. 2016 at 14:00 in S5 | Pavel Hubáček: Barriers in Algorithmic Game Theory Through the Cryptographic Lens (CSI candidate talk) ( abstract ) |

20. 10. 2016 at 12:20 in S6 | Martin Tancer: On Betti numbers of flag complexes with forbidden induced subgraphs (How many holes may a graph have) ( abstract ) |

18. 10. 2016 at 12:20 in S6 | Kazuhisa Makino: Posimodular Function Optimization ( abstract ) |

13. 10. 2016 at 12:20 in S6 | Martin Mareš: Practical data structures ( abstract ) |

02. 09. 2016 at 12:20 in S6 | Bernard Lidicky: Decomposing random d-regular graphs into stars ( abstract ) |

25. 08. 2016 at 12:20 in S6 | Michael Saks: The Population Recovery problem ( abstract ) |

21. 07. 2016 at 12:20 in S7 | Zvi Lotker: Social Networks and Plays ( abstract ) |

21. 06. 2016 at 12:20 in S6 | Zvi Lotker: TBA ( abstract ) |

21. 06. 2016 at 12:20 in S6 | Zvi Lotker: TBA ( abstract ) |

31. 05. 2016 at 12:12 in S6 | Martin Balko a Josef Cibulka: Recent progress on the Erdős-Szekeres conjecture ( abstract ) |

17. 05. 2016 at 12:20 in S1 | Matas Sileikis: Probabilistic botany: from rooted subgraph counts to leaves of random trees (faculty candidate talk) ( abstract ) |

12. 05. 2016 at 12:20 in S6 | Tereza Klimošová: Finitely forcible limits of graphs and permutations (faculty candidate talk) ( abstract ) |

21. 04. 2016 at 12:20 in S6 | Herbert Fleischner: Hamiltonicity in squares of graphs revisited ( abstract ) |

19. 04. 2016 at 12:20 in S1 | Yan Zheng: Coresets for Kernel Density Estimates and the Implications ( abstract ) |

07. 04. 2016 at 12:20 in S6 | Matthias Mnich: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments ( abstract ) |

24. 03. 2016 at 12:20 in S6 | Nitin Saurabh: Upper Bounds on Fourier-Entropy ( abstract ) |

21. 03. 2016 at 12:20 in S8 | Torsten Mütze: A new combinatorial Gray code for balanced combinations ( abstract ) |

17. 03. 2016 at 12:20 in S6 | Torsten Mütze: Some recent developments on the middle levels conjecture ( abstract ) |

10. 03. 2016 at 13:00 in S6 | Martin Schmid: Algorithmic Game Theory and Poker (Jirka Matoušek Prize talk) ( abstract ) |

10. 03. 2016 at 12:20 in S6 | Dušan Knop: Parameterized complexity of length-bounded cuts (Jirka Matoušek Prize talk) ( abstract ) |

03. 03. 2016 at 12:20 in S6 | Martin Balko: Bounds on ordered Ramsey numbers of bounded-degree graphs (Jirka Matoušek Prize talk) ( abstract ) |

25. 02. 2016 at 12:20 in S6 | Tereza Klimošová: Edge-partitioning into paths for graphs of low edge-connectivity ( abstract ) |

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

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

Webmaster: kamweb.mff.cuni.cz Modified: 01. 04. 2019