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 2012, there were the following noon lectures:
|
11. 12. 2012 at 12:20 | Krysztof Choromanski: The Erdos-Hajnal Conjecture ( abstract ) |
|
29. 11. 2012 at 12:20 | Pavol Hell: Interval Digraphs ( abstract ) |
|
18. 10. 2012 at 12:20 | Diana Piguet: Embedding trees in sparse graphs ( abstract ) |
|
5. 6. 2012 at 12:20 | Jerrold R. Griggs: Supersaturation in the Boolean Lattice ( abstract ) |
|
31. 5. 2012 at 12:20 | Igor Køí¾: Knot theory: a current view ( abstract ) |
|
17. 5. 2012 at 12:20 | Stefan Ratschan a Peter Franek: Quasi-decidability of a Fragment of the First-order Theory of the Real Numbers and Topological Extension of Maps to the Sphere ( abstract ) |
|
3. 5. 2012 at 12:20 | Moshe Rosenfeld: The Odd-Distance Graph ( abstract ) |
|
26. 4. 2012 at 12:20 | Torsten Ueckerdt: Three Ways to Cover a Graph ( abstract ) |
|
12. 4. 2012 at 12:20 | Joanne Hall: Similarities between mutually unbiased bases and projective planes ( abstract ) |
|
5. 4. 2012 at 12:20 | Jarett Schwartz: Coalescing Balls and Bins ( abstract ) |
|
2. 4. 2012 at 12:20 | Toma¾ Pisanski: GI graphs and their groups ( abstract ) |
|
9. 3. 2012 at 12:20 | György Dósa: It's only scheduling and bin packing (but we like it). ( abstract ) |
|
23. 2. 2012 at 12:20 | Marek Eliá¹: Higher-order Erdõs-Szekeres theorems ( abstract ) |
|
9. 2. 2012 at 12:20 | Maria Saumell: Bounds on the diameter of the flip graph ( abstract ) |
|
2. 2. 2012 at 12:20 | Florian Pfender: Rainbow Matchings in Graphs ( abstract ) |
|
19. 1. 2012 at 12:20 | Xavier Goaoc: On the monotonicity of the expected complexity of a random polytope ( abstract ) |
|
12. 1. 2012 at 12:20 | Laszlo Vegh: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives ( abstract ) |
|
5. 1. 2012 at 12:20 | Ondra Suchý: The Parameterized Complexity of Local Search for TSP ( abstract ) |
|
3. 1. 2012 at 12:20 | Bernard Lidický: Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ( abstract ) |