Janez Zerovnik

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 35

Top Venues

Central Eur. J. Oper. Res.

Symmetry

Ars Math. Contemp.

Discret. Appl. Math.

Publications

Janez Zerovnik
Rainbow domination regular graphs that are not vertex transitive. Discret. Appl. Math. 349 (2024)
Marianna E.-Nagy, Tibor Illés, Janez Povh, Anita Varga, Janez Zerovnik
Sufficient Matrices: Properties, Generating and Testing. J. Optim. Theory Appl. 202 (1) (2024)
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
60 years of OR in Slovenia: development from a first conference to a vibrant community. Central Eur. J. Oper. Res. 31 (3) (2023)
Bostjan Gabrovsek, Aljosa Peperko, Janez Zerovnik
On the 2-rainbow independent domination numbers of some graphs. Central Eur. J. Oper. Res. 31 (3) (2023)
Barbara Ikica, Bostjan Gabrovsek, Janez Povh, Janez Zerovnik
Clustering as a dual problem to colouring. Comput. Appl. Math. 41 (4) (2022)
Darja Rupnik Poklukar, Janez Zerovnik
Double Roman Domination in Generalized Petersen Graphs P(ck, k). Symmetry 14 (6) (2022)
Tina Novak, Janez Zerovnik
A Linear Time Algorithm for Weighted k-Fair Domination Problem in Cactus Graphs. Oper. Res. Forum 3 (3) (2022)
Darja Rupnik Poklukar, Janez Zerovnik
On Three-Rainbow Dominationof Generalized Petersen Graphs P(ck, k). Symmetry 14 (10) (2022)
Janez Povh, Janez Zerovnik
On sufficient properties of sufficient matrices. Central Eur. J. Oper. Res. 29 (3) (2021)
Andrej Kastrin, Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR. Central Eur. J. Oper. Res. 29 (3) (2021)
Rija Erves, Janez Zerovnik
On 3-Rainbow Domination Number of Generalized Petersen Graphs P(6k, k). Symmetry 13 (10) (2021)
Tina Novak, Janez Zerovnik
Real forms of the complex Neumann system: A method for finding real roots of polynomial US(λ). J. Comput. Appl. Math. 390 (2021)
Rija Erves, Janez Zerovnik
On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k, k). Symmetry 13 (5) (2021)
Iztok Banic, Janez Zerovnik
On median and quartile sets of ordered random variables. Art Discret. Appl. Math. 3 (2) (2020)
Zehui Shao, Huiqin Jiang, Pu Wu, Shaohui Wang, Janez Zerovnik, Xiaosong Zhang, Jia-Bao Liu
On 2-rainbow domination of generalized Petersen graphs. Discret. Appl. Math. 257 (2019)
Tea Vizinger, Janez Zerovnik
A stochastic model for better planning of product flow in retail supply chains. J. Oper. Res. Soc. 70 (11) (2019)
Darja Rupnik Poklukar, Janez Zerovnik
Networks with Extremal Closeness. Fundam. Informaticae 167 (3) (2019)
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 27 (3) (2019)
Zehui Shao, Pu Wu, Huiqin Jiang, Zepeng Li, Janez Zerovnik, Xiujun Zhang
Discharging Approach for Double Roman Domination in Graphs. IEEE Access 6 (2018)
Polona Repolusk, Janez Zerovnik
Formulas for various domination numbers of products of paths and cycles. Ars Comb. 137 (2018)
Tina Novak, Darja Rupnik Poklukar, Janez Zerovnik
The Hosoya polynomial of double weighted graphs. Ars Math. Contemp. 15 (2) (2018)
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 25 (3) (2017)
Hugo Zupan, Janez Zerovnik, Niko Herakovic
Local Search with Discrete Event Simulation for the Job Shop Scheduling Problem. SOHOMA (2017)
Maja Cevnik, Janez Zerovnik
Broadcasting on cactus graphs. J. Comb. Optim. 33 (1) (2017)
Tina Novak, Janez Zerovnik
Weighted domination number of cactus graphs. CoRR (2016)
Rija Erves, Janez Zerovnik
Mixed connectivity of Cartesian graph products and bundles. Ars Comb. 124 (2016)
Darja Rupnik Poklukar, Janez Zerovnik
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees. Fundam. Informaticae 147 (4) (2016)
Petra Sparl, Rafal Witkowski, Janez Zerovnik
Multicoloring of cannonball graphs. Ars Math. Contemp. 10 (1) (2016)
Janez Zerovnik
Petra Šparl (1975-2016). Ars Math. Contemp. 11 (1) (2016)
David Kaljun, Joze Petrisic, Janez Zerovnik
Using Newton's method to model a spatial light distribution of a LED with attached secondary optics. CoRR (2016)
Rija Erves, Janez Zerovnik
Mixed fault diameter of Cartesian graph bundles II. Ars Math. Contemp. 8 (2) (2015)
Irena Hrastnik Ladinek, Janez Zerovnik
Perfect codes in direct graph bundles. Inf. Process. Lett. 115 (9) (2015)
Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 23 (3) (2015)
Rija Erves, Janez Zerovnik
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. Discret. Appl. Math. 181 (2015)
David Kaljun, Darja Rupnik Poklukar, Janez Zerovnik
Heuristics for Optimization of LED Spatial Light Distribution Model. Informatica (Slovenia) 39 (2) (2015)
Zehui Shao, Meilian Liang, Chuang Yin, Xiaodong Xu, Polona Pavlic, Janez Zerovnik
On rainbow domination numbers of graphs. Inf. Sci. 254 (2014)
Rafal Witkowski, Janez Zerovnik
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. Discret. Math. Theor. Comput. Sci. 15 (3) (2013)
Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 21 (Supplement-1) (2013)
Rija Erves, Janez Zerovnik
Wide-diameter of Product Graphs. Fundam. Informaticae 125 (2) (2013)
Tomaz Kramberger, Janez Zerovnik, Gregor Strubelj, Klemen Prah
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance. Central Eur. J. Oper. Res. 21 (Supplement-1) (2013)
Rija Erves, Janez Zerovnik
Mixed fault diameter of Cartesian graph bundles. Discret. Appl. Math. 161 (12) (2013)
Janez Zerovnik, Rija Erves
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles CoRR (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) (2012)
Irena Hrastnik Ladinek, Janez Zerovnik
Cyclic bundle Hamiltonicity. Int. J. Comput. Math. 89 (2) (2012)
Polona Pavlic, Janez Zerovnik
Roman Domination Number of the Cartesian Products of Paths and Cycles. Electron. J. Comb. 19 (3) (2012)
Petra Sparl, Rafal Witkowski, Janez Zerovnik
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 64 (4) (2012)
Polona Pavlic, Janez Zerovnik
A Constant Time Algorithm for Domination Problems on Polygraphs. CTW (2012)
Ignasi Sau, Petra Sparl, Janez Zerovnik
Simpler multicoloring of triangle-free hexagonal graphs. Discret. Math. 312 (1) (2012)
Shay Kutten, Janez Zerovnik
Preface. Theor. Comput. Sci. 444 (2012)
Tibor Csendes, Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 19 (3) (2011)
Gasper Zerovnik, Janez Zerovnik
Constructive heuristics for the canister filling problem. Central Eur. J. Oper. Res. 19 (3) (2011)
Rafal Witkowski, Janez Zerovnik
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs. WAW (2011)
Maja Rotovnik, Janez Zerovnik
Wide - Sense Nonblocking logd(N; 0; p) Networks. CTW (2010)
Rija Erves, Janez Zerovnik
Mixed Connectivity of Cartesian Graph Products and Bundles. CTW (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) (2010)
Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik
Oriented Networks Design Problem. J. Inf. Sci. Eng. 26 (4) (2010)
Rafal Witkowski, Janez Zerovnik
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. Electron. Notes Discret. Math. 36 (2010)
Iztok Banic, Janez Zerovnik
Wide diameter of Cartesian graph bundles. Discret. Math. 310 (12) (2010)
Iztok Banic, Rija Erves, Janez Zerovnik
Edge, vertex and mixed fault diameters. Adv. Appl. Math. 43 (3) (2009)
Tomaz Pisanski, Janez Zerovnik
Edge-contributions of some topological indices and arboreality of molecular graphs. Ars Math. Contemp. 2 (1) (2009)
Iztok Banic, Rija Erves, Janez Zerovnik
The edge fault-diameter of Cartesian graph bundles. Eur. J. Comb. 30 (5) (2009)
Florian Huc, Ignasi Sau, Janez Zerovnik
, k)-ROUTING ON PLANE GRIDS. J. Interconnect. Networks 10 (1-2) (2009)
Tomaz Pisanski, Janez Zerovnik
Hamilton cycles in graph bundles over a cycle with tree as a fibre. Discret. Math. 309 (17) (2009)
Janez Zerovnik, Ignasi Sau
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Iztok Banic, Rija Erves, Janez Zerovnik
Edge fault-diameter of Cartesian graph bundles. CTW (2008)
Janez Zerovnik
Perfect codes in direct products of cycles - a complete characterization. Adv. Appl. Math. 41 (2) (2008)
Iztok Banic, Janez Zerovnik
The fault-diameter of Cartesian products. Adv. Appl. Math. 40 (1) (2008)
Melita Gorse Pihler, Janez Zerovnik
Partial cubes are distance graphs. Discret. Math. 308 (5-6) (2008)
Igor Pesek, Janez Zerovnik
Best insertion algorithm for resource-constrained project scheduling problem CoRR (2007)
Iztok Banic, Janez Zerovnik
Edge Fault-Diameter of Cartesian Product of Graphs. SIROCCO (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) (2007)
Igor Pesek, Andrea Schaerf, Janez Zerovnik
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics (2007)
Blaz Zmazek, Janez Zerovnik
Weak reconstruction of strong product graphs. Discret. Math. 307 (3-5) (2007)
Sandi Klavzar, Simon Spacapan, Janez Zerovnik
An almost complete description of perfect codes in direct products of cycles. Adv. Appl. Math. 37 (1) (2006)
Tomaz Dobravec, Janez Zerovnik, Borut Robic
An optimal message routing algorithm for circulant networks. J. Syst. Archit. 52 (5) (2006)
Iztok Banic, Janez Zerovnik
Fault-diameter of generalized Cartesian products. ICDCS Workshops (2006)
Janez Zerovnik
New formulas for the pentomino exclusion problem. Australas. J Comb. 36 (2006)
Iztok Banic, Janez Zerovnik
Fault-diameter of Cartesian graph bundles. Inf. Process. Lett. 100 (2) (2006)
Matthew Henderson, John Shawe-Taylor, Janez Zerovnik
Mixture of Vector Experts. ALT (2005)
Blaz Zmazek, Janez Zerovnik
Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV (2005)
Petra Sparl, Janez Zerovnik
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55 (1) (2005)
Petra Sparl, Janez Zerovnik
2-local distributed algorithms for generalized coloring of hexagonal graphs. Electron. Notes Discret. Math. 22 (2005)
Claude Chaudet, Isabelle Guérin Lassous, Janez Zerovnik
A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks. WONS (2004)
Blaz Zmazek, Janez Zerovnik
Behzad-Vizing conjecture and Cartesian product graphs. Electron. Notes Discret. Math. 17 (2004)
Petra Sparl, Janez Zerovnik
Homomorphisms of hexagonal graphs to odd cycles. Discret. Math. 283 (1-3) (2004)
Blaz Zmazek, Janez Zerovnik
The obnoxious center problem on weighted cactus graphs. Discret. Appl. Math. 136 (2-3) (2004)
Petra Sparl, Janez Zerovnik
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inf. Process. Lett. 90 (5) (2004)
Blaz Zmazek, Janez Zerovnik
Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW (2004)
Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik
Preface. Discuss. Math. Graph Theory 23 (2) (2003)
Wilfried Imrich, Blaz Zmazek, Janez Zerovnik
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23 (2) (2003)
Blaz Zmazek, Janez Zerovnik
On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13 (2003)
Tomaz Dobravec, Borut Robic, Janez Zerovnik
Permutation routing in double-loop networks: design and empirical evaluation. J. Syst. Archit. 48 (13-15) (2003)
Sangho Shim, Jozef Sirán, Janez Zerovnik
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discret. Appl. Math. 119 (3) (2002)
Frédéric Havet, Janez Zerovnik
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discret. Math. 244 (1-3) (2002)
Blaz Zmazek, Janez Zerovnik
Algorithm for recognizing Cartesian graph bundles. Discret. Appl. Math. 120 (1-3) (2002)
Alain Bretto, Stéphane Ubéda, Janez Zerovnik
A polynomial algorithm for the strong Helly property. Inf. Process. Lett. 81 (1) (2002)
Aleksander Vesel, Janez Zerovnik
Improved lower bound on the Shannon capacity of C7. Inf. Process. Lett. 81 (5) (2002)
Blaz Zmazek, Janez Zerovnik
Unique square property and fundamental factorizations of graph bundles. Discret. Math. 244 (1-3) (2002)
Janez Zerovnik
Chromatic numbers of the strong product of odd cycles. Electron. Notes Discret. Math. 11 (2002)
Blaz Zmazek, Janez Zerovnik
Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15 (6) (2002)

Janez Zerovnik.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Janez Zerovnik