A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. - Janez Zerovnik (Inf. Process. Lett., 1989)

A parallel variant of a heuristical algorithm for graph colouring. - Janez Zerovnik (Parallel Comput., 1990)

On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem. - Janez Zerovnik (ACPC, 1991)

Distributed simulation of coloring graph vertices. - Milan E. Soklic; Janez Zerovnik (Annual Simulation Symposium, 1991)

A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication). - Janez Zerovnik; M. Kaufman (Parallel Comput., 1992)

A counterexample to conjecture of Barefoot, Harary, and Jones. - Janez Zerovnik; Jolana Oplerova (Graphs Comb., 1993)

Regular Graphs Are 'Difficult' For Colouring. - Janez Zerovnik (Informatica (Slovenia), 1993)

Computing the Diameter in Multiple-Loop Networks. - Janez Zerovnik; Tomaz Pisanski (J. Algorithms, 1993)

A randomized algorithm for k-colorability. - Janez Zerovnik (Discret. Math., 1994)

Weights on Edges of Chemical Graphs Determined by Paths. - Tomaz Pisanski; Janez Zerovnik (J. Chem. Inf. Comput. Sci., 1994)

Fast computation of the Wiener index of fasciagraphs and rotagraphs. - Martin Juvan; Bojan Mohar; Ante Graovac; Sandi Klavzar; Janez Zerovnik (J. Chem. Inf. Comput. Sci., 1995)

Recognizing Graph Products and Bundles. - Janez Zerovnik (SOFSEM, 1996)

Algebraic Approach to Fasciagraphs and Rotagraphs. - Sandi Klavzar; Janez Zerovnik (Discret. Appl. Math., 1996)

On the weak reconstruction of Cartesian-product graphs. - Wilfried Imrich; Janez Zerovnik (Discret. Math., 1996)

Distance-related Invariants on Polygraphs. - Martin Juvan; Bojan Mohar; Janez Zerovnik (Discret. Appl. Math., 1997)

Recognizing Cartesian graph bundles. - Wilfried Imrich; Tomaz Pisanski; Janez Zerovnik (Discret. Math., 1997)

A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra. - Patrick W. Fowler; Tomaz Pisanski; Ante Graovac; Janez Zerovnik (Discrete Mathematical Chemistry, 1998)

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

The independence number of the strong product of odd cycles. - Aleksander Vesel; Janez Zerovnik (Discret. Math., 1998)

Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. - Janez Zerovnik (FCT, 1999)

Szeged Index of Symmetric Graphs. - Janez Zerovnik (J. Chem. Inf. Comput. Sci., 1999)

Graph Colouring by Maximal Evidence Edge Adding. - Barry Rising; John Shawe-Taylor; Janez Zerovnik (PATAT, 2000)

Minimum 2-terminal Routing in 2-jump Circulant Graphs. - Borut Robic; Janez Zerovnik (Comput. Artif. Intell., 2000)

Recognizing weighted directed cartesian graph bundles. - Blaz Zmazek; Janez Zerovnik (Discuss. Math. Graph Theory, 2000)

On the linear K-arboricity of cubic graphs. - Aleksander Vesel; Janez Zerovnik (Int. J. Comput. Math., 2000)

On recognizing Cartesian graph bundles. - Blaz Zmazek; Janez Zerovnik (Discret. Math., 2001)

Weak k-reconstruction of cartesian product graphs. - Wilfried Imrich; Blaz Zniazek; Janez Zerovnik (Electron. Notes Discret. Math., 2001)

The obnoxious center problem on weighted cactus graphs (Extended Abstract). - Blaz Zmazek; Janez Zerovnik (Electron. Notes Discret. Math., 2001)

An algorithm for K-convex closure and an application. - Tomaz Pisanski; Blaz Zmazek; Janez Zerovnik (Int. J. Comput. Math., 2001)

Behzad-Vizing conjecture and Cartesian-product graphs. - Blaz Zmazek; Janez Zerovnik (Appl. Math. Lett., 2002)

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. - Sangho Shim; Jozef Sirán; Janez Zerovnik (Discret. Appl. Math., 2002)

