\seminar {Seminar za teorijo grafov in algoritme}

Seminar za teorijo grafov in algoritme se sestane vsak \v cetrtek ob 12.
Vodji seminarja sta Sergio Cabello in Riste �krekovski. V letu 2006
so se zvrstila naslednja predavanja:

\begin{seznam}
\predavanje {Martin Tancer} {Greene's proof of Kneser's conjecture} {} {5.~1.} {}
\predavanje {Rok Erman} {Critical graphs with connected complements} {} {12.~1.} {}
\predavanje {Jurij Miheli\v{c}} {Approximation algorithms for the network $k$-center problem} {} {16.~2.} {}
\predavanje {J. Antoni Sellar\`es} {Noisy disk set matching under rigid motion} {} {23.~2.} {}
\predavanje {G\"{u}nter Rote} {Strictly convex drawings of planar graphs} {} {23.~2.} {}
\predavanje {Jean-S\'ebastien Sereni} {Pathwidth of outerplanar graphs} {} {2.~3.} {}
\predavanje {Christian Knauer} {Minimum weight triangulations with few inner points} {} {9.~3.} {}
\predavanje {Darko Dimitrov} {On the bounding boxes obtained by principal component analysis} {} {9.~3.} {}
\predavanje {Sergio Cabello} {Obnoxious centers in graphs} {} {23.~3.} {}
\predavanje {Ga\v{s}per Fijav\v{z}} {Girth and treewidth} {1} {30.~3.} {}
\predavanje {Ga\v{s}per Fijav\v{z}} {Girth and treewidth} {2} {6.~4.} {}
\predavanje {Martin Tancer} {Construction of large graphs with no optimal surjective $L(2,1)$-labelings} {} {20.~4.} {}
\predavanje {Bojan Mohar (video)} {Hadwiger's conjecture} {} {11.~4.} {}
\predavanje {Sergio Cabello} {Getting drunk, walking randomly, and arriving home} {} {18.~5.} {}
\predavanje {Sergio Cabello (organizator)} {Puzzles and open problems} {} {18.~5.} {}
\predavanje {Bojan Mohar} {A generalization of Kneser's Addition Theorem} {} {15.~6.} {}
\predavanje {Igor �ukanovi�} {Kopozitivna relaksacija za kromati\v{c}no \v{s}tevilo} {} {15.~6.} {}
\predavanje {Tibor Ill\'es} {Semidefinite optimization: theory, interior point algorithm(s) and applications} {} {5.~10.} {}
\predavanje {Riste \v{S}krekovski} {Kotzigov Izrek} {} {12.~10.} {}
\predavanje {Alen Orbani\'c} {Edge-transitive maps} {} {19.~10.} {}
\predavanje {Riste \v{S}krekovski} {List-colorings of $\Delta$-free planar graphs} {} {19.~10.} {}
\predavanje {Riste \v{S}krekovski} {List-coloring} {} {26.~10.} {}
\predavanje {Igor �ukanovi�} {A semidefinite programming motivated graph coloring heuristic} {} {9.~11.} {}
\predavanje {Nik in Kris Stopar} {Realna baravnja grafov s pogoji na razdaljah} {} {16.~11.} {}
\predavanje {Franti\v{s}ek Kardo\v{s}} {Symmetry of Fulleroids} {} {23.~11.} {}
\predavanje {Katja Prnaver} {Problem trgovskega potnika - Christofidesov algoritem} {} {30.~11.} {}
\predavanje {Borut Lu\v{z}ar} {Igra $(a,b)$-barvanja na usmerjenih grafih} {} {7.~12.} {}
\predavanje {Ga\v{s}per Fijav\v{z}} {Minorsko prekri\v{z}no \v{s}tevilo grafih brez $H$-minorjia} {} {14.~12.} {}
\predavanje {Rok Erman} {Povezanost fulerenov} {} {22~.12} {}
\end{seznam}

