Noon lecture
list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)
In year 2016, there were the following noon lectures:
22. 12. 2016 at 12:20 | Matas Šileikis: Concentration of extension counts in random graphs ( abstract ) |
15. 12. 2016 at 12:20 | Petr Glivický: (Un)provability of Fermat's last theorem and Catalan's conjecture in formal arithmetics ( abstract ) |
8. 12. 2016 at 12:20 | Marthe Bonamy: Kempe equivalence of colourings ( abstract ) |
6. 12. 2016 at 14:00 | Lutz Warnke: The phase transition in the random d-process ( abstract ) |
1. 12. 2016 at 12:20 | Torsten Mütze: Trimming and gluing Gray codes ( abstract ) |
10. 11. 2016 at 12:20 | Arnaud de Mesmay: On the complexity of optimal homotopies ( abstract ) |
3. 11. 2016 at 12:20 | Alexandr Kazda: Beyond perfect matchings: Solving edge-CSP for even delta-matroids ( abstract ) |
24. 10. 2016 at 14:00 | Alexandr Kazda: Constraint Satisfaction Problems and the Datalog language (CSI candidate talk) ( abstract ) |
21. 10. 2016 at 14:00 | Pavel Hubáček: Barriers in Algorithmic Game Theory Through the Cryptographic Lens (CSI candidate talk) ( abstract ) |
20. 10. 2016 at 12:20 | 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 | Kazuhisa Makino: Posimodular Function Optimization ( abstract ) |
13. 10. 2016 at 12:20 | Martin Mareš: Practical data structures ( abstract ) |
2. 9. 2016 at 12:20 | Bernard Lidicky: Decomposing random d-regular graphs into stars ( abstract ) |
25. 8. 2016 at 12:20 | Michael Saks: The Population Recovery problem ( abstract ) |
21. 7. 2016 at 12:20 | Zvi Lotker: Social Networks and Plays ( abstract ) |
21. 6. 2016 at 12:20 | Zvi Lotker: TBA ( abstract ) |
21. 6. 2016 at 12:20 | Zvi Lotker: TBA ( abstract ) |
31. 5. 2016 at 12:12 | Martin Balko a Josef Cibulka: Recent progress on the Erdős-Szekeres conjecture ( abstract ) |
17. 5. 2016 at 12:20 | Matas Sileikis: Probabilistic botany: from rooted subgraph counts to leaves of random trees (faculty candidate talk) ( abstract ) |
12. 5. 2016 at 12:20 | Tereza Klimošová: Finitely forcible limits of graphs and permutations (faculty candidate talk) ( abstract ) |
21. 4. 2016 at 12:20 | Herbert Fleischner: Hamiltonicity in squares of graphs revisited ( abstract ) |
19. 4. 2016 at 12:20 | Yan Zheng: Coresets for Kernel Density Estimates and the Implications ( abstract ) |
7. 4. 2016 at 12:20 | Matthias Mnich: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments ( abstract ) |
24. 3. 2016 at 12:20 | Nitin Saurabh: Upper Bounds on Fourier-Entropy ( abstract ) |
21. 3. 2016 at 12:20 | Torsten Mütze: A new combinatorial Gray code for balanced combinations ( abstract ) |
17. 3. 2016 at 12:20 | Torsten Mütze: Some recent developments on the middle levels conjecture ( abstract ) |
10. 3. 2016 at 12:20 | Dušan Knop: Parameterized complexity of length-bounded cuts (Jirka Matoušek Prize talk) ( abstract ) |
10. 3. 2016 at 13:00 | Martin Schmid: Algorithmic Game Theory and Poker (Jirka Matoušek Prize talk) ( abstract ) |
3. 3. 2016 at 12:20 | Martin Balko: Bounds on ordered Ramsey numbers of bounded-degree graphs (Jirka Matoušek Prize talk) ( abstract ) |
25. 2. 2016 at 12:20 | Tereza Klimošová: Edge-partitioning into paths for graphs of low edge-connectivity ( abstract ) |