Two remote seminar lectures by Govorčin & Škrekovski
Thursday 24.11.2011, 12:15, we have two remote seminar lectures:
I. Govorčin: Line graph operator and small worlds, Sejna soba, Fakulteta za informacijske študije, Novi trg 5, Novo mesto.
II. Škrekovski: Some results on fullerene graphs, w sali 5870, Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, POLAND
Graph theory and algorithms seminar
23. 11. 2011
Riste Škrekovski: Some results on fullerene graphs
Četrtek 17. 11. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
14. 11. 2011
Ta teden seminar odpade!
Graph theory and algorithms seminar
7. 11. 2011
Nino Bašić: Characterization of convexity in hexagonal systems via 3-tree embedding
Četrtek 3. 11. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
1. 11. 2011
Matias Korman: Computing a visibility polygon using few variables
Četrtek 27. 10. 2011 ob 12:20 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
24. 10. 2011
Matjaž Krnc: Fulereni
Četrtek 20. 10. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
17. 10. 2011
Jernej Azarija: Euler's idoneal numbers, prime partitions and two problems related to the number of spanning trees
Četrtek 13. 10. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
9. 10. 2011
Jan Volec: Extending fractional precolorings
Četrtek 6. 10. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
4. 10. 2011
Govorčin Jelena: Random Walk Betweenness
Četrtek 22.9.2011 ob 13:00, lokacija: Fakulteta za informacijske študije, Novi trg 5, Novo mesto. predavalnica P2
Graph theory and algorithms seminar
19. 9. 2011
Borut Lužar: Acyclic Edge Colorings and Related Topics
Četrtek 26. 5. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
24. 5. 2011
Vesna Andova: Zagreb indices (in)equality
Četrtek 19. 5. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
16. 5. 2011
Miha Jejčič: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
Četrtek 12. 5. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
10. 5. 2011
Primož Škraba: Analyzing Dynamical Systems with Computational Topology
Četrtek 5. 5. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
4. 5. 2011
Sergey Shpectorov: On the generalized octagon of order (2,4)
Četrtek 21. 4. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
19. 4. 2011
Sandi Klavžar: Stari in novi rezultati o Fibonaccijevih kockah II
Četrtek 14. 4. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
12. 4. 2011
Sandi Klavžar: Stari in novi rezultati o Fibonaccijevih kockah
Četrtek 7. 4. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
4. 4. 2011
Herbert Edelsbunner: Features and ghosts in Gaussian convolution
Četrtek 31. 3. 2011 ob 16:15 (!!) v predavalnici 2.02 na Jadranski 21, skupaj z kolokvijem.
Graph theory and algorithms seminar
29. 3. 2011
Janez Povh: Graph coloring based on clique Theta function
Četrtek 24. 3. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21.
Graph theory and algorithms seminar
22. 3. 2011
Gašper Fijavž: 5th color is only needed once
Četrtek 10. 3. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
8. 3. 2011
Sergio Cabello: Euclidean minimum spanning trees with few uncertain regions
Četrtek 3. 3. 2011 ob 12:15 v predavalnici 3.05 na Jadranski 21
Graph theory and algorithms seminar
1. 3. 2011
