Janez Zerovnik

According to our database1, Janez Zerovnik authored at least 108 papers between 1989 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Networks with Extremal Closeness.
Fundam. Inform., 2019

On 2-rainbow domination of generalized Petersen graphs.
Discrete Applied Mathematics, 2019

Editorial.
CEJOR, 2019

2018
The Hosoya polynomial of double weighted graphs.
Ars Math. Contemp., 2018

Formulas for various domination numbers of products of paths and cycles.
Ars Comb., 2018

Discharging Approach for Double Roman Domination in Graphs.
IEEE Access, 2018

2017
Broadcasting on cactus graphs.
J. Comb. Optim., 2017

Editorial.
CEJOR, 2017

Local Search with Discrete Event Simulation for the Job Shop Scheduling Problem.
Proceedings of the Service Orientation in Holonic and Multi-Agent Manufacturing, 2017

2016
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees.
Fundam. Inform., 2016

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

Multicoloring of cannonball graphs.
Ars Math. Contemp., 2016

2015
Perfect codes in direct graph bundles.
Inf. Process. Lett., 2015

Heuristics for Optimization of LED Spatial Light Distribution Model.
Informatica (Slovenia), 2015

Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles.
Discrete Applied Mathematics, 2015

Editorial.
CEJOR, 2015

Mixed fault diameter of Cartesian graph bundles II.
Ars Math. Contemp., 2015

2014
On rainbow domination numbers of graphs.
Inf. Sci., 2014

2013
Wide-diameter of Product Graphs.
Fundam. Inform., 2013

Mixed fault diameter of Cartesian graph bundles.
Discrete Applied Mathematics, 2013

GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance.
CEJOR, 2013

Editorial.
CEJOR, 2013

2012
Preface.
Theor. Comput. Sci., 2012

A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs.
Inf. Process. Lett., 2012

Cyclic bundle Hamiltonicity.
Int. J. Comput. Math., 2012

Simpler multicoloring of triangle-free hexagonal graphs.
Discrete Mathematics, 2012

Roman Domination Number of the Cartesian Products of Paths and Cycles.
Electr. J. Comb., 2012

1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs.
Algorithmica, 2012

A Constant Time Algorithm for Domination Problems on Polygraphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Constructive heuristics for the canister filling problem.
CEJOR, 2011

Editorial.
CEJOR, 2011

1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

2010
Oriented Networks Design Problem.
J. Inf. Sci. Eng., 2010

2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs.
Int. J. Comput. Math., 2010

1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs.
Electronic Notes in Discrete Mathematics, 2010

Wide diameter of Cartesian graph bundles.
Discrete Mathematics, 2010

Wide - Sense Nonblocking logd(N; 0; p) Networks.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Mixed Connectivity of Cartesian Graph Products and Bundles.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Permutation Routing and (, k)-Routing on Plane Grids.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
(l, k)-ROUTING ON PLANE GRIDS.
Journal of Interconnection Networks, 2009

The edge fault-diameter of Cartesian graph bundles.
Eur. J. Comb., 2009

Hamilton cycles in graph bundles over a cycle with tree as a fibre.
Discrete Mathematics, 2009

Edge-contributions of some topological indices and arboreality of molecular graphs.
Ars Math. Contemp., 2009

Edge, vertex and mixed fault diameters.
Adv. Appl. Math., 2009

2008
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.
Discrete Mathematics & Theoretical Computer Science, 2008

Partial cubes are distance graphs.
Discrete Mathematics, 2008

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

The fault-diameter of Cartesian products.
Adv. Appl. Math., 2008

Edge fault-diameter of Cartesian graph bundles.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
A note on n-tuple colourings and circular colourings of planar graphs with large odd girth.
Int. J. Comput. Math., 2007

Weak reconstruction of strong product graphs.
Discrete Mathematics, 2007

Edge Fault-Diameter of Cartesian Product of Graphs.
Proceedings of the Structural Information and Communication Complexity, 2007

Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

2006
An optimal message routing algorithm for circulant networks.
Journal of Systems Architecture, 2006

Fault-diameter of Cartesian graph bundles.
Inf. Process. Lett., 2006

New formulas for the pentomino exclusion problem.
Australasian J. Combinatorics, 2006

An almost complete description of perfect codes in direct products of cycles.
Adv. Appl. Math., 2006

Fault-diameter of generalized Cartesian products.
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

2005
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs.
J. Algorithms, 2005

