The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Janez Zerovnik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  45. Edge fault-diameter of Cartesian graph bundles. [Citation Graph (, )][DBLP]


  46. Partial cubes are distance graphs. [Citation Graph (, )][DBLP]


  47. Hamilton cycles in graph bundles over a cycle with tree as a fibre. [Citation Graph (, )][DBLP]


  48. Wide diameter of Cartesian graph bundles. [Citation Graph (, )][DBLP]


  49. An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. [Citation Graph (, )][DBLP]


  50. The edge fault-diameter of Cartesian graph bundles. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.084secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002