Kombinatorický seminář v ZS 2007/2008
Program
| 10.10. | Úvodní seminář | |
| 17.10. | MM+PV | Burza článků |
| 24.10. | Jan Hladký | B. Sudakov et al.: Ramsey Numbers of Sparse Hypergraphs |
| 31.10. | Jan Záloha | D. Karger et al.: A Randomized Linear-Time Algorithm to Find Minimum Spanning Tree |
| 7.11. | Martin Kupec | R. Panigrahy, D. Thomas: Finding Frequent Elements in Non-bursty Streams |
| 14.11. | Marek Sterzik | Hein van der Holst: Algebraic characterizations of outerplanar and planar graphs |
| 21.11. | Kateřina Böhmová | D. Eppstein, M. Goodrich, N. Sitchinava: Guard Placement for Efficient Point-in-Polygon Proofs |
| 28.11. | Zdeněk Vilušínský | D. Matula, Y. Shiloach, R. Tarjan: Two Linear-Time Algorithms for Five-Coloring a Planar Graph |
| 5.12. | Michal Vaner | A. Buchsbaum et al.: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification and Dominators |
| 12.12. | Jan Volec | I. Katriel, P. Sanders, J. Träff: A Practical MST Algorithm Using the Cycle Property |
| 19.12. | Tomáš Gavenčiak | Jak se chytá zloděj |
| 9.1. | Jaroslav Hancl | N. H. Hustafa, S. Ray: An optimal generalization of the centerpoint theorem, and its extensions |
Webmaster: kamweb@kam.mff.cuni.cz Modified: 29. 02. 2008