Janez Zerovnik

Rija Erves, Janez Zerovnik: Mixed fault diameter of Cartesian graph bundles. Discrete Applied Mathematics 161(12): 1726-1733 (2013)

Petra Sparl, Rafal Witkowski, Janez Zerovnik: 1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 64(4): 564-583 (2012)

Ignasi Sau, Petra Sparl, Janez Zerovnik: Simpler multicoloring of triangle-free hexagonal graphs. Discrete Mathematics 312(1): 181-187 (2012)

Irena Hrastnik Ladinek, Janez Zerovnik: Cyclic bundle Hamiltonicity. Int. J. Comput. Math. 89(2): 129-136 (2012)

Petra Sparl, Rafal Witkowski, Janez Zerovnik: A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs. Inf. Process. Lett. 112(14-15): 567-571 (2012)

Shay Kutten, Janez Zerovnik: Preface. Theor. Comput. Sci. 444: 1-2 (2012)

Polona Pavlic, Janez Zerovnik: A Constant Time Algorithm for Domination Problems on Polygraphs. CTW 2012: 205-209

Janez Zerovnik, Rija Erves: Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. CoRR abs/1212.4670 (2012)

Rafal Witkowski, Janez Zerovnik: 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs. WAW 2011: 74-84

Iztok Banic, Janez Zerovnik: Wide diameter of Cartesian graph bundles. Discrete Mathematics 310(12): 1697-1701 (2010)

Rafal Witkowski, Janez Zerovnik: 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. Electronic Notes in Discrete Mathematics 36: 375-382 (2010)

Petra Sparl, Janez Zerovnik: 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs. Int. J. Comput. Math. 87(9): 2003-2013 (2010)

Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik: Oriented Networks Design Problem. J. Inf. Sci. Eng. 26(4): 1231-1242 (2010)

Rija Erves, Janez Zerovnik: Mixed Connectivity of Cartesian Graph Products and Bundles. CTW 2010: 141-144

Maja Rotovnik, Janez Zerovnik: Wide - Sense Nonblocking logd(N; 0; p) Networks. CTW 2010: 145-148

Shay Kutten, Janez Zerovnik (Eds.): Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5869, Springer 2010, isbn 978-3-642-11475-5

Tomaz Pisanski, Janez Zerovnik: Hamilton cycles in graph bundles over a cycle with tree as a fibre. Discrete Mathematics 309(17): 5432-5436 (2009)

Iztok Banic, Rija Erves, Janez Zerovnik: The edge fault-diameter of Cartesian graph bundles. Eur. J. Comb. 30(5): 1054-1061 (2009)

Florian Huc, Ignasi Sau, Janez Zerovnik: (l, k)-ROUTING ON PLANE GRIDS. Journal of Interconnection Networks 10(1-2): 27-57 (2009)

Melita Gorse Pihler, Janez Zerovnik: Partial cubes are distance graphs. Discrete Mathematics 308(5-6): 820-826 (2008)

Janez Zerovnik, Ignasi Sau: An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)

Iztok Banic, Rija Erves, Janez Zerovnik: Edge fault-diameter of Cartesian graph bundles. CTW 2008: 144-147

Blaz Zmazek, Janez Zerovnik: Weak reconstruction of strong product graphs. Discrete Mathematics 307(3-5): 641-649 (2007)

Petra Sparl, Janez Zerovnik: A note on n-tuple colourings and circular colourings of planar graphs with large odd girth. Int. J. Comput. Math. 84(12): 1743-1746 (2007)

Igor Pesek, Andrea Schaerf, Janez Zerovnik: Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics 2007: 57-68

Iztok Banic, Janez Zerovnik: Edge Fault-Diameter of Cartesian Product of Graphs. SIROCCO 2007: 234-245

Igor Pesek, Janez Zerovnik: Best insertion algorithm for resource-constrained project scheduling problem. CoRR abs/0705.2137 (2007)