Algorithm for recognizing Cartesian graph bundles. - Blaz Zmazek; Janez Zerovnik (Discret. Appl. Math., 2002)

Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. - Frédéric Havet; Janez Zerovnik (Discret. Math., 2002)

Unique square property and fundamental factorizations of graph bundles. - Blaz Zmazek; Janez Zerovnik (Discret. Math., 2002)

Chromatic numbers of the strong product of odd cycles. - Janez Zerovnik (Electron. Notes Discret. Math., 2002)

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

Improved lower bound on the Shannon capacity of C7. - Aleksander Vesel; Janez Zerovnik (Inf. Process. Lett., 2002)

Weak k-reconstruction of Cartesian products. - Wilfried Imrich; Blaz Zmazek; Janez Zerovnik (Discuss. Math. Graph Theory, 2003)

Preface. - Sandi Klavzar; Bojan Mohar; Tomaz Pisanski; Norbert Seifter; Janez Zerovnik (Discuss. Math. Graph Theory, 2003)

On the Weak Reconstruction of Strong Product Graphs. - Blaz Zmazek; Janez Zerovnik (Electron. Notes Discret. Math., 2003)

Permutation routing in double-loop networks: design and empirical evaluation. - Tomaz Dobravec; Borut Robic; Janez Zerovnik (J. Syst. Archit., 2003)

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

The obnoxious center problem on weighted cactus graphs. - Blaz Zmazek; Janez Zerovnik (Discret. Appl. Math., 2004)

Homomorphisms of hexagonal graphs to odd cycles. - Petra Sparl; Janez Zerovnik (Discret. Math., 2004)

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

Mixture of Vector Experts. - Matthew Henderson; John Shawe-Taylor; Janez Zerovnik (ALT, 2005)

Estimating the Traffic on Weighted Cactus Networks in Linear Time. - Blaz Zmazek; Janez Zerovnik (IV, 2005)

2-local distributed algorithms for generalized coloring of hexagonal graphs. - Petra Sparl; Janez Zerovnik (Electron. Notes Discret. Math., 2005)

2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. - Petra Sparl; Janez Zerovnik (J. Algorithms, 2005)

Fault-diameter of generalized Cartesian products. - Iztok Banic; Janez Zerovnik (ICDCS Workshops, 2006)

An almost complete description of perfect codes in direct products of cycles. - Sandi Klavzar; Simon Spacapan; Janez Zerovnik (Adv. Appl. Math., 2006)

New formulas for the pentomino exclusion problem. - Janez Zerovnik (Australas. J Comb., 2006)

Fault-diameter of Cartesian graph bundles. - Iztok Banic; Janez Zerovnik (Inf. Process. Lett., 2006)

An optimal message routing algorithm for circulant networks. - Tomaz Dobravec; Janez Zerovnik; Borut Robic (J. Syst. Archit., 2006)

Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. - Igor Pesek; Andrea Schaerf; Janez Zerovnik (Hybrid Metaheuristics, 2007)

Edge Fault-Diameter of Cartesian Product of Graphs. - Iztok Banic; Janez Zerovnik (SIROCCO, 2007)

Best insertion algorithm for resource-constrained project scheduling problem - Igor Pesek; Janez Zerovnik (CoRR, 2007)

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

The fault-diameter of Cartesian products. - Iztok Banic; Janez Zerovnik (Adv. Appl. Math., 2008)

Perfect codes in direct products of cycles - a complete characterization. - Janez Zerovnik (Adv. Appl. Math., 2008)

Partial cubes are distance graphs. - Melita Gorse Pihler; Janez Zerovnik (Discret. Math., 2008)

An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. - Janez Zerovnik; Ignasi Sau (Discret. Math. Theor. Comput. Sci., 2008)

Edge, vertex and mixed fault diameters. - Iztok Banic; Rija Erves; Janez Zerovnik (Adv. Appl. Math., 2009)

Edge-contributions of some topological indices and arboreality of molecular graphs. - Tomaz Pisanski; Janez Zerovnik (Ars Math. Contemp., 2009)

Hamilton cycles in graph bundles over a cycle with tree as a fibre. - Tomaz Pisanski; Janez Zerovnik (Discret. Math., 2009)

The edge fault-diameter of Cartesian graph bundles. - Iztok Banic; Rija Erves; Janez Zerovnik (Eur. J. Comb., 2009)

(l, k)-ROUTING ON PLANE GRIDS. - Florian Huc; Ignasi Sau; Janez Zerovnik (J. Interconnect. Networks, 2009)

Permutation Routing and (ℓ, k)-Routing on Plane Grids. - Ignasi Sau; Janez Zerovnik (Graphs and Algorithms in Communication Networks, 2010)

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

Wide diameter of Cartesian graph bundles. - Iztok Banic; Janez Zerovnik (Discret. Math., 2010)

1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. - Rafal Witkowski; Janez Zerovnik (Electron. Notes Discret. Math., 2010)

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

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

Editorial. - Tibor Csendes; Janez Povh; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2011)

Constructive heuristics for the canister filling problem. - Gasper Zerovnik; Janez Zerovnik (Central Eur. J. Oper. Res., 2011)

A Constant Time Algorithm for Domination Problems on Polygraphs. - Polona Pavlic; Janez Zerovnik (CTW, 2012)

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

Roman Domination Number of the Cartesian Products of Paths and Cycles. - Polona Pavlic; Janez Zerovnik (Electron. J. Comb., 2012)

Simpler multicoloring of triangle-free hexagonal graphs. - Ignasi Sau; Petra Sparl; Janez Zerovnik (Discret. Math., 2012)

Cyclic bundle Hamiltonicity. - Irena Hrastnik Ladinek; Janez Zerovnik (Int. J. Comput. Math., 2012)

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

Preface. - Shay Kutten; Janez Zerovnik (Theor. Comput. Sci., 2012)

GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance. - Tomaz Kramberger; Janez Zerovnik; Gregor Strubelj; Klemen Prah (Central Eur. J. Oper. Res., 2013)

Mixed fault diameter of Cartesian graph bundles. - Rija Erves; Janez Zerovnik (Discret. Appl. Math., 2013)

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. - Rafal Witkowski; Janez Zerovnik (Discret. Math. Theor. Comput. Sci., 2013)

Wide-diameter of Product Graphs. - Rija Erves; Janez Zerovnik (Fundam. Informaticae, 2013)

On rainbow domination numbers of graphs. - Zehui Shao; Meilian Liang; Chuang Yin; Xiaodong Xu 006; Polona Pavlic; Janez Zerovnik (Inf. Sci., 2014)

Mixed fault diameter of Cartesian graph bundles II. - Rija Erves; Janez Zerovnik (Ars Math. Contemp., 2015)

Editorial. - Tibor Csendes; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2015)

Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. - Rija Erves; Janez Zerovnik (Discret. Appl. Math., 2015)

Heuristics for Optimization of LED Spatial Light Distribution Model. - David Kaljun; Darja Rupnik Poklukar; Janez Zerovnik (Informatica (Slovenia), 2015)

Perfect codes in direct graph bundles. - Irena Hrastnik Ladinek; Janez Zerovnik (Inf. Process. Lett., 2015)

Mixed connectivity of Cartesian graph products and bundles. - Rija Erves; Janez Zerovnik (Ars Comb., 2016)

Multicoloring of cannonball graphs. - Petra Sparl; Rafal Witkowski; Janez Zerovnik (Ars Math. Contemp., 2016)

Petra Šparl (1975-2016). - Janez Zerovnik (Ars Math. Contemp., 2016)

Using Newton's method to model a spatial light distribution of a LED with attached secondary optics. - David Kaljun; Joze Petrisic; Janez Zerovnik (CoRR, 2016)

Weighted domination number of cactus graphs. - Tina Novak; Janez Zerovnik (CoRR, 2016)

Reliability Hosoya-Wiener Polynomial of Double Weighted Trees. - Darja Rupnik Poklukar; Janez Zerovnik (Fundam. Informaticae, 2016)

Local Search with Discrete Event Simulation for the Job Shop Scheduling Problem. - Hugo Zupan; Janez Zerovnik; Niko Herakovic (SOHOMA, 2017)

Editorial. - Janez Povh; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2017)

Broadcasting on cactus graphs. - Maja Cevnik; Janez Zerovnik (J. Comb. Optim., 2017)

Discharging Approach for Double Roman Domination in Graphs. - Zehui Shao; Pu Wu; Huiqin Jiang; Zepeng Li; Janez Zerovnik; Xiujun Zhang (IEEE Access, 2018)

Formulas for various domination numbers of products of paths and cycles. - Polona Repolusk; Janez Zerovnik (Ars Comb., 2018)

The Hosoya polynomial of double weighted graphs. - Tina Novak; Darja Rupnik Poklukar; Janez Zerovnik (Ars Math. Contemp., 2018)

On 2-rainbow domination of generalized Petersen graphs. - Zehui Shao; Huiqin Jiang; Pu Wu; Shaohui Wang; Janez Zerovnik; Xiaosong Zhang 001; Jia-Bao Liu (Discret. Appl. Math., 2019)

Networks with Extremal Closeness. - Darja Rupnik Poklukar; Janez Zerovnik (Fundam. Informaticae, 2019)

A stochastic model for better planning of product flow in retail supply chains. - Tea Vizinger; Janez Zerovnik (J. Oper. Res. Soc., 2019)

On median and quartile sets of ordered random variables. - Iztok Banic; Janez Zerovnik (Art Discret. Appl. Math., 2020)

Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR. - Andrej Kastrin; Janez Povh; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2021)

On sufficient properties of sufficient matrices. - Janez Povh; Janez Zerovnik (Central Eur. J. Oper. Res., 2021)

Real forms of the complex Neumann system: A method for finding real roots of polynomial US(λ). - Tina Novak; Janez Zerovnik (J. Comput. Appl. Math., 2021)

On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k, k). - Rija Erves; Janez Zerovnik (Symmetry, 2021)

On 3-Rainbow Domination Number of Generalized Petersen Graphs P(6k, k). - Rija Erves; Janez Zerovnik (Symmetry, 2021)

Double Roman Domination in Generalized Petersen Graphs P(ck, k). - Darja Rupnik Poklukar; Janez Zerovnik (Symmetry, 2022)

On Three-Rainbow Dominationof Generalized Petersen Graphs P(ck, k). - Darja Rupnik Poklukar; Janez Zerovnik (Symmetry, 2022)

Clustering as a dual problem to colouring. - Barbara Ikica; Bostjan Gabrovsek; Janez Povh; Janez Zerovnik (Comput. Appl. Math., 2022)

A Linear Time Algorithm for Weighted k-Fair Domination Problem in Cactus Graphs. - Tina Novak; Janez Zerovnik (Oper. Res. Forum, 2022)

On the 2-rainbow independent domination numbers of some graphs. - Bostjan Gabrovsek; Aljosa Peperko; Janez Zerovnik (Central Eur. J. Oper. Res., 2023)

60 years of OR in Slovenia: development from a first conference to a vibrant community. - Janez Povh; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2023)

Rainbow domination regular graphs that are not vertex transitive. - Janez Zerovnik (Discret. Appl. Math., 2024)

Sufficient Matrices: Properties, Generating and Testing. - Marianna E.-Nagy; Tibor Illés; Janez Povh; Anita Varga; Janez Zerovnik (J. Optim. Theory Appl., 2024)

The 2-rainbow domination number of Cartesian product of cycles. - Simon Brezovnik; Darja Rupnik Poklukar; Janez Zerovnik (Ars Math. Contemp., 2025)

On 2-domination and 2-rainbow domination of cylindrical graphs. - Janez Zerovnik (Comput. Appl. Math., 2025)

The 2-rainbow domination number of Cartesian bundles over cycles. - Simon Brezovnik; Darja Rupnik Poklukar; Janez Zerovnik (Central Eur. J. Oper. Res., 2025)

Recent theoretical and practical contributions to the OR environment and CEJOR from the perspective of SSI-SOR. - Janez Povh; Lidija Zadnik Stirn; Janez Zerovnik (Central Eur. J. Oper. Res., 2025)