Janez Zerovnik

137 papers B 5C 8Journal 115Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
On 2-domination and 2-rainbow domination of cylindrical graphs.
Comput. Appl. Math.
Janez Zerovnik
2025 J jnl
Recent theoretical and practical contributions to the OR environment and CEJOR from the perspective of SSI-SOR.
Central Eur. J. Oper. Res.
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2025 J jnl
The 2-rainbow domination number of Cartesian bundles over cycles.
Central Eur. J. Oper. Res.
Simon Brezovnik, Darja Rupnik Poklukar, Janez Zerovnik
2025 J jnl
The 2-rainbow domination number of Cartesian product of cycles.
Ars Math. Contemp.
Simon Brezovnik, Darja Rupnik Poklukar, Janez Zerovnik
2024 J jnl
A Robust Heuristics for the Online Job Shop Scheduling Problem.
Algorithms
Hugo Zupan, Niko Herakovic, Janez Zerovnik
2024 J jnl
Rainbow domination regular graphs that are not vertex transitive.
Discret. Appl. Math.
Janez Zerovnik
2024 J jnl
Sufficient Matrices: Properties, Generating and Testing.
J. Optim. Theory Appl.
Marianna E.-Nagy, Tibor Illés, Janez Povh, Anita Varga, Janez Zerovnik
2023 J jnl
60 years of OR in Slovenia: development from a first conference to a vibrant community.
Central Eur. J. Oper. Res.
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2023 J jnl
On the 2-rainbow independent domination numbers of some graphs.
Central Eur. J. Oper. Res.
Bostjan Gabrovsek, Aljosa Peperko, Janez Zerovnik
2022 J jnl
A Linear Time Algorithm for Weighted k-Fair Domination Problem in Cactus Graphs.
Oper. Res. Forum
Tina Novak, Janez Zerovnik
2022 J jnl
Clustering as a dual problem to colouring.
Comput. Appl. Math.
Barbara Ikica, Bostjan Gabrovsek, Janez Povh, Janez Zerovnik
2022 J jnl
Double Roman Domination in Generalized Petersen Graphs P(ck, k).
Symmetry
Darja Rupnik Poklukar, Janez Zerovnik
2022 J jnl
On Three-Rainbow Dominationof Generalized Petersen Graphs P(ck, k).
Symmetry
Darja Rupnik Poklukar, Janez Zerovnik
2021 J jnl
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR.
Central Eur. J. Oper. Res.
Andrej Kastrin, Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2021 J jnl
On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k, k).
Symmetry
Rija Erves, Janez Zerovnik
2021 J jnl
On 3-Rainbow Domination Number of Generalized Petersen Graphs P(6k, k).
Symmetry
Rija Erves, Janez Zerovnik
2021 J jnl
On sufficient properties of sufficient matrices.
Central Eur. J. Oper. Res.
Janez Povh, Janez Zerovnik
2021 J jnl
Real forms of the complex Neumann system: A method for finding real roots of polynomial US(λ).
J. Comput. Appl. Math.
Tina Novak, Janez Zerovnik
2020 J jnl
On median and quartile sets of ordered random variables.
Art Discret. Appl. Math.
Iztok Banic, Janez Zerovnik
2019 J jnl
A stochastic model for better planning of product flow in retail supply chains.
J. Oper. Res. Soc.
Tea Vizinger, Janez Zerovnik
2019 J jnl
Editorial.
Central Eur. J. Oper. Res.
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2019 J jnl
Networks with Extremal Closeness.
Fundam. Informaticae
Darja Rupnik Poklukar, Janez Zerovnik
2019 J jnl
On 2-rainbow domination of generalized Petersen graphs.
Discret. Appl. Math.
Zehui Shao, Huiqin Jiang, Pu Wu, Shaohui Wang, Janez Zerovnik, Xiaosong Zhang, Jia-Bao Liu
2018 J jnl
Discharging Approach for Double Roman Domination in Graphs.
IEEE Access
Zehui Shao, Pu Wu, Huiqin Jiang, Zepeng Li, Janez Zerovnik, Xiujun Zhang
2018 J jnl
Formulas for various domination numbers of products of paths and cycles.
Ars Comb.
Polona Repolusk, Janez Zerovnik
2018 J jnl
The Hosoya polynomial of double weighted graphs.
Ars Math. Contemp.
Tina Novak, Darja Rupnik Poklukar, Janez Zerovnik
2017 J jnl
Broadcasting on cactus graphs.
J. Comb. Optim.
Maja Cevnik, Janez Zerovnik
2017 J jnl
Editorial.
Central Eur. J. Oper. Res.
Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2017 — conf
Local Search with Discrete Event Simulation for the Job Shop Scheduling Problem.
SOHOMA
Hugo Zupan, Janez Zerovnik, Niko Herakovic
2016 J jnl
Mixed connectivity of Cartesian graph products and bundles.
Ars Comb.
Rija Erves, Janez Zerovnik
2016 J jnl
Multicoloring of cannonball graphs.
Ars Math. Contemp.
Petra Sparl, Rafal Witkowski, Janez Zerovnik
2016 J jnl
Petra Šparl (1975-2016).
Ars Math. Contemp.
Janez Zerovnik
2016 J jnl
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees.
Fundam. Informaticae
Darja Rupnik Poklukar, Janez Zerovnik
2016 J jnl
Using Newton's method to model a spatial light distribution of a LED with attached secondary optics.
CoRR
David Kaljun, Joze Petrisic, Janez Zerovnik
2016 J jnl
Weighted domination number of cactus graphs.
CoRR
Tina Novak, Janez Zerovnik
2015 J jnl
Editorial.
Central Eur. J. Oper. Res.
Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
2015 J jnl
Heuristics for Optimization of LED Spatial Light Distribution Model.
Informatica (Slovenia)
David Kaljun, Darja Rupnik Poklukar, Janez Zerovnik
2015 J jnl
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles.
Discret. Appl. Math.
Rija Erves, Janez Zerovnik
2015 J jnl
Mixed fault diameter of Cartesian graph bundles II.
Ars Math. Contemp.
Rija Erves, Janez Zerovnik
2015 J jnl
Perfect codes in direct graph bundles.
Inf. Process. Lett.
Irena Hrastnik Ladinek, Janez Zerovnik
2014 J jnl
On rainbow domination numbers of graphs.
Inf. Sci.
Zehui Shao, Meilian Liang, Chuang Yin, Xiaodong Xu, Polona Pavlic, Janez Zerovnik
2013 J jnl
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs.
Discret. Math. Theor. Comput. Sci.
Rafal Witkowski, Janez Zerovnik
2013 J jnl
Editorial.
Central Eur. J. Oper. Res.
Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
2013 J jnl
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance.
Central Eur. J. Oper. Res.
Tomaz Kramberger, Janez Zerovnik, Gregor Strubelj, Klemen Prah
2013 J jnl
Mixed fault diameter of Cartesian graph bundles.
Discret. Appl. Math.
Rija Erves, Janez Zerovnik
2013 J jnl
Wide-diameter of Product Graphs.
Fundam. Informaticae
Rija Erves, Janez Zerovnik
2012 J jnl
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs.
Algorithmica
Petra Sparl, Rafal Witkowski, Janez Zerovnik
2012 C conf
A Constant Time Algorithm for Domination Problems on Polygraphs.
CTW
Polona Pavlic, Janez Zerovnik
2012 J jnl
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs.
Inf. Process. Lett.
Petra Sparl, Rafal Witkowski, Janez Zerovnik
2012 J jnl
Cyclic bundle Hamiltonicity.
Int. J. Comput. Math.
Irena Hrastnik Ladinek, Janez Zerovnik
2012 J jnl
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
CoRR
Janez Zerovnik, Rija Erves
2012 J jnl
Preface.
Theor. Comput. Sci.
Shay Kutten, Janez Zerovnik
2012 J jnl
Roman Domination Number of the Cartesian Products of Paths and Cycles.
Electron. J. Comb.
Polona Pavlic, Janez Zerovnik
2012 J jnl
Simpler multicoloring of triangle-free hexagonal graphs.
Discret. Math.
Ignasi Sau, Petra Sparl, Janez Zerovnik
2011 C conf
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs.
WAW
Rafal Witkowski, Janez Zerovnik
2011 J jnl
Constructive heuristics for the canister filling problem.
Central Eur. J. Oper. Res.
Gasper Zerovnik, Janez Zerovnik
2011 J jnl
Editorial.
Central Eur. J. Oper. Res.
Tibor Csendes, Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
2010 J jnl
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs.
Electron. Notes Discret. Math.
Rafal Witkowski, Janez Zerovnik
2010 J jnl
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs.
Int. J. Comput. Math.
Petra Sparl, Janez Zerovnik
2010 C conf
Mixed Connectivity of Cartesian Graph Products and Bundles.
CTW
Rija Erves, Janez Zerovnik
2010 J jnl
Oriented Networks Design Problem.
J. Inf. Sci. Eng.
Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik
2010 — ch.
Permutation Routing and (
Graphs and Algorithms in Communication Networks
Ignasi Sau, Janez Zerovnik
2010 B ed.
Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers
SIROCCO
Shay Kutten, Janez Zerovnik
2010 C conf
Wide - Sense Nonblocking logd(N; 0; p) Networks.
CTW
Maja Rotovnik, Janez Zerovnik
2010 J jnl
Wide diameter of Cartesian graph bundles.
Discret. Math.
Iztok Banic, Janez Zerovnik
2009 J jnl
(
J. Interconnect. Networks
Florian Huc, Ignasi Sau, Janez Zerovnik
2009 J jnl
Edge, vertex and mixed fault diameters.
Adv. Appl. Math.
Iztok Banic, Rija Erves, Janez Zerovnik
2009 J jnl
Edge-contributions of some topological indices and arboreality of molecular graphs.
Ars Math. Contemp.
Tomaz Pisanski, Janez Zerovnik
2009 J jnl
Hamilton cycles in graph bundles over a cycle with tree as a fibre.
Discret. Math.
Tomaz Pisanski, Janez Zerovnik
2009 J jnl
The edge fault-diameter of Cartesian graph bundles.
Eur. J. Comb.
Iztok Banic, Rija Erves, Janez Zerovnik
2008 J jnl
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.
Discret. Math. Theor. Comput. Sci.
Janez Zerovnik, Ignasi Sau
2008 C conf
Edge fault-diameter of Cartesian graph bundles.
CTW
Iztok Banic, Rija Erves, Janez Zerovnik
2008 J jnl
Partial cubes are distance graphs.
Discret. Math.
Melita Gorse Pihler, Janez Zerovnik
2008 J jnl
Perfect codes in direct products of cycles - a complete characterization.
Adv. Appl. Math.
Janez Zerovnik
2008 J jnl
The fault-diameter of Cartesian products.
Adv. Appl. Math.
Iztok Banic, Janez Zerovnik
2007 J jnl
A note on n-tuple colourings and circular colourings of planar graphs with large odd girth.
Int. J. Comput. Math.
Petra Sparl, Janez Zerovnik
2007 J jnl
Best insertion algorithm for resource-constrained project scheduling problem
CoRR
Igor Pesek, Janez Zerovnik
2007 B conf
Edge Fault-Diameter of Cartesian Product of Graphs.
SIROCCO
Iztok Banic, Janez Zerovnik
2007 — conf
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.
Hybrid Metaheuristics
Igor Pesek, Andrea Schaerf, Janez Zerovnik
2007 J jnl
Weak reconstruction of strong product graphs.
Discret. Math.
Blaz Zmazek, Janez Zerovnik
2006 J jnl
An almost complete description of perfect codes in direct products of cycles.
Adv. Appl. Math.
Sandi Klavzar, Simon Spacapan, Janez Zerovnik
2006 J jnl
An optimal message routing algorithm for circulant networks.
J. Syst. Archit.
Tomaz Dobravec, Janez Zerovnik, Borut Robic
2006 J jnl
Fault-diameter of Cartesian graph bundles.
Inf. Process. Lett.
Iztok Banic, Janez Zerovnik
2006 — conf
Fault-diameter of generalized Cartesian products.
ICDCS Workshops
Iztok Banic, Janez Zerovnik
2006 J jnl
New formulas for the pentomino exclusion problem.
Australas. J Comb.
Janez Zerovnik
2005 J jnl
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs.
J. Algorithms
Petra Sparl, Janez Zerovnik
2005 J jnl
2-local distributed algorithms for generalized coloring of hexagonal graphs.
Electron. Notes Discret. Math.
Petra Sparl, Janez Zerovnik
2005 C conf
Estimating the Traffic on Weighted Cactus Networks in Linear Time.
IV
Blaz Zmazek, Janez Zerovnik
2005 B conf
Mixture of Vector Experts.
ALT
Matthew Henderson, John Shawe-Taylor, Janez Zerovnik
2004 J jnl
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.
Inf. Process. Lett.
Petra Sparl, Janez Zerovnik
2004 — conf
A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks.
WONS
Claude Chaudet, Isabelle Guérin Lassous, Janez Zerovnik
2004 C conf
Behzad-Vizing Conjecture and Cartesian Product Graphs.
CTW
Blaz Zmazek, Janez Zerovnik
2004 J jnl
Behzad-Vizing conjecture and Cartesian product graphs.
Electron. Notes Discret. Math.
Blaz Zmazek, Janez Zerovnik
2004 J jnl
Homomorphisms of hexagonal graphs to odd cycles.
Discret. Math.
Petra Sparl, Janez Zerovnik
2004 J jnl
The obnoxious center problem on weighted cactus graphs.
Discret. Appl. Math.
Blaz Zmazek, Janez Zerovnik
2003 J jnl
On the Weak Reconstruction of Strong Product Graphs.
Electron. Notes Discret. Math.
Blaz Zmazek, Janez Zerovnik
2003 J jnl
Permutation routing in double-loop networks: design and empirical evaluation.
J. Syst. Archit.
Tomaz Dobravec, Borut Robic, Janez Zerovnik
2003 J jnl
Preface.
Discuss. Math. Graph Theory
Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik
2003 J jnl
Weak k-reconstruction of Cartesian products.
Discuss. Math. Graph Theory
Wilfried Imrich, Blaz Zmazek, Janez Zerovnik
2002 J jnl
A polynomial algorithm for the strong Helly property.
Inf. Process. Lett.
Alain Bretto, Stéphane Ubéda, Janez Zerovnik
2002 J jnl
Algorithm for recognizing Cartesian graph bundles.
Discret. Appl. Math.
Blaz Zmazek, Janez Zerovnik
2002 J jnl
Behzad-Vizing conjecture and Cartesian-product graphs.
Appl. Math. Lett.
Blaz Zmazek, Janez Zerovnik
2002 J jnl
Chromatic numbers of the strong product of odd cycles.
Electron. Notes Discret. Math.
Janez Zerovnik
2002 J jnl
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discret. Appl. Math.
Sangho Shim, Jozef Sirán, Janez Zerovnik
2002 J jnl
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discret. Math.
Frédéric Havet, Janez Zerovnik
2002 J jnl
Improved lower bound on the Shannon capacity of C7.
Inf. Process. Lett.
Aleksander Vesel, Janez Zerovnik
2002 J jnl
Unique square property and fundamental factorizations of graph bundles.
Discret. Math.
Blaz Zmazek, Janez Zerovnik
2001 J jnl
An algorithm for
Int. J. Comput. Math.
Tomaz Pisanski, Blaz Zmazek, Janez Zerovnik
2001 J jnl
On recognizing Cartesian graph bundles.
Discret. Math.
Blaz Zmazek, Janez Zerovnik
2001 J jnl
The obnoxious center problem on weighted cactus graphs (Extended Abstract).
Electron. Notes Discret. Math.
Blaz Zmazek, Janez Zerovnik
2001 J jnl
Weak k-reconstruction of cartesian product graphs.
Electron. Notes Discret. Math.
Wilfried Imrich, Blaz Zniazek, Janez Zerovnik
2000 C conf
Graph Colouring by Maximal Evidence Edge Adding.
PATAT
Barry Rising, John Shawe-Taylor, Janez Zerovnik
2000 J jnl
Minimum 2-terminal Routing in 2-jump Circulant Graphs.
Comput. Artif. Intell.
Borut Robic, Janez Zerovnik
2000 J jnl
On the linear
Int. J. Comput. Math.
Aleksander Vesel, Janez Zerovnik
2000 J jnl
Recognizing weighted directed cartesian graph bundles.
Discuss. Math. Graph Theory
Blaz Zmazek, Janez Zerovnik
1999 J jnl
Algorithm for Recognizing Cartesian Graph Bundles.
Electron. Notes Discret. Math.
Blaz Zmazek, Janez Zerovnik
1999 B conf
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs.
FCT
Janez Zerovnik
1999 J jnl
Szeged Index of Symmetric Graphs.
J. Chem. Inf. Comput. Sci.
Janez Zerovnik
1998 — conf
A Neural Accelerator for Graph Colouring Based on an Edge Adding Technique.
NC
Barry Rising, Max van Daalen, John Shawe-Taylor, Peter Burge, Janez Zerovnik
1998 — conf
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra.
Discrete Mathematical Chemistry
Patrick W. Fowler, Tomaz Pisanski, Ante Graovac, Janez Zerovnik
1998 J jnl
The independence number of the strong product of odd cycles.
Discret. Math.
Aleksander Vesel, Janez Zerovnik
1997 J jnl
Distance-related Invariants on Polygraphs.
Discret. Appl. Math.
Martin Juvan, Bojan Mohar, Janez Zerovnik
1997 J jnl
Recognizing Cartesian graph bundles.
Discret. Math.
Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik
1996 J jnl
Algebraic Approach to Fasciagraphs and Rotagraphs.
Discret. Appl. Math.
Sandi Klavzar, Janez Zerovnik
1996 J jnl
On the weak reconstruction of Cartesian-product graphs.
Discret. Math.
Wilfried Imrich, Janez Zerovnik
1996 B conf
Recognizing Graph Products and Bundles.
SOFSEM
Janez Zerovnik
1995 J jnl
Fast computation of the Wiener index of fasciagraphs and rotagraphs.
J. Chem. Inf. Comput. Sci.
Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik
1994 J jnl
A randomized algorithm for k-colorability.
Discret. Math.
Janez Zerovnik
1994 J jnl
Weights on Edges of Chemical Graphs Determined by Paths.
J. Chem. Inf. Comput. Sci.
Tomaz Pisanski, Janez Zerovnik
1993 J jnl
A counterexample to conjecture of Barefoot, Harary, and Jones.
Graphs Comb.
Janez Zerovnik, Jolana Oplerova
1993 J jnl
Computing the Diameter in Multiple-Loop Networks.
J. Algorithms
Janez Zerovnik, Tomaz Pisanski
1993 J jnl
Regular Graphs Are 'Difficult' For Colouring.
Informatica (Slovenia)
Janez Zerovnik
1992 J jnl
A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication).
Parallel Comput.
Janez Zerovnik, M. Kaufman
1991 — conf
Distributed simulation of coloring graph vertices.
Annual Simulation Symposium
Milan E. Soklic, Janez Zerovnik
1991 — conf
On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem.
ACPC
Janez Zerovnik
1990 J jnl
A parallel variant of a heuristical algorithm for graph colouring.
Parallel Comput.
Janez Zerovnik
1989 J jnl
A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph.
Inf. Process. Lett.
Janez Zerovnik