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

15. 12. 2014 at 12:20 in S1 |
Krzysztof Choromanski:
Excluding pairs of tournaments
( abstract ) |

01. 12. 2014 at 12:20 in S1 |
Eli Shamir:
Old and new Transformations of Grammars: Structural, Algorithmic and Linguistic Applications
( abstract ) |

22. 10. 2014 at 10:40 in S1 |
Steve Chaplick:
Overlap and Intersection Representations of Planar Graphs by Squares
( abstract ) |

25. 09. 2014 at 12:20 in S6 |
Orit Raz:
On the number of unit-area triangles spanned by points in the plane
( abstract ) |

18. 09. 2014 at 12:20 in S7 |
Gerth Stølting Brodal:
Computing Triplet and Quartet Distances Between Trees
( abstract ) |

16. 09. 2014 at 12:20 in S6 |
Orit Raz:
On the number of unit-area triangles spanned by points in the plane
( abstract ) |

11. 09. 2014 at 11:00 in S1 |
Arnab Bhattacharyya:
Higher-order Fourier analysis and applications
( abstract ) |

14. 08. 2014 at 10:40 in S6 |
Michael Saks:
Two very efficient approximation algorithms for the longest increasing subsequence
( abstract ) |

17. 06. 2014 at 11:00 in S5 |
Sebastian Ordyniak:
Backdoors into Heterogeneous Classes of SAT and CSP
( abstract ) |

16. 06. 2014 at 11:00 in S4 |
Matthias Mnich:
Multivariate Algorithmics for Hard Optimization Problems
( abstract ) |

11. 06. 2014 at 12:20 in S6 |
Václav Chvátal:
Points and lines in metric spaces
( abstract ) |

05. 06. 2014 at 12:20 in S6 |
Seth Pettie:
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
( abstract ) |

30. 05. 2014 at 10:00 in S5 |
Diana Piguet:
An approximate version of the tree packing conjecture for bounded degree
( abstract ) |

29. 05. 2014 at 11:00 in S5 |
Andreas Feldmann:
Network Algorithms for Real-World Graphs
( abstract ) |

27. 05. 2014 at 15:00 in S5 |
Morteza Monemizadeh:
Estimating Streaming Maximum Matching in Planar Graphs and Beyond
( abstract ) |

22. 05. 2014 at 12:20 in S6 |
Elazar Goldenberg:
Direct Sum Testing
( abstract ) |

07. 05. 2014 at 12:20 in S8 |
Moshe Rosenfeld:
Hamiltonian cycles in prisms over graphs
( abstract ) |

17. 04. 2014 at 12:20 in S6 |
Ronald de Wolf:
Fourier analysis and the minimal degree of polynomials for Boolean functions
( abstract ) |

13. 03. 2014 at 12:20 in S6 |
Ariel Gabizon:
Representative sets for multisets
( abstract ) |

27. 02. 2014 at 12:20 in S6 |
Martin Loebl:
A remark on the Alon Tarsi conjecture
( abstract ) |

13. 02. 2014 at 12:20 in S4 |
Edgardo Roldan Pensado:
Hyperplane transversal to coloured sets
( abstract ) |

11. 02. 2014 at 12:20 in S4 |
Lucas Hosseini:
Quantifier-free Convergence of Structures
( abstract ) |

06. 02. 2014 at 12:20 in S4 |
Iain Moffatt:
Graphs are to matroids, as embedded graphs are to what?
( abstract ) |

23. 01. 2014 at 12:20 in S4 |
Rob van Stee:
Dividing connected chores fairly
( abstract ) |

09. 01. 2014 at 12:20 in S6 |
Jan Volec:
Compactness and finitely forcible graphons
( 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