Kombinatorický seminář v LS 2007/2008
Program
| 20.2. | Luboš Thoma a Petr Kolman | |
| 27.2. | Petr a Pavel (Kolman a Valtr) | Burza článků |
| 5.3. | Zuzana Safernová | Shriya Anand: How to count - an exposition of Polya's Theory of Enumeration |
| 12.3. | Pavol Hell | přednáška hosta semináře |
| Tomáš Gavenčiak | G. Hahn, G. MacGillivray: A note on k-cop, l-robber games on graphs | |
| 19.3. | Ondřej Bílka | Mikkel Thorup: Compact oracles for reachability and approximate distances in planar digraphs |
| 26.3. | Jan Záloha | G. Tóth: Note on the pair-crossing number and the odd-crossing number |
| 2.4. | Dušan Knop | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles |
| 9.4. | Zuzana Safernová | J. Solymosi: Arrangements of the log curve |
| 15.-24.4. | Jarní škola kombinatoriky | |
| 30.4. | Tereza Klimošová | S. Gravier, J. Moncel, A. Semri: Identifying codes of Cartesian product of two cliques of the same size |
| Dawid Bernas | Béla Csaba: Regular spanning subgraphs of bipartite graphs of high minimum degree | |
| 7.5. | Marie Kolovratníková | Di Giacomo et al.: How to Embed a Path onto Two Sets of Points |
| 14.5. | --- | rektorský den |
| 21.5. | Kateřina Böhmová |
Webmaster: kamweb@kam.mff.cuni.cz Modified: 10. 10. 2008