Iztok Banic, Janez Zerovnik: Fault-diameter of Cartesian graph bundles. Inf. Process. Lett. 100(2): 47-51 (2006)

Tomaz Dobravec, Janez Zerovnik, Borut Robic: An optimal message routing algorithm for circulant networks. Journal of Systems Architecture 52(5): 298-306 (2006)

Iztok Banic, Janez Zerovnik: Fault-diameter of generalized Cartesian products. ICDCS Workshops 2006: 3

Petra Sparl, Janez Zerovnik: 2-local distributed algorithms for generalized coloring of hexagonal graphs. Electronic Notes in Discrete Mathematics 22: 321-325 (2005)

Petra Sparl, Janez Zerovnik: 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1): 29-41 (2005)

Matthew Henderson, John Shawe-Taylor, Janez Zerovnik: Mixture of Vector Experts. ALT 2005: 386-398

Blaz Zmazek, Janez Zerovnik: Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV 2005: 536-541

Blaz Zmazek, Janez Zerovnik: The obnoxious center problem on weighted cactus graphs. Discrete Applied Mathematics 136(2-3): 377-386 (2004)

Petra Sparl, Janez Zerovnik: Homomorphisms of hexagonal graphs to odd cycles. Discrete Mathematics 283(1-3): 273-277 (2004)

Blaz Zmazek, Janez Zerovnik: Behzad-Vizing conjecture and Cartesian product graphs. Electronic Notes in Discrete Mathematics 17: 297-300 (2004)

Petra Sparl, Janez Zerovnik: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inf. Process. Lett. 90(5): 239-246 (2004)

Blaz Zmazek, Janez Zerovnik: Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW 2004: 257-260

Claude Chaudet, Isabelle Guérin Lassous, Janez Zerovnik: A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks. WONS 2004: 101-115

Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik: Preface. Discussiones Mathematicae Graph Theory 23(2): 205 (2003)

Wilfried Imrich, Blaz Zmazek, Janez Zerovnik: Weak k-reconstruction of Cartesian products. Discussiones Mathematicae Graph Theory 23(2): 273-285 (2003)

Blaz Zmazek, Janez Zerovnik: On the Weak Reconstruction of Strong Product Graphs. Electronic Notes in Discrete Mathematics 13: 123-127 (2003)

Tomaz Dobravec, Borut Robic, Janez Zerovnik: Permutation routing in double-loop networks: design and empirical evaluation. Journal of Systems Architecture 48(13-15): 387-402 (2003)

Blaz Zmazek, Janez Zerovnik: Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6): 781-784 (2002)

Sangho Shim, Jozef Sirán, Janez Zerovnik: Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discrete Applied Mathematics 119(3): 281-286 (2002)

Blaz Zmazek, Janez Zerovnik: Algorithm for recognizing Cartesian graph bundles. Discrete Applied Mathematics 120(1-3): 275-302 (2002)

Frédéric Havet, Janez Zerovnik: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discrete Mathematics 244(1-3): 103-108 (2002)

Blaz Zmazek, Janez Zerovnik: Unique square property and fundamental factorizations of graph bundles. Discrete Mathematics 244(1-3): 551-561 (2002)

Janez Zerovnik: Chromatic numbers of the strong product of odd cycles. Electronic Notes in Discrete Mathematics 11: 647-652 (2002)

Alain Bretto, Stéphane Ubéda, Janez Zerovnik: A polynomial algorithm for the strong Helly property. Inf. Process. Lett. 81(1): 55-57 (2002)

Aleksander Vesel, Janez Zerovnik: Improved lower bound on the Shannon capacity of C7. Inf. Process. Lett. 81(5): 277-282 (2002)

Blaz Zmazek, Janez Zerovnik: On recognizing Cartesian graph bundles. Discrete Mathematics 233(1-3): 381-391 (2001)

Blaz Zmazek, Janez Zerovnik: The obnoxious center problem on weighted cactus graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 8: 133-136 (2001)

Wilfried Imrich, Blaz Zniazek, Janez Zerovnik: Weak k-reconstruction of cartesian product graphs. Electronic Notes in Discrete Mathematics 10: 297-300 (2001)

Borut Robic, Janez Zerovnik: Minimum 2-terminal Routing in 2-jump Circulant Graphs. Computers and Artificial Intelligence 19(1) (2000)

Blaz Zmazek, Janez Zerovnik: Recognizing weighted directed cartesian graph bundles. Discussiones Mathematicae Graph Theory 20(1): 39-56 (2000)

Barry Rising, John Shawe-Taylor, Janez Zerovnik: Graph Colouring by Maximal Evidence Edge Adding. PATAT 2000: 294-308

Blaz Zmazek, Janez Zerovnik: Algorithm for Recognizing Cartesian Graph Bundles. Electronic Notes in Discrete Mathematics 3: 217-221 (1999)

Janez Zerovnik: Szeged Index of Symmetric Graphs. Journal of Chemical Information and Computer Sciences 39(1): 77-80 (1999)

Janez Zerovnik: Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. FCT 1999: 559-568

Aleksander Vesel, Janez Zerovnik: The independence number of the strong product of odd cycles. Discrete Mathematics 182(1-3): 333-336 (1998)

Barry Rising, Max van Daalen, John Shawe-Taylor, Peter Burge, Janez Zerovnik: A Neural Accelerator for Graph Colouring Based on an Edge Adding Technique. NC 1998: 652-656

Martin Juvan, Bojan Mohar, Janez Zerovnik: Distance-related Invariants on Polygraphs. Discrete Applied Mathematics 80(1): 57-71 (1997)

Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik: Recognizing Cartesian graph bundles. Discrete Mathematics 167-168: 393-403 (1997)

Sandi Klavzar, Janez Zerovnik: Algebraic Approach to Fasciagraphs and Rotagraphs. Discrete Applied Mathematics 68(1-2): 93-100 (1996)

Wilfried Imrich, Janez Zerovnik: On the weak reconstruction of Cartesian-product graphs. Discrete Mathematics 150(1-3): 167-178 (1996)

Janez Zerovnik: Recognizing Graph Products and Bundles. SOFSEM 1996: 467-474

Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik: Fast computation of the Wiener index of fasciagraphs and rotagraphs. Journal of Chemical Information and Computer Sciences 35(5): 834-840 (1995)

Janez Zerovnik: A randomized algorithm for k-colorability. Discrete Mathematics 131(1-3): 379-393 (1994)

Tomaz Pisanski, Janez Zerovnik: Weights on Edges of Chemical Graphs Determined by Paths. Journal of Chemical Information and Computer Sciences 34(2): 395-397 (1994)

Janez Zerovnik, Jolana Oplerova: A counterexample to conjecture of Barefoot, Harary, and Jones. Graphs and Combinatorics 9(2-4): 205-207 (1993)

Janez Zerovnik: Regular Graphs Are 'Difficult' For Colouring. Informatica (Slovenia) 17(1) (1993)

Janez Zerovnik, Tomaz Pisanski: Computing the Diameter in Multiple-Loop Networks. J. Algorithms 14(2): 226-243 (1993)

Janez Zerovnik, M. Kaufman: A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication). Parallel Computing 18(8): 897-900 (1992)

Janez Zerovnik: On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem. ACPC 1991: 359-368

Milan E. Soklic, Janez Zerovnik: Distributed simulation of coloring graph vertices. Annual Simulation Symposium 1991: 118-122

Janez Zerovnik: A parallel variant of a heuristical algorithm for graph colouring. Parallel Computing 13(1): 95-100 (1990)

Janez Zerovnik: A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. Inf. Process. Lett. 33(4): 213-219 (1989)