Остановите войну!
for scientists:
default search action
Janez Zerovnik
- > Home > Persons > Janez Zerovnik
Publications
- 2019
- [j91]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: 370-384 (2019) - 2018
- [j88]Zehui Shao, Pu Wu, Huiqin Jiang, Zepeng Li, Janez Zerovnik, Xiujun Zhang:
Discharging Approach for Double Roman Domination in Graphs. IEEE Access 6: 63345-63351 (2018) - 2016
- [j82]Petra Sparl, Rafal Witkowski, Janez Zerovnik:
Multicoloring of cannonball graphs. Ars Math. Contemp. 10(1): 31-44 (2016) - 2014
- [j74]Zehui Shao, Meilian Liang, Chuang Yin, Xiaodong Xu, Polona Pavlic, Janez Zerovnik:
On rainbow domination numbers of graphs. Inf. Sci. 254: 225-234 (2014) - 2013
- [j70]Rafal Witkowski, Janez Zerovnik:
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. Discret. Math. Theor. Comput. Sci. 15(3): 127-138 (2013) - 2012
- [j68]Petra Sparl, Rafal Witkowski, Janez Zerovnik:
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 64(4): 564-583 (2012) - [j67]Polona Pavlic, Janez Zerovnik:
Roman Domination Number of the Cartesian Products of Paths and Cycles. Electron. J. Comb. 19(3): 19 (2012) - [j66]Ignasi Sau, Petra Sparl, Janez Zerovnik:
Simpler multicoloring of triangle-free hexagonal graphs. Discret. Math. 312(1): 181-187 (2012) - [j64]Petra Sparl, Rafal Witkowski, Janez Zerovnik:
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs. Inf. Process. Lett. 112(14-15): 567-571 (2012) - [c19]Polona Pavlic, Janez Zerovnik:
A Constant Time Algorithm for Domination Problems on Polygraphs. CTW 2012: 205-209 - 2011
- [c18]Rafal Witkowski, Janez Zerovnik:
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs. WAW 2011: 74-84 - 2010
- [j59]Rafal Witkowski, Janez Zerovnik:
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. Electron. Notes Discret. Math. 36: 375-382 (2010) - [j58]Petra Sparl, Janez Zerovnik:
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs. Int. J. Comput. Math. 87(9): 2003-2013 (2010) - [j57]Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik:
Oriented Networks Design Problem. J. Inf. Sci. Eng. 26(4): 1231-1242 (2010) - [p1]Ignasi Sau, Janez Zerovnik:
Permutation Routing and (ℓ, k)-Routing on Plane Grids. Graphs and Algorithms in Communication Networks 2010: 265-279 - 2009
- [j55]Tomaz Pisanski, Janez Zerovnik:
Edge-contributions of some topological indices and arboreality of molecular graphs. Ars Math. Contemp. 2(1): 49-58 (2009) - [j54]Tomaz Pisanski, Janez Zerovnik:
Hamilton cycles in graph bundles over a cycle with tree as a fibre. Discret. Math. 309(17): 5432-5436 (2009) - [j52]Florian Huc, Ignasi Sau, Janez Zerovnik:
(l, k)-ROUTING ON PLANE GRIDS. J. Interconnect. Networks 10(1-2): 27-57 (2009) - 2008
- [j48]Janez Zerovnik, Ignasi Sau:
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - 2007
- [j47]Blaz Zmazek, Janez Zerovnik:
Weak reconstruction of strong product graphs. Discret. Math. 307(3-5): 641-649 (2007) - [j46]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): 1743-1746 (2007) - [c14]Igor Pesek, Andrea Schaerf, Janez Zerovnik:
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics 2007: 57-68 - [i1]Igor Pesek, Janez Zerovnik:
Best insertion algorithm for resource-constrained project scheduling problem. CoRR abs/0705.2137 (2007) - 2006
- [j45]Sandi Klavzar, Simon Spacapan, Janez Zerovnik:
An almost complete description of perfect codes in direct products of cycles. Adv. Appl. Math. 37(1): 2-18 (2006) - 2005
- [j41]Petra Sparl, Janez Zerovnik:
2-local distributed algorithms for generalized coloring of hexagonal graphs. Electron. Notes Discret. Math. 22: 321-325 (2005) - [j40]Petra Sparl, Janez Zerovnik:
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1): 29-41 (2005) - [c11]Matthew Henderson, John Shawe-Taylor, Janez Zerovnik:
Mixture of Vector Experts. ALT 2005: 386-398 - [c10]Blaz Zmazek, Janez Zerovnik:
Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV 2005: 536-541 - 2004
- [j39]Blaz Zmazek, Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs. Discret. Appl. Math. 136(2-3): 377-386 (2004) - [j38]Petra Sparl, Janez Zerovnik:
Homomorphisms of hexagonal graphs to odd cycles. Discret. Math. 283(1-3): 273-277 (2004) - [j37]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian product graphs. Electron. Notes Discret. Math. 17: 297-300 (2004) - [j36]Petra Sparl, Janez Zerovnik:
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inf. Process. Lett. 90(5): 239-246 (2004) - [c9]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW 2004: 257-260 - 2003
- [j35]Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. Discuss. Math. Graph Theory 23(2): 205 (2003) - [j34]Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003) - [j33]Blaz Zmazek, Janez Zerovnik:
On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13: 123-127 (2003) - 2002
- [j31]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6): 781-784 (2002) - [j30]Sangho Shim, Jozef Sirán, Janez Zerovnik:
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discret. Appl. Math. 119(3): 281-286 (2002) - [j29]Blaz Zmazek, Janez Zerovnik:
Algorithm for recognizing Cartesian graph bundles. Discret. Appl. Math. 120(1-3): 275-302 (2002) - [j28]Frédéric Havet, Janez Zerovnik:
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discret. Math. 244(1-3): 103-108 (2002) - [j27]Blaz Zmazek, Janez Zerovnik:
Unique square property and fundamental factorizations of graph bundles. Discret. Math. 244(1-3): 551-561 (2002) - [j24]Aleksander Vesel, Janez Zerovnik:
Improved lower bound on the Shannon capacity of C7. Inf. Process. Lett. 81(5): 277-282 (2002) - 2001
- [j23]Blaz Zmazek, Janez Zerovnik:
On recognizing Cartesian graph bundles. Discret. Math. 233(1-3): 381-391 (2001) - [j22]Blaz Zmazek, Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs (Extended Abstract). Electron. Notes Discret. Math. 8: 133-136 (2001) - [j21]Wilfried Imrich, Blaz Zniazek, Janez Zerovnik:
Weak k-reconstruction of cartesian product graphs. Electron. Notes Discret. Math. 10: 297-300 (2001) - [j20]Tomaz Pisanski, Blaz Zmazek, Janez Zerovnik:
An algorithm for K-convex closure and an application. Int. J. Comput. Math. 78(1): 1-11 (2001) - 2000
- [j18]Blaz Zmazek, Janez Zerovnik:
Recognizing weighted directed cartesian graph bundles. Discuss. Math. Graph Theory 20(1): 39-56 (2000) - [j17]Aleksander Vesel, Janez Zerovnik:
On the linear K-arboricity of cubic graphs. Int. J. Comput. Math. 75(4): 431-444 (2000) - [c7]Barry Rising, John Shawe-Taylor, Janez Zerovnik:
Graph Colouring by Maximal Evidence Edge Adding. PATAT 2000: 294-308 - 1999
- [j16]Blaz Zmazek, Janez Zerovnik:
Algorithm for Recognizing Cartesian Graph Bundles. Electron. Notes Discret. Math. 3: 217-221 (1999) - 1998
- [j14]Aleksander Vesel, Janez Zerovnik:
The independence number of the strong product of odd cycles. Discret. Math. 182(1-3): 333-336 (1998) - [c5]Patrick W. Fowler, Tomaz Pisanski, Ante Graovac, Janez Zerovnik:
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra. Discrete Mathematical Chemistry 1998: 175-187 - [c4]Barry Rising, Max van Daalen, John Shawe-Taylor, Peter Burge, Janez Zerovnik:
A Neural Accelerator for Graph Colouring Based on an Edge Adding Technique. NC 1998: 652-656 - 1997
- [j13]Martin Juvan, Bojan Mohar, Janez Zerovnik:
Distance-related Invariants on Polygraphs. Discret. Appl. Math. 80(1): 57-71 (1997) - [j12]Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik:
Recognizing Cartesian graph bundles. Discret. Math. 167-168: 393-403 (1997) - 1996
- [j11]Sandi Klavzar, Janez Zerovnik:
Algebraic Approach to Fasciagraphs and Rotagraphs. Discret. Appl. Math. 68(1-2): 93-100 (1996) - [j10]Wilfried Imrich, Janez Zerovnik:
On the weak reconstruction of Cartesian-product graphs. Discret. Math. 150(1-3): 167-178 (1996) - 1995
- [j9]Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik:
Fast computation of the Wiener index of fasciagraphs and rotagraphs. J. Chem. Inf. Comput. Sci. 35(5): 834-840 (1995) - 1994
- [j7]Tomaz Pisanski, Janez Zerovnik:
Weights on Edges of Chemical Graphs Determined by Paths. J. Chem. Inf. Comput. Sci. 34(2): 395-397 (1994) - 1993
- [j4]Janez Zerovnik, Tomaz Pisanski:
Computing the Diameter in Multiple-Loop Networks. J. Algorithms 14(2): 226-243 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint