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 2007, there were the following noon lectures:
|
20. 12. 2007 at 12:20 | Standa Zivny: The Expressive Power of Valued Constraints: Hierarchies and Collapses ( abstract ) |
|
13. 12. 2007 at 12:20 | Miklos Maroti: Weak near-unanimity and constraint satisfaction problems ( abstract ) |
|
29. 11. 2007 at 12:20 | Francesc Comellas: The Hierarchical Product of Graphs ( abstract ) |
|
15. 11. 2007 at 12.20 | Petr Golovach: On tractability of Cops and Robbers game ( abstract ) |
|
21. 9. 2007 at 12:10 | Jerrold R. Griggs: Large families of subsets avoiding a given configuration ( abstract ) |
|
19. 7. 2007 at 12:20 | Viola Meszaros: The Slope Number of $K_{n,m}$ ( abstract ) |
|
28. 6. 2007 at 12:20 | Jean-Sébastien Sereni: The Bermond-Thomassen conjecture ( abstract ) |
|
14. 6. 2007 at 12:20 | Vít Jelínek: Monochromatic triangles in two-colored plane ( abstract ) |
|
7. 6. 2007 at 12:20 | Milan Hladík: Systems of linear equations inside given intervals ( abstract ) |
|
31. 5. 2007 at 12:20 | Dmitry Gavinsky: Classical Interaction Cannot Replace a Quantum Message ( abstract ) |
|
24. 5. 2007 at 12:20 | Michael Rubinstein: Primes, the Riemann Hypothesis, and Random Matrices ( abstract ) |
|
3. 5. 2007 at 12:20 | Italo Dejter: Dominating sets in graphs ( abstract ) |
|
3. 5. 2007 at 13:00 | Dániel Marx: On tree width, bramble size, and expansion ( abstract ) |
|
12. 4. 2007 at 12:20 | Mike Newman: A little about covering arrays, some independent sets and a graph core ( abstract ) |
|
5. 4. 2007 at 12:20 | Ales Privetivy: How many points can be reconstructed from k projections? ( abstract ) |
|
29. 3. 2007 at 12:20 | Hossein Teimoori Faal: The ABC-Conjecture: Beyond The Fermat Last Theorem ( abstract ) |
|
22. 3. 2007 at 12:20 | Petr Skovron: Removing degeneracy may require unbounded dimension increase ( abstract ) |
|
15. 3. 2007 at 12:20 | Martin Klazar: How many ordered factorizations may n have? ( abstract ) |
|
8. 3. 2007 at 12:20 | Jan Kratochvil: Exact algorithms for generalized domination ( abstract ) |
|
22. 2. 2007 at 12:20 | Tomas Bily: Digital cell ( abstract ) |
|
15. 2. 2007 at 12:20 | Michael Stiebitz: Edge Colourings of Graphs ( abstract ) |
|
8. 2. 2007 at 12:20 | Jan Foniok: Computing amoebas using semidefinite programming ( abstract ) |
|
1. 2. 2007 at 12:20 | : ( abstract ) |
|
25. 1. 2007 at 12:20 | : ( abstract ) |
|
18. 1. 2007 at 12:20 | Jiří Fink: Perfect Matchings Extend to Hamilton Cycles in Hypercubes ( abstract ) |
|
11. 1. 2007 at 12:20 | Attila Por: Conway's Angel ( abstract ) |
|
4. 1. 2007 at 12:20 | : ( abstract ) |