\seminar {Seminar za teorijo grafov in algoritme}

%Tu na kratko opi�ite seminar (kdo je vodja, koliko je rednih �lanov,
%kolikorat se je sestal, povpre? �tevilo poslu�alcev, naslov spletne strani ...)


Vodji seminarja sta Sergio Cabello in Riste �krekovski. Spletna stran je na:
\url{http://www.fmf.uni-lj.si/si/obvestila/agregator/seminar-grafi/}.

\smallskip
Seminar za teorijo grafov in algoritme se je sestajal ob �etrtkih, praviloma ob 12. uri.
V letu 2013 so se zvrstila naslednja predavanja:



%\begin{seznam}
%\predavanje {AVTORJI} {NASLOV} {DEL} {DATUM} {TRAJANJE}
%\end{seznam}

\begin{seznam}
  \predavanje {Riste �krekovski} {Some results on network centrality indices} {} {10.~1.} {}
  \predavanje {Matja� Krnc} {Some extremal eccentric graphs} {} {17.~1.} {}
  \predavanje {Vesna Andova} {Some distance and degree graph invariants and fullerene structures} {} {1.~3.} {}
  \predavanje {Sandi Klav�ar} {Zhang-Zhang polinomial and cube polynomial} {} {7.~3.} {}
  \predavanje {Ga�per Fijav�} {Threshold coloring and unit-cube contact representation of graphs} {} {14.~3.} {}
  \predavanje {Toma� Pisanski} {Incidence species and their representations} {} {21.~3.} {}
  \predavanje {Sergio Cabello} {Computing the stretch of an embedded graph} {} {28.~3.} {}
  \predavanje {Jernej Azarija} {Playing with distance matrices for FUN and PROFIT} {} {4.~4.} {}
  \predavanje {Sergio Cabello} {Parameterized complexity of 1-planarity} {} {11.~4.} {}
  \predavanje {Miha Jej�i�} {APX-Hardness of MAX CLIQUE in Intersection Graphs of Ellipses (and Triangles)} {} {18.~4.} {}
  \predavanje {Jernej Rus} {Characterization of graphs admitting stable traces} {} {25.~4.} {}
  \predavanje {David Gajser} {Neodlo�ljivi problemi brez prevedb} {} {9.~5.} {}
  \predavanje {Primo� �kraba} {Parallelization: Distributed algorithms for persistence} {} {16.~5.} {}
  \predavanje {Ross Churchley} {Tree-transverse matchings and local consistency} {} {23.~5.} {}
  \predavanje {Bojan Mohar} {Median eigenvalues} {} {30.~5.} {}
  \predavanje {Ga�per Ko�mrlj} {3 problems of domination game} {} {6.~6.} {}
  \predavanje {Riste �krekovski} {On Wiener index of iterated line graphs of trees} {} {10.~10.} {}
  \predavanje {Petra �igert Pleter�ek} {Fibonacci and Lucas cubes in chemical graph theory} {} {17.~10.} {}
  \predavanje {Jernej Azarija} {Tutte polynomials and a stronger version of the Akiyama-Harary problem} {} {24.~10.} {}
  \predavanje {Martin Milani�} {Induced subtrees in interval graphs} {} {7.~11.} {}
  \predavanje {Jelena Govor�in} {New weighted measure of the betweenness centrality and its extremal values} {} {14.~11.} {}
  \predavanje {Vida Vuka�inovi�} {Networks and large graphs in advanced applications} {} {21.~11.} {}
  \predavanje {Tanja Gologranc} {Bucolic complexes} {} {28.~11.} {}
  \predavanje {Reza Naseraser} {Homomorphisms of signed graphs} {} {5.~12.} {}
  \predavanje {Matja� Krnc} {Kon�na teorija modela v teoriji grafov -- osnove} {} {19.~12} {}
\end{seznam}