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

19. 12. 2019
at 12:30
Jan Volec: Forcing quasi-randomness in permutations ( abstract )
17. 12. 2019
at 10:45
Sudatta Bhattacharya: Exploring Closeness Centrality and Related Measures for Sparse and Planar Graphs ( abstract )
5. 12. 2019
at 12:30
Jonathan Narboni: On the 4-color theorem for signed graphs ( abstract )
7. 11. 2019
at 12:30
Carl Feghali: Graph Theory meets Extremal Set Theory ( abstract )
29. 10. 2019
at 10:40
Pavel Hubáček: On Average-Case Hardness of Search Problems with Guaranteed Existence of Solution ( abstract )
12. 9. 2019
at 12:30
Sunil Chandran: Separation Dimension of Graphs and Hyper Graphs ( abstract )
5. 9. 2019
at 12:30
Moslem Zamani: New bounds for quadratic programming ( abstract )
25. 7. 2019
at 12:30
Ali Mili: Absolute Correctness and Relative Correctness ( abstract )
11. 7. 2019
at S11
Torsten Mütze: Combinatorial generation via permutation languages ( abstract )
20. 6. 2019
at 12:30
Cornelius Brand: Extensor-Coding: An algebraic Method for hard Graph problems ( abstract )
19. 6. 2019
at 12:30
Sebastian Ordyniak: Recent Advances on the Parameterized Complexity of Integer Linear Programming ( abstract )
13. 6. 2019
at 12:30
Cemil Dibek: Edge-Extremal Graphs Under Degree and Matching Number Restrictions ( abstract )
29. 5. 2019
at 12:30
Wolfgang Mulzer: Dynamic Maintenance of the Lower Envelope of Pseudo-Lines ( abstract )
7. 5. 2019
at 12:30
Jan Novák: Plabic graphs in physics ( abstract )
2. 5. 2019
at 12:30
Davis Issac: Covering and Partitioning Edges with Complete Bipartite Subgraphs ( abstract )
2. 5. 2019
at 15:40
Manfred Scheucher: On Erdős-Szekeres Type Questions in R^d ( abstract )
29. 4. 2019
at 12:30
Emo Welzl: Connectivity of Triangulation Flip Graphs in the Plane ( abstract )
25. 4. 2019
at 12:30
Michael Elkin: Distributed Exact Shortest Paths Algorithm in Sublinear Time ( abstract )
23. 4. 2019
at 12:30
Debarati Das: Jirka Matoušek Prize Noon lecture: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time ( abstract )
4. 4. 2019
at 12:30
Matěj Konečný: Jirka Matoušek Prize Noon lecture: Structural Ramsey theory, homomorphism dualities and completions ( abstract )
28. 3. 2019
at 12:30
Tereza Klimošová: Algorithms for graphs without linear forests ( abstract )
26. 3. 2019
at 12:30
Pavel Veselý: A Tight Lower Bound for Quantile Summaries ( abstract )
19. 3. 2019
at 12:30
Matthias Mnich: Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set ( abstract )
28. 2. 2019
at 12:30
Torsten Mütze: On symmetric chains and Hamilton cycles ( abstract )
17. 1. 2019
at 12:30
Carl Feghali: Paths between colourings of sparse graphs ( abstract )

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

Webmaster: kamweb.mff.cuni.cz         Archive page