 | 2008 |
|---|
| 55 |       | Iztok Banic,
Rija Erves,
Janez Zerovnik:
Edge fault-diameter of Cartesian graph bundles.
CTW 2008: 144-147 |
| 54 |  | Melita Gorse Pihler,
Janez Zerovnik:
Partial cubes are distance graphs.
Discrete Mathematics 308(5-6): 820-826 (2008) |
| 53 | | Janez Zerovnik,
Ignasi Sau:
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.
Discrete Mathematics & Theoretical Computer Science 10(3): (2008) |
| 2007 |
|---|
| 52 | | Igor Pesek,
Andrea Schaerf,
Janez Zerovnik:
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.
Hybrid Metaheuristics 2007: 57-68 |
| 51 | | Iztok Banic,
Janez Zerovnik:
Edge Fault-Diameter of Cartesian Product of Graphs.
SIROCCO 2007: 234-245 |
| 50 | | Igor Pesek,
Janez Zerovnik:
Best insertion algorithm for resource-constrained project scheduling problem
CoRR abs/0705.2137: (2007) |
| 49 | | Blaz Zmazek,
Janez Zerovnik:
Weak reconstruction of strong product graphs.
Discrete Mathematics 307(3-5): 641-649 (2007) |
| 48 | | 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) |
| 2006 |
|---|
| 47 | | Iztok Banic,
Janez Zerovnik:
Fault-diameter of generalized Cartesian products.
ICDCS Workshops 2006: 3 |
| 46 | | Iztok Banic,
Janez Zerovnik:
Fault-diameter of Cartesian graph bundles.
Inf. Process. Lett. 100(2): 47-51 (2006) |
| 45 | | Tomaz Dobravec,
Janez Zerovnik,
Borut Robic:
An optimal message routing algorithm for circulant networks.
Journal of Systems Architecture 52(5): 298-306 (2006) |
| 2005 |
|---|
| 44 | | Matthew Henderson,
John Shawe-Taylor,
Janez Zerovnik:
Mixture of Vector Experts.
ALT 2005: 386-398 |
| 43 | | Blaz Zmazek,
Janez Zerovnik:
Estimating the Traffic on Weighted Cactus Networks in Linear Time.
IV 2005: 536-541 |
| 42 | | Petra Sparl,
Janez Zerovnik:
2-local distributed algorithms for generalized coloring of hexagonal graphs.
Electronic Notes in Discrete Mathematics 22: 321-325 (2005) |
| 41 | | Petra Sparl,
Janez Zerovnik:
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs.
J. Algorithms 55(1): 29-41 (2005) |
| 2004 |
|---|
| 40 | | Claude Chaudet,
Isabelle Guérin Lassous,
Janez Zerovnik:
A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks.
WONS 2004: 101-115 |
| 39 | | Blaz Zmazek,
Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs.
Discrete Applied Mathematics 136(2-3): 377-386 (2004) |
| 38 | | Petra Sparl,
Janez Zerovnik:
Homomorphisms of hexagonal graphs to odd cycles.
Discrete Mathematics 283(1-3): 273-277 (2004) |
| 37 | | Blaz Zmazek,
Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian product graphs.
Electronic Notes in Discrete Mathematics 17: 297-300 (2004) |
| 36 | | Petra Sparl,
Janez Zerovnik:
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.
Inf. Process. Lett. 90(5): 239-246 (2004) |
| 2003 |
|---|
| 35 | | Blaz Zmazek,
Janez Zerovnik:
On the Weak Reconstruction of Strong Product Graphs.
Electronic Notes in Discrete Mathematics 13: 123-127 (2003) |
| 34 | | Tomaz Dobravec,
Borut Robic,
Janez Zerovnik:
Permutation routing in double-loop networks: design and empirical evaluation.
Journal of Systems Architecture 48(13-15): 387-402 (2003) |
| 2002 |
|---|
| 33 | | Blaz Zmazek,
Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian-product graphs.
Appl. Math. Lett. 15(6): 781-784 (2002) |
| 32 | | Sangho Shim,
Jozef Sirán,
Janez Zerovnik:
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discrete Applied Mathematics 119(3): 281-286 (2002) |
| 31 | | Blaz Zmazek,
Janez Zerovnik:
Algorithm for recognizing Cartesian graph bundles.
Discrete Applied Mathematics 120(1-3): 275-302 (2002) |
| 30 | | Frédéric Havet,
Janez Zerovnik:
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discrete Mathematics 244(1-3): 103-108 (2002) |
| 29 | | Blaz Zmazek,
Janez Zerovnik:
Unique square property and fundamental factorizations of graph bundles.
Discrete Mathematics 244(1-3): 551-561 (2002) |
| 28 | | Janez Zerovnik:
Chromatic numbers of the strong product of odd cycles.
Electronic Notes in Discrete Mathematics 11: 647-652 (2002) |
| 27 | | Alain Bretto,
Stéphane Ubéda,
Janez Zerovnik:
A polynomial algorithm for the strong Helly property.
Inf. Process. Lett. 81(1): 55-57 (2002) |
| 26 | | Aleksander Vesel,
Janez Zerovnik:
Improved lower bound on the Shannon capacity of C7.
Inf. Process. Lett. 81(5): 277-282 (2002) |
| 2001 |
|---|
| 25 | | Blaz Zmazek,
Janez Zerovnik:
On recognizing Cartesian graph bundles.
Discrete Mathematics 233(1-3): 381-391 (2001) |
| 24 | | Wilfried Imrich,
Blaz Zniazek,
Janez Zerovnik:
Weak k-reconstruction of cartesian product graphs.
Electronic Notes in Discrete Mathematics 10: 297-300 (2001) |
| 23 | | Blaz Zmazek,
Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 8: 133-136 (2001) |
| 2000 |
|---|
| 22 | | Barry Rising,
John Shawe-Taylor,
Janez Zerovnik:
Graph Colouring by Maximal Evidence Edge Adding.
PATAT 2000: 294-308 |
| 21 | | Borut Robic,
Janez Zerovnik:
Minimum 2-terminal Routing in 2-jump Circulant Graphs.
Computers and Artificial Intelligence 19(1): (2000) |
| 1999 |
|---|
| 20 | | Janez Zerovnik:
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs.
FCT 1999: 559-568 |
| 19 | | Blaz Zmazek,
Janez Zerovnik:
Algorithm for Recognizing Cartesian Graph Bundles.
Electronic Notes in Discrete Mathematics 3: 217-221 (1999) |
| 18 | | Janez Zerovnik:
Szeged Index of Symmetric Graphs.
Journal of Chemical Information and Computer Sciences 39(1): 77-80 (1999) |
| 1998 |
|---|
| 17 | | 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 |
| 16 | | Aleksander Vesel,
Janez Zerovnik:
The independence number of the strong product of odd cycles.
Discrete Mathematics 182(1-3): 333-336 (1998) |
| 1997 |
|---|
| 15 | | Martin Juvan,
Bojan Mohar,
Janez Zerovnik:
Distance-related Invariants on Polygraphs.
Discrete Applied Mathematics 80(1): 57-71 (1997) |
| 14 | | Wilfried Imrich,
Tomaz Pisanski,
Janez Zerovnik:
Recognizing Cartesian graph bundles.
Discrete Mathematics 167-168: 393-403 (1997) |
| 1996 |
|---|
| 13 | | Janez Zerovnik:
Recognizing Graph Products and Bundles.
SOFSEM 1996: 467-474 |
| 12 | | Sandi Klavzar,
Janez Zerovnik:
Algebraic Approach to Fasciagraphs and Rotagraphs.
Discrete Applied Mathematics 68(1-2): 93-100 (1996) |
| 11 | | Wilfried Imrich,
Janez Zerovnik:
On the weak reconstruction of Cartesian-product graphs.
Discrete Mathematics 150(1-3): 167-178 (1996) |
| 1995 |
|---|
| 10 | | Martin Juvan,
Bojan Mohar,
Ante Graovac,
Sandi Klavzar,
Janez Zerovnik:
Fast computation of the Wiener index of fasciagraphs and rotagraphs.
Journal of Chemical Information and Computer Sciences 35(5): 834-840 (1995) |
| 1994 |
|---|
| 9 | | Janez Zerovnik:
A randomized algorithm for k-colorability.
Discrete Mathematics 131(1-3): 379-393 (1994) |
| 8 | | Tomaz Pisanski,
Janez Zerovnik:
Weights on Edges of Chemical Graphs Determined by Paths.
Journal of Chemical Information and Computer Sciences 34(2): 395-397 (1994) |
| 1993 |
|---|
| 7 | | Janez Zerovnik:
Regular Graphs Are 'Difficult' For Colouring.
Informatica (Slovenia) 17(1): (1993) |
| 6 | | Janez Zerovnik,
Tomaz Pisanski:
Computing the Diameter in Multiple-Loop Networks.
J. Algorithms 14(2): 226-243 (1993) |
| 1992 |
|---|
| 5 | | Janez Zerovnik,
M. Kaufman:
A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication).
Parallel Computing 18(8): 897-900 (1992) |
| 1991 |
|---|
| 4 | | Janez Zerovnik:
On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem.
ACPC 1991: 359-368 |
| 3 | | Milan E. Soklic,
Janez Zerovnik:
Distributed simulation of coloring graph vertices.
Annual Simulation Symposium 1991: 118-122 |
| 1990 |
|---|
| 2 | | Janez Zerovnik:
A parallel variant of a heuristical algorithm for graph colouring.
Parallel Computing 13(1): 95-100 (1990) |
| 1989 |
|---|
| 1 | | Janez Zerovnik:
A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph.
Inf. Process. Lett. 33(4): 213-219 (1989) |
