Janez Žerovnik

From MaRDI portal
Person:186164

Available identifiers

zbMath Open zerovnik.janezWikidataQ48076481 ScholiaQ48076481MaRDI QIDQ186164

List of research outcomes

PublicationDate of PublicationType
Rainbow domination regular graphs that are not vertex transitive2024-04-02Paper
A fresh look to a randomized massively parallel graph coloring algorithm2023-09-21Paper
60 years of OR in Slovenia: development from a first conference to a vibrant community2023-08-04Paper
On the 2-rainbow independent domination numbers of some graphs2023-08-04Paper
A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs2022-09-29Paper
Clustering as a dual problem to colouring2022-05-23Paper
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR2021-11-24Paper
On sufficient properties of sufficient matrices2021-11-24Paper
Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\)2021-02-12Paper
On median and quartile sets of ordered random variables2020-09-15Paper
https://portal.mardi4nfdi.de/entity/Q52063282019-12-18Paper
Networks with Extremal Closeness2019-08-14Paper
Independent rainbow domination of graphs2019-06-17Paper
The Hosoya polynomial of double weighted graphs2019-03-27Paper
On 2-rainbow domination of generalized Petersen graphs2019-03-11Paper
https://portal.mardi4nfdi.de/entity/Q45681632018-06-15Paper
https://portal.mardi4nfdi.de/entity/Q46043532018-02-23Paper
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees*2017-11-09Paper
https://portal.mardi4nfdi.de/entity/Q49752602017-08-04Paper
https://portal.mardi4nfdi.de/entity/Q49752962017-08-04Paper
https://portal.mardi4nfdi.de/entity/Q57388232017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q29664002017-03-07Paper
Broadcasting on cactus graphs2017-03-03Paper
On local search based heuristics for optimization problems2017-03-03Paper
WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS2017-02-09Paper
https://portal.mardi4nfdi.de/entity/Q28353862016-12-02Paper
Mixed connectivity of Cartesian graph products and bundles2016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28160522016-07-01Paper
Improved approximative multicoloring of hexagonal graphs2016-06-04Paper
Multicoloring of cannonball graphs2016-06-01Paper
Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture2016-01-17Paper
Mixed fault diameter of Cartesian graph bundles II2015-10-05Paper
On rainbow domination numbers of graphs2015-09-25Paper
https://portal.mardi4nfdi.de/entity/Q29439392015-09-07Paper
https://portal.mardi4nfdi.de/entity/Q29439402015-09-07Paper
Perfect codes in direct graph bundles2015-06-02Paper
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles2014-12-05Paper
https://portal.mardi4nfdi.de/entity/Q54208702014-06-13Paper
Mixed fault diameter of Cartesian graph bundles2014-04-16Paper
https://portal.mardi4nfdi.de/entity/Q57474132014-02-14Paper
Wide-diameter of Product Graphs2013-08-26Paper
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance2013-07-08Paper
1-local 7/5-competitive algorithm for multicoloring hexagonal graphs2013-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31443532012-12-07Paper
Roman domination number of the Cartesian products of paths and cycles2012-10-24Paper
https://portal.mardi4nfdi.de/entity/Q29157172012-09-18Paper
A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs]2012-07-25Paper
Cyclic bundle Hamiltonicity2012-05-15Paper
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs2012-05-13Paper
https://portal.mardi4nfdi.de/entity/Q31121802012-01-13Paper
https://portal.mardi4nfdi.de/entity/Q31122072012-01-13Paper
https://portal.mardi4nfdi.de/entity/Q31122082012-01-13Paper
Simpler multicoloring of triangle-free hexagonal graphs2012-01-11Paper
https://portal.mardi4nfdi.de/entity/Q30884432011-08-19Paper
Constructive heuristics for the canister filling problem2011-08-12Paper
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs2011-06-08Paper
https://portal.mardi4nfdi.de/entity/Q30709302011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q31625652010-10-20Paper
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs2010-09-14Paper
https://portal.mardi4nfdi.de/entity/Q57480012010-09-14Paper
https://portal.mardi4nfdi.de/entity/Q57480022010-09-14Paper
https://portal.mardi4nfdi.de/entity/Q35757602010-07-28Paper
https://portal.mardi4nfdi.de/entity/Q35757672010-07-28Paper
https://portal.mardi4nfdi.de/entity/Q35757692010-07-28Paper
https://portal.mardi4nfdi.de/entity/Q35754302010-07-27Paper
Wide diameter of Cartesian graph bundles2010-05-28Paper
Permutation Routing and (ℓ, k)-Routing on Plane Grids2010-02-09Paper
https://portal.mardi4nfdi.de/entity/Q34006642010-02-05Paper
Fault-diameter of Cartesian graph bundles2010-01-29Paper
https://portal.mardi4nfdi.de/entity/Q36565902010-01-13Paper
https://portal.mardi4nfdi.de/entity/Q36565972010-01-13Paper
Hamilton cycles in graph bundles over a cycle with tree as a fibre2009-12-15Paper
https://portal.mardi4nfdi.de/entity/Q36437412009-11-09Paper
Edge-contributions of some topological indices and arboreality of molecular graphs2009-10-14Paper
https://portal.mardi4nfdi.de/entity/Q31815332009-10-12Paper
Edge, vertex and mixed fault diameters2009-09-14Paper
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs2009-07-21Paper
The edge fault-diameter of Cartesian graph bundles2009-06-17Paper
https://portal.mardi4nfdi.de/entity/Q35152842008-07-29Paper
Perfect codes in direct products of cycles-a complete characterization2008-06-26Paper
(l,k)-Routing on Plane Grids2008-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54469452008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54469462008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54469472008-03-06Paper
The fault-diameter of Cartesian products2008-03-05Paper
Partial cubes are distance graphs2008-02-14Paper
https://portal.mardi4nfdi.de/entity/Q54390082008-02-08Paper
A note onn-tuple colourings and circular colourings of planar graphs with large odd girth2007-12-12Paper
Edge Fault-Diameter of Cartesian Product of Graphs2007-11-15Paper
https://portal.mardi4nfdi.de/entity/Q53106142007-10-11Paper
https://portal.mardi4nfdi.de/entity/Q52963632007-08-01Paper
Weak k-reconstruction of cartesian product graphs2007-05-29Paper
Behzad-Vizing conjecture and Cartesian product graphs2007-05-29Paper
2-local distributed algorithms for generalized coloring of hexagonal graphs2007-05-29Paper
Weak reconstruction of strong product graphs2007-02-13Paper
An almost complete description of perfect codes in direct products of cycles2007-02-13Paper
https://portal.mardi4nfdi.de/entity/Q34121402006-12-05Paper
On domination numbers of graphs bundles2006-12-04Paper
https://portal.mardi4nfdi.de/entity/Q34106162006-11-29Paper
https://portal.mardi4nfdi.de/entity/Q34098722006-11-20Paper
https://portal.mardi4nfdi.de/entity/Q34099582006-11-20Paper
Algorithmic Learning Theory2006-11-01Paper
https://portal.mardi4nfdi.de/entity/Q54824622006-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54824692006-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54825072006-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54711492006-06-06Paper
https://portal.mardi4nfdi.de/entity/Q57085522005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57086172005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q46741552005-05-09Paper
https://portal.mardi4nfdi.de/entity/Q46741562005-05-09Paper
https://portal.mardi4nfdi.de/entity/Q46741832005-05-09Paper
2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs2005-05-04Paper
Weak k-reconstruction of Cartesian products2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48158022004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q48158352004-09-08Paper
Homomorphisms of hexagonal graphs to odd cycles2004-08-06Paper
The obnoxious center problem on weighted cactus graphs.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44310152003-10-13Paper
A polynomial algorithm for the strong Helly property2003-06-24Paper
Improved lower bound on the Shannon capacity of \(C_7\)2003-06-24Paper
https://portal.mardi4nfdi.de/entity/Q45192682002-09-08Paper
Behzad-Vizing conjecture and Cartesian-product graphs2002-09-03Paper
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs2002-08-29Paper
Algorithm for recognizing Cartesian graph bundles2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45474792002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45474802002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45466022002-08-20Paper
On recognizing Cartesian graph bundles2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45319752002-05-27Paper
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice2002-05-21Paper
Unique square property and fundamental factorizations of graph bundles2002-05-21Paper
An algorithm forK-convex closure and an application2002-04-21Paper
https://portal.mardi4nfdi.de/entity/Q27798182002-04-15Paper
https://portal.mardi4nfdi.de/entity/Q27775072002-03-07Paper
https://portal.mardi4nfdi.de/entity/Q27413752001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27155852001-09-03Paper
Recognizing weighted directed cartesian graph bundles2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45110292001-02-28Paper
On the linearK-arboricity of cubic graphs2000-12-21Paper
https://portal.mardi4nfdi.de/entity/Q45193062000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49343612000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q49441672000-03-19Paper
The independence number of the strong product of odd cycles1998-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43948281998-06-11Paper
Distance-related invariants on polygraphs1998-04-08Paper
Recognizing Cartesian graph bundles1997-11-25Paper
https://portal.mardi4nfdi.de/entity/Q43489501997-08-10Paper
On the weak reconstruction of Cartesian-product graphs1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q56881161997-03-11Paper
Algebraic approach to fasciagraphs and rotagraphs1996-10-01Paper
https://portal.mardi4nfdi.de/entity/Q43282551995-06-11Paper
Factoring cartesian‐product graphs1995-04-18Paper
A randomized algorithm for \(k\)-colorability1995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q46950191993-08-17Paper
A counterexample to conjecture of Barefoot, Harary, and Jones1993-08-11Paper
Bounding the probability of success of stochastic methods for global optimization1993-07-21Paper
Computing the Diameter in Multiple-Loop Networks1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40361891993-05-16Paper
A parallel variant of a heuristical algorithm for graph coloring -- corrigendum1993-01-17Paper
A parallel variant of a heuristical algorithm for graph colouring1990-01-01Paper
A randomised heuristical algorithm for estimating the chromatic number of a graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33587701989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Janez Žerovnik