# Noon lectures

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

19. 12. 2019 at 12:30 in S6 | Jan Volec: Forcing quasi-randomness in permutations ( abstract ) |

17. 12. 2019 at 10:45 in 510 | Sudatta Bhattacharya: Exploring Closeness Centrality and Related Measures for Sparse and Planar Graphs ( abstract ) |

05. 12. 2019 at 12:30 in S6 | Jonathan Narboni: On the 4-color theorem for signed graphs ( abstract ) |

07. 11. 2019 at 12:30 in S6 | Carl Feghali: Graph Theory meets Extremal Set Theory ( abstract ) |

29. 10. 2019 at 10:40 in S1 | Pavel Hubáček: On Average-Case Hardness of Search Problems with Guaranteed Existence of Solution ( abstract ) |

12. 09. 2019 at 12:30 in S11 | Sunil Chandran: Separation Dimension of Graphs and Hyper Graphs ( abstract ) |

05. 09. 2019 at 12:30 in S11 | Moslem Zamani: New bounds for quadratic programming ( abstract ) |

25. 07. 2019 at 12:30 in S8 | Ali Mili: Absolute Correctness and Relative Correctness ( abstract ) |

11. 07. 2019 at S11 in 12:30 | Torsten Mütze: Combinatorial generation via permutation languages ( abstract ) |

20. 06. 2019 at 12:30 in S6 | Cornelius Brand: Extensor-Coding: An algebraic Method for hard Graph problems ( abstract ) |

19. 06. 2019 at 12:30 in S6 | Sebastian Ordyniak: Recent Advances on the Parameterized Complexity of Integer Linear Programming ( abstract ) |

13. 06. 2019 at 12:30 in S6 | Cemil Dibek: Edge-Extremal Graphs Under Degree and Matching Number Restrictions ( abstract ) |

29. 05. 2019 at 12:30 in S6 | Wolfgang Mulzer: Dynamic Maintenance of the Lower Envelope of Pseudo-Lines ( abstract ) |

07. 05. 2019 at 12:30 in S10 | Jan Novák: Plabic graphs in physics ( abstract ) |

02. 05. 2019 at 15:40 in S5 | Manfred Scheucher: On Erdős-Szekeres Type Questions in R^d ( abstract ) |

02. 05. 2019 at 12:30 in S6 | Davis Issac: Covering and Partitioning Edges with Complete Bipartite Subgraphs ( abstract ) |

29. 04. 2019 at 12:30 in S6 | Emo Welzl: Connectivity of Triangulation Flip Graphs in the Plane ( abstract ) |

25. 04. 2019 at 12:30 in S6 | Michael Elkin: Distributed Exact Shortest Paths Algorithm in Sublinear Time ( abstract ) |

23. 04. 2019 at 12:30 in S10 | Debarati Das: Jirka Matoušek Prize Noon lecture: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time ( abstract ) |

04. 04. 2019 at 12:30 in S6 | Matěj Konečný: Jirka Matoušek Prize Noon lecture: Structural Ramsey theory, homomorphism dualities and completions ( abstract ) |

28. 03. 2019 at 12:30 in S6 | Tereza Klimošová: Algorithms for graphs without linear forests ( abstract ) |

26. 03. 2019 at 12:30 in S10 | Pavel Veselý: A Tight Lower Bound for Quantile Summaries ( abstract ) |

19. 03. 2019 at 12:30 in S10 | Matthias Mnich: Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set ( abstract ) |

28. 02. 2019 at 12:30 in S6 | Torsten Mütze: On symmetric chains and Hamilton cycles ( abstract ) |

17. 01. 2019 at 12:30 in S10 | Carl Feghali: Paths between colourings of sparse 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 Irena Penev.

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

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