Statistics of DKUM

Bibliography of the person, including all types of documents, not only theses.

PhD theses (5)

1. Polona Pavlič: Algebra poti in dominantni problemi na grafovskih produktih
2. Irena Hrastnik Ladinek: Hamiltonskost kartezičnega in direktnega grafovskega svežnja
3. Rija Erveš: Povezavni, vozliščni in mešani okvarni premeri kartezičnih grafovskih produktov in svežnjev
4. Tomaž Kramberger: PROBLEM KITAJSKEGA POŠTARJA S PRIORITETNIMI VOZLIŠČI
5. Igor Pesek: UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV

MSc theses (1)

1. Darko Bečaj: Racionalizacija zbirnih in transportnih poti komunalnih vozil s pomočjo optimizacijskih metod : magistrsko delo

Other documents (59)

1. Janez Žerovnik: Principi modeliranja v logistiki
2. Iztok Banič, Janez Žerovnik: On median and quartile sets of ordered random variables
3. Ansheng Ye, Fang Miao, Zehui Shao, Jia-Bao Liu, Janez Žerovnik, Polona Repolusk: More results on the domination number of Cartesian product of two directed cycles
4. Matej Mencinger: Simetrijske grupe končnih vzorcev
5. Janez Žerovnik: Heuristics for NP-hard optimization problems
6. Polona Repolusk, Janez Žerovnik: Roman domination number of the Cartesian products of paths and cycles
7. Damir Vukičević, Janez Žerovnik: Altered Wiener indices
8. Rija Erveš, Darja Rupnik Poklukar, Janez Žerovnik: On vulnerability measures of networks
9. Blaž Zmazek, Janez Žerovnik: The Hosoya-Wiener polynomial of weighted trees
10. Ante Graovac, Damir Vukičević, Damir Ježek, Janez Žerovnik: Simplified computation of matchings in polygraphs
11. Ante Graovac, Damir Vukičević, Janez Žerovnik: On algebraic and geometric Kekulé structures in benzenoid rotagraphs
12. Ivan Gutman, Janez Žerovnik: Corroborating a modification of the Wiener index
13. Blaž Zmazek, Janez Žerovnik: Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear time
14. Janez Žerovnik: Computing the Szeged index
15. Ante Graovac, Martin Juvan, Bojan Mohar, Janez Žerovnik: Computing the determinant and the algebraic structure count in polygraphs
16. Ivan Gutman, Damir Vukičević, Janez Žerovnik: A class of modified Wiener indices
17. Wilfried Imrich, Blaž Zmazek, Janez Žerovnik: Weak k-reconstruction of Cartesian products
18. Blaž Zmazek, Janez Žerovnik: Recognizing weighted directed Cartesian graph bundles
19. Andreja Čuk, Igor Pesek, Blaž Zmazek: Slovenski i-učbeniki
20. Polona Repolusk, Janez Žerovnik: A note on the domination number of the Cartesian products of paths and cycles
21. Irena Hrastnik Ladinek, Janez Žerovnik: On connectivity and hamiltonicity of direct graph bundles
22. Irena Hrastnik Ladinek, Janez Žerovnik: Cyclic bundle Hamiltonicity
23. Petra Šparl, Janez Žerovnik: Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph
24. Sandi Klavžar, Bojan Mohar, Tomaž Pisanski, Norbert Seifter, Janez Žerovnik: Preface
25. Iztok Banič, Rija Erveš, Janez Žerovnik: The edge fault-diameter of Cartesian graph bundles
26. Ignasi Sau Walls, Janez Žerovnik: An optimal permutation routing algorithm on full-duplex hexagonal networks
27. Janez Žerovnik: Perfect codes in direct products of cycles - a complete characterization
28. Melita Gorše Pihler, Janez Žerovnik: Partial cubes are distance graphs
29. Sandi Klavžar, Simon Špacapan, Janez Žerovnik: An almost complete description of perfect codes in direct products of cycles
30. Petra Šparl, Janez Žerovnik: 2-local distributed algorithms for generalized coloring of hexagonal graphs
31. Blaž Zmazek, Janez Žerovnik: Behzad-Vizing conjecture and Cartesian-product graphs
32. Blaž Zmazek, Janez Žerovnik: On the weak reconstruction of strong product graphs
33. Janez Žerovnik: Chromatic numbers of strong product of odd cycles
34. Wilfried Imrich, Blaž Zmazek, Janez Žerovnik: Weak k-reconstruction of Cartesian products graphs
35. Blaž Zmazek, Janez Žerovnik: The obnoxious center problem on weighted cactus graphs
36. Blaž Zmazek, Janez Žerovnik: Algorithm for recognizing Cartesian graph bundles
37. Iztok Banič, Rija Erveš, Janez Žerovnik: Edge, vertex and mixed fault diameters
38. Jozef Širáň, Sangho Shim, Janez Žerovnik: A counterexample to the uniform shortest path routing conjecture for vertex-transitive graphs
39. Janez Žerovnik: Some applications of graph theory in computer networks and telecommunications
40. Petra Šparl, Janez Žerovnik: Graphs with given number of cut-edges and minimal value of Wiener number
41. Ignasi Sau Walls, Petra Šparl, Janez Žerovnik: Simpler multicoloring of triangle-free hexagonal graphs
42. Irena Hrastnik Ladinek, Janez Žerovnik: On connectedness and hamiltonicity of direct graph bundles
43. Iztok Banič, Rija Erveš, Janez Žerovnik: Edge, vertex and mixed fault-diameters
44. Janez Žerovnik, Iztok Banič, Rija Erveš: Wide and fault diameters of Cartesian graph bundles
45. Ignasi Sau Walls, Janez Žerovnik: An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
46. Iztok Banič, Janez Žerovnik: Fault-diameter of Cartesian product of graphs and Cartesian graph bundles
47. Blaž Zmazek, Janez Žerovnik: On domination numbers of graph bundles
48. Melita Gorše Pihler, Janez Žerovnik: Partial cubes are distance graphs
49. Aleksander Vesel, Janez Žerovnik: How good can ants color graphs?
50. Petra Žigert Pleteršek, Matevž Črepnjak: Matematika I : visokošolski učbenik z rešenimi nalogami
51. Iztok Banič, Janez Žerovnik: Wide diameter of Cartesian graph bundles
52. Petra Šparl, Rafał Witkowski, Janez Žerovnik: A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
53. Tomaž Kramberger, Gregor Štrubelj, Janez Žerovnik: Chinese postman problem with priority nodes
54. Tomaž Kramberger, Janez Žerovnik: A contribution to environmentally friendly winter road maintenance: : optimizing road de-icing
55. Tomaž Kramberger, Janez Žerovnik: Chinese postman problem with priorities (high cost of delays)
56. Iztok Banič, Janez Žerovnik: The fault-diameter of Cartesian products
57. Petra Šparl, Janez Žerovnik: 2-local 3/4-competitive algorithm for multicoloring hexagonal graphs
58. Petra Šparl, Janez Žerovnik: A note on n-tuple colourings and circular colourings of planar graphs with large odd girth
59. Ivan Gerlič, Robert Repnik, Nataša Bukovec: Analiza stanja naravoslovne pismenosti po šolski vertikali (01. 10. 2008-31. 12. 2008) : projekt: Razvoj naravoslovnih kompetenc (št. 3311-08-986011)