\seminar {Seminar za teorijo grafov in algoritme}

Seminar za teorijo grafov in algoritme se sestane vsak \v{c}etrtek ob 12. uri.
Vodji seminarja sta Sergio Cabello in Riste \v{S}krekovski. V letu 2010
so se zvrstila naslednja predavanja:

\begin{seznam}
 \predavanje {Daniel Kr�} {Removal Lemma for systems of linear equations} {} {5.~1.} {}	
 \predavanje {Neboj�a Gvozdenovi�} {Newspaper distribution problem} {} {11.~1.} {}
 \predavanje {Riste �krekovski} {Some basic examples of use of probabilistic method} {} {24.~2.} {}	
 \predavanje {Atsuhiro Nakamoto} {Odd minors in graphs on surfaces} {} {1.~3.} {}
 \predavanje {Sergio Cabello} {PTAS for certain optimization problems in minor-closed graphs} {} {15.~3.} {}	
 \predavanje {Sergio Cabello} {Output-sensitive algorithm for the edge-width of an embedded graph} {} {23.~3.} {}
 \predavanje {Sandi Klav�ar} {Convexities and product graphs} {} {29.~3.} {}	
 \predavanje {Petr Gregor} {Queue layouts of hypercubes} {} {6.~4.} {}
 \predavanje {Ga�per Fijav�} {Distingushing number of bipartite planar graphs} {} {12.~4.} {}	
 \predavanje {Janez Povh} {Semidefinite programming certificates for tracial matrix inequalities} {} {20.~4.} {}
 \predavanje {Borut Lu�ar} {On the linear arboricity of graphs} {} {27.~4.} {}	
 \predavanje {Toma� Pisanski} {HOMO-LUMO maps of graphs} {} {3.~5.} {}
 \predavanje {Marek Cygan} {Kernelization -- a part of the fixed parameter tractability} {} {10.~5.} {}	
 \predavanje {Andrej Brodnik} {Extended dictionary in minimal space} {} {2.~6.} {}
 \predavanje {Michel Deza} {4- and 6-regular analogs of fullerenes} {} {6.~10.} {}	
 \predavanje {Miriam Duer} {On the cones of completely positive and doubly nonnegative matrices and their use in optimization} {} {14.~10} {}
 \predavanje {Marianna Bolla} {Multiway cuts and regular partitions} {} {14.~10} {}	
 \predavanje {Robert �amal} {Complexity of cops and robber game} {} {20.~10} {}
 \predavanje {Bojan Mohar} {Average degree condition forcing complete graph immersion} {} {27.~10.} {}	
 \predavanje {Rok Erman} {Linear colorings of planar graphs with prescribed girth and maximum degree} {} {11.~2.} {}
 \predavanje {Martin Juvan} {Parametri�no linearno programiranje} {} {9.~11.} {}	
 \predavanje {Gasper Fijav�} {Cliques in embedded graphs, part I} {} {15.~11.} {}
 \predavanje {Gasper Fijav�} {Cliques in embedded graphs, part II} {} {22.~11.} {}	
 \predavanje {Borut Lu�ar} {On the diameter and other invariants of fullerene graphs} {} {13.~12} {}
\end{seznam}
