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

21. 12. 2006
at 12:20 in S5
Jean-Sébastien Sereni: Circular choosability of graphs ( abstract )
14. 12. 2006
at 12:20 in S5
Tobias Muller: Identifying codes in (random) unit disk graphs ( abstract )
07. 12. 2006
at 12:20 in S5
Jan van den Heuvel: Circular Arboricity of Graphs ( abstract )
04. 12. 2006
at 12:20 in S1
Jan van den Heuvel: On the Diameter of the Transportation Polytope ( abstract )
30. 11. 2006
at 12:20 in S5
Zsolt Tuza: Generalizations of mixed hypergraphs ( abstract )
27. 11. 2006
at in
: ( abstract )
23. 11. 2006
at 12:20 in S5
Frederic Havet: Directed star arboricity ( abstract )
16. 11. 2006
at 12:20 in S5
Martin Pergel: On Recognition of PC-graphs ( abstract )
09. 11. 2006
at 12:20 in S5
: HOMONOLO ( abstract )
01. 11. 2006
at 9:50 in S9
: ( abstract )
01. 11. 2006
at 9:00 in S9
: ( abstract )
30. 10. 2006
at 12:20 in S1
Diana Piguet, Maya Stein: On an approximate version of the Loebl-Komlos-Sos conjecture ( abstract )
26. 10. 2006
at 12:20 in S5
Lutz G. Lucht: On finite pattern-free sets of integers ( abstract )
25. 10. 2006
at 11:30 in S5
JianMin Tang: Connectivity and Superconnectivity of digraphs with prescribed semigirth ( abstract )
25. 10. 2006
at 10:40 in S5
Guillermo Pineda Villavicencio: On the Degree/Diameter Problem for both bipartite and non-bipartite graphs ( abstract )
23. 10. 2006
at 12:00 in S1
Lutz G. Lucht: Recurrence sequences with arithmetic properties ( abstract )
19. 10. 2006
at 12:20 in S5
Dirk Schlatter: Constrained random graph processes ( abstract )
12. 10. 2006
at 12:20 in S5
Attila Por: Overlap Graphs ( abstract )
05. 09. 2006
at 12:20 in S6
Leonard J. Schulman: Clustering lines: classification of incomplete data ( abstract )
22. 06. 2006
at 12:20 in S5
Mark Siggers: The Complexity of Some Restricted H-Colouring Problems ( abstract )
01. 06. 2006
at 12:20 in S5
Gabor Hegedus: on Ramsey theory ( abstract )
25. 05. 2006
at 12:20 in S5
Gabor Hegedus: Grobner bases ( abstract )
23. 05. 2006
at 12:20 in S5
Peter Golovach: Distance constrained labellings for trees ( abstract )
18. 05. 2006
at 12:20 in S5
Dieter Kratsch: A Simple $O (2^{0.288 n})$ Independent Set Algorithm ( abstract )
12. 05. 2006
at 12:20 in S5
Martin Rubey: Symmetry properties of statistics of lattice paths in ladders ( abstract )
10. 05. 2006
at 12:20 in S5
Martin ©koviera: Edge-colourings of cubic graphs and partial Steiner triple ( abstract )
06. 04. 2006
at 12:20 in S5
Tetsuo Asano: Mathematical and Algorithmic Approaches to Digital Halftoning ( abstract )
10. 03. 2006
at 12:20 in S5
Jose Zamora: Complexity of linear mappings induced by graphs ( abstract )
09. 03. 2006
at 12:20 in S5
Anna de Mier: k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams ( abstract )
02. 03. 2006
at 12:20 in S5
Jose Soto: Degree matrices ( abstract )
26. 01. 2006
at 12:20 in S7
Sotiris Nikoletseas: Design and analysis of algorithms for wireless sensor networks ( 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