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

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