2-local distributed algorithms for generalized coloring of hexagonal graphs.
Electronic Notes in Discrete Mathematics, 2005

Estimating the Traffic on Weighted Cactus Networks in Linear Time.
Proceedings of the 9th International Conference on Information Visualisation, 2005

Mixture of Vector Experts.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.
Inf. Process. Lett., 2004

Homomorphisms of hexagonal graphs to odd cycles.
Discrete Mathematics, 2004

The obnoxious center problem on weighted cactus graphs.
Discrete Applied Mathematics, 2004

A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks.
Proceedings of the Wireless On-Demand Network Systems, First IFIP TC6 Working Conference, 2004

Behzad-Vizing Conjecture and Cartesian Product Graphs.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
Permutation routing in double-loop networks: design and empirical evaluation.
Journal of Systems Architecture, 2003

On the Weak Reconstruction of Strong Product Graphs.
Electronic Notes in Discrete Mathematics, 2003

Preface.
Discussiones Mathematicae Graph Theory, 2003

Weak k-reconstruction of Cartesian products.
Discussiones Mathematicae Graph Theory, 2003

2002
Improved lower bound on the Shannon capacity of C7.
Inf. Process. Lett., 2002

A polynomial algorithm for the strong Helly property.
Inf. Process. Lett., 2002

Chromatic numbers of the strong product of odd cycles.
Electronic Notes in Discrete Mathematics, 2002

Unique square property and fundamental factorizations of graph bundles.
Discrete Mathematics, 2002

Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discrete Mathematics, 2002

Algorithm for recognizing Cartesian graph bundles.
Discrete Applied Mathematics, 2002

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discrete Applied Mathematics, 2002

2001
An algorithm for K-convex closure and an application.
Int. J. Comput. Math., 2001

The obnoxious center problem on weighted cactus graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics, 2001

Weak k-reconstruction of cartesian product graphs.
Electronic Notes in Discrete Mathematics, 2001

On recognizing Cartesian graph bundles.
Discrete Mathematics, 2001

2000
On the linear K-arboricity of cubic graphs.
Int. J. Comput. Math., 2000

Recognizing weighted directed cartesian graph bundles.
Discussiones Mathematicae Graph Theory, 2000

Minimum 2-terminal Routing in 2-jump Circulant Graphs.
Computers and Artificial Intelligence, 2000

Graph Colouring by Maximal Evidence Edge Adding.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

1999
Szeged Index of Symmetric Graphs.
Journal of Chemical Information and Computer Sciences, 1999

Algorithm for Recognizing Cartesian Graph Bundles.
Electronic Notes in Discrete Mathematics, 1999

Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
The independence number of the strong product of odd cycles.
Discrete Mathematics, 1998

A Neural Accelerator for Graph Colouring Based on an Edge Adding Technique.
Proceedings of the International ICSC / IFAC Symposium on Neural Computation (NC 1998), 1998

A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra.
Proceedings of the Discrete Mathematical Chemistry, 1998

1997
Recognizing Cartesian graph bundles.
Discrete Mathematics, 1997

Distance-related Invariants on Polygraphs.
Discrete Applied Mathematics, 1997

1996
On the weak reconstruction of Cartesian-product graphs.
Discrete Mathematics, 1996

Algebraic Approach to Fasciagraphs and Rotagraphs.
Discrete Applied Mathematics, 1996

Recognizing Graph Products and Bundles.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995
Fast computation of the Wiener index of fasciagraphs and rotagraphs.
Journal of Chemical Information and Computer Sciences, 1995

1994
Weights on Edges of Chemical Graphs Determined by Paths.
Journal of Chemical Information and Computer Sciences, 1994

A randomized algorithm for k-colorability.
Discrete Mathematics, 1994

1993
Computing the Diameter in Multiple-Loop Networks.
J. Algorithms, 1993

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

A counterexample to conjecture of Barefoot, Harary, and Jones.
Graphs and Combinatorics, 1993

1992
A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication).
Parallel Computing, 1992

1991
Distributed simulation of coloring graph vertices.
Proceedings of the Proceedings 24th Annual Simulation Symposium (ANSS-24 1991), 1991

On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem.
Proceedings of the Parallel Computation, First International ACPC Conference, Salzburg, Austria, September 30, 1991

1990
A parallel variant of a heuristical algorithm for graph colouring.
Parallel Computing, 1990

1989
A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph.
Inf. Process. Lett., 1989


  Loading...