Kombinatorický seminář v ZS 2007/2008

Program

10.10.Úvodní seminář
17.10.MM+PVBurza článků
24.10.Jan HladkýB. Sudakov et al.: Ramsey Numbers of Sparse Hypergraphs
31.10.Jan ZálohaD. Karger et al.: A Randomized Linear-Time Algorithm to Find Minimum Spanning Tree
7.11.Martin KupecR. Panigrahy, D. Thomas: Finding Frequent Elements in Non-bursty Streams
14.11.Marek SterzikHein 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 VanerA. Buchsbaum et al.: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification and Dominators
12.12.Jan VolecI. Katriel, P. Sanders, J. Träff: A Practical MST Algorithm Using the Cycle Property
19.12.Tomáš GavenčiakJak se chytá zloděj
9.1.Jaroslav HanclN. H. Hustafa, S. Ray: An optimal generalization of the centerpoint theorem, and its extensions

Webmaster: kamweb@kam.mff.cuni.cz         Modified: 29. 02. 2008