The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sandi Klavzar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Franc Novak, Bojan Hvala, Sandi Klavzar
    On Analog Signature Analysis. [Citation Graph (0, 0)][DBLP]
    DATE, 1999, pp:249-0 [Conf]
  2. Vladimir Batagelj, Simona Korenjak-Cerne, Sandi Klavzar
    Dynamic Programming and Convex Clustering. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:93-103 [Journal]
  3. Sandi Klavzar, Ivan Gutman
    A theorem on Wiener-type invariants for isometric subgraphs of hypercubes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:10, pp:1129-1133 [Journal]
  4. Sandi Klavzar, Petra Zigert
    A min-max result on catacondensed benzenoid graphs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2002, v:15, n:3, pp:279-283 [Journal]
  5. Khaled Salem, Sandi Klavzar
    On plane bipartite graphs without fixed edges. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:7, pp:813-816 [Journal]
  6. Bostjan Bresar, Sandi Klavzar
    Square-free colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  7. Johann Hagauer, Sandi Klavzar
    On independence numbers of the cartesian product of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  8. Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
    A characterization of halved cubes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:48, n:, pp:- [Journal]
  9. Pranava K. Jha, Sandi Klavzar
    Independence in Direct-Product Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  10. Sandi Klavzar
    Some new bounds and exact results on the independence number of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:74, n:, pp:- [Journal]
  11. Sandi Klavzar, Alenka Lipovec
    Edge-critical isometric subgraphs of hypercubes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  12. Sandi Klavzar, Uros Milutinovic, Ciril Petr
    Combinatorics of topmost discs of multi-peg Tower of Hanoi problem. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  13. Sandi Klavzar, Aleksander Vesel, Petra Zigert, Ivan Gutman
    Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 2001, v:25, n:6, pp:569-575 [Journal]
  14. Sandi Klavzar, Petra Zigert, Ivan Gutman
    An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 2000, v:24, n:2, pp:229-233 [Journal]
  15. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
    The Cube Polynomial and its Derivatives: the Case of Median Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  16. Joze Rugelj, Sandi Klavzar
    Distributed multicast routing in point-to-point networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:6, pp:521-527 [Journal]
  17. Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
    Fast recognition algorithms for classes of partial cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:51-61 [Journal]
  18. Wilfried Imrich, Sandi Klavzar
    Recognizing Graphs of Acyclic Cubical Complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:321-330 [Journal]
  19. Pranava K. Jha, Sandi Klavzar, Aleksander Vesel
    L(2, 1)-labeling of direct product of paths and cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:317-325 [Journal]
  20. Pranava K. Jha, Sandi Klavzar, Aleksander Vesel
    Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:257-265 [Journal]
  21. Sandi Klavzar, Ivan Gutman
    Wiener Number of Vertex-weighted Graphs and a Chemical Application. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:1, pp:73-81 [Journal]
  22. Sandi Klavzar, Uros Milutinovic, Ciril Petr
    On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:141-157 [Journal]
  23. Sandi Klavzar, Norbert Seifter
    Dominating Cartesian Products of Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:2, pp:129-136 [Journal]
  24. 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]
  25. Sandi Klavzar, Aleksander Vesel
    Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:449-460 [Journal]
  26. Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
    Reconstructing subgraph-counting graph polynomials of increasing families of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:159-166 [Journal]
  27. Bostjan Bresar, Sandi Klavzar
    Theta-graceful labelings of partial cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1264-1271 [Journal]
  28. Sylvain Gravier, Sandi Klavzar, Michel Mollard
    Isometric embeddings of subdivided wheels in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:287-293 [Journal]
  29. Janja Jerebic, Sandi Klavzar
    On induced and isometric embeddings of graphs into the strong product of paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:13, pp:1358-1363 [Journal]
  30. Sandi Klavzar, Hong-Gwa Yeh
    On the fractional chromatic number, the chromatic number, and graph products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:235-242 [Journal]
  31. Sandi Klavzar
    On median nature and enumerative properties of Fibonacci-like cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:145-153 [Journal]
  32. Sandi Klavzar, Alenka Lipovec
    Partial cubes as subdivision graphs and as generalized Petersen graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:157-165 [Journal]
  33. Sandi Klavzar, Alenka Lipovec, Marko Petkovsek
    On subgraphs of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:223-230 [Journal]
  34. Sandi Klavzar, Dragan Marusic, Bojan Mohar
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:1-4 [Journal]
  35. Sandi Klavzar, Riste Skrekovski
    On median graphs and median grid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:287-293 [Journal]
  36. Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
    Resonance graphs of catacondensed even ring systems are median. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:253, n:1-3, pp:35-43 [Journal]
  37. Khaled Salem, Sandi Klavzar, Ivan Gutman
    On the role of hypercubes in the resonance graphs of benzenoid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:699-704 [Journal]
  38. Sandi Klavzar
    Counting hypercubes in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2964-2967 [Journal]
  39. Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:299- [Journal]
  40. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
    On cube-free median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:345-351 [Journal]
  41. Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin
    Nonrepetitive colorings of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:163-172 [Journal]
  42. Bostjan Bresar, Sandi Klavzar
    Maximal proper subgraphs of median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1389-1394 [Journal]
  43. Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
    Dominating direct products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:13, pp:1636-1642 [Journal]
  44. Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar
    Cubic inflation, mirror graphs, regular maps, and partial cubes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:1, pp:54-64 [Journal]
  45. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
    Quasi-median graphs, their generalizations, and tree-like equalities. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:5, pp:557-572 [Journal]
  46. Wilfried Imrich, Sandi Klavzar
    A Convexity Lemma and Expansion Procedures for Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:6, pp:677-685 [Journal]
  47. Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Daniele Parisse, Ciril Petr
    Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:693-708 [Journal]
  48. Wilfried Imrich, Sandi Klavzar
    On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:209-221 [Journal]
  49. Sandi Klavzar
    On the canonical metric representation, average distance, and partial Hamming graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:1, pp:68-73 [Journal]
  50. Sandi Klavzar, Xuding Zhu
    Cartesian powers of graphs can be distinguished by two labels. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:303-310 [Journal]
  51. Sandi Klavzar, Matjaz Kovse
    Partial cubes and their tau-graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1037-1042 [Journal]
  52. Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard
    Hamming polynomials and their partial derivatives. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1156-1162 [Journal]
  53. Wilfried Imrich, Sandi Klavzar
    Recognizing Hamming Graphs in Linear Time and space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:2, pp:91-95 [Journal]
  54. Janja Jerebic, Sandi Klavzar, Simon Spacapan
    Characterizing r-perfect codes in direct products of two and three cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:1, pp:1-6 [Journal]
  55. Sandi Klavzar, Jack H. Koolen, Henry Martyn Mulder
    Graphs which Locally Mirror the Hypercube Structure. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:87-90 [Journal]
  56. Gordon G. Cash, Sandi Klavzar, Marko Petkovsek
    Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 2002, v:42, n:3, pp:571-576 [Journal]
  57. Victor Chepoi, Sandi Klavzar
    The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1997, v:37, n:4, pp:752-755 [Journal]
  58. Ivan Gutman, Sandi Klavzar
    An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:6, pp:1011-1014 [Journal]
  59. Ivan Gutman, Sandi Klavzar
    Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of the Wiener Index. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1997, v:37, n:4, pp:741-744 [Journal]
  60. 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]
  61. Sandi Klavzar, Ivan Gutman
    A Comparison of the Schultz Molecular Topological Index with the Wiener Index. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1996, v:36, n:5, pp:1001-1003 [Journal]
  62. Sandi Klavzar, Ivan Gutman, Bojan Mohar
    Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:3, pp:590-593 [Journal]
  63. Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek
    Hypercubes As Direct Products. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:778-786 [Journal]
  64. Sandi Klavzar, Henry Martyn Mulder
    Partial Cubes and Crossing Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:235-251 [Journal]
  65. Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder
    Median Graphs and Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:111-118 [Journal]
  66. Johann Hagauer, Wilfried Imrich, Sandi Klavzar
    Recognizing Median Graphs in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:123-136 [Journal]
  67. Sandi Klavzar, Iztok Peterin
    Characterizing subgraphs of Hamming graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:302-312 [Journal]
  68. Sandi Klavzar, Bojan Mohar
    Crossing numbers of Sierpinski-like graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:186-198 [Journal]
  69. Bostjan Bresar, Sandi Klavzar, Riste Skrekovski
    Roots of cube polynomials of median graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:1, pp:37-50 [Journal]
  70. Wilfried Imrich, Sandi Klavzar
    Distinguishing Cartesian powers of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:3, pp:250-260 [Journal]
  71. Wilfried Imrich, Sandi Klavzar, Douglas F. Rall
    Cancellation properties of products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2362-2364 [Journal]
  72. Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
    On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2303-2311 [Journal]
  73. Sandi Klavzar, Marko Petkovsek
    Intersection graphs of halflines and halfplanes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:133-137 [Journal]
  74. Victor Chepoi, Sandi Klavzar
    Distances in benzenoid systems: Further developments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:27-39 [Journal]
  75. Sandi Klavzar
    On the fractional chromatic number and the lexicographic product of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:259-263 [Journal]
  76. Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski
    An Euler-type formula for median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:255-258 [Journal]
  77. Johann Hagauer, Sandi Klavzar
    Clique-gated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:143-149 [Journal]
  78. Wilfried Imrich, Sandi Klavzar
    Retracts of strong products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:147-154 [Journal]
  79. Sandi Klavzar
    Two remarks on retracts of graph products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:155-160 [Journal]
  80. Sandi Klavzar
    Coloring graph products - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:155, n:1-3, pp:135-145 [Journal]
  81. Sandi Klavzar, Blaz Zmazek
    On a Vizing-like conjecture for direct product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:243-246 [Journal]
  82. Sandi Klavzar, Uros Milutinovic
    Strong products of Kneser graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:297-300 [Journal]
  83. Sandi Klavzar
    Absolute retracts of split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:134, n:1-3, pp:75-84 [Journal]
  84. Niko Cizek, Sandi Klavzar
    On the chromatic number of the lexicographic product and the Cartesian sum of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:134, n:1-3, pp:17-24 [Journal]
  85. Sandi Klavzar, Bojan Mohar
    The chromatic numbers of graph bundles over cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:301-314 [Journal]

  86. Computing median and antimedian sets in median graphs. [Citation Graph (, )][DBLP]


  87. Distinguishing Infinite Graphs. [Citation Graph (, )][DBLP]


  88. The Fibonacci dimension of a graph [Citation Graph (, )][DBLP]


  89. Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. [Citation Graph (, )][DBLP]


  90. The median function on graphs with bounded profiles. [Citation Graph (, )][DBLP]


  91. The Clar formulas of a benzenoid system and the resonance graph. [Citation Graph (, )][DBLP]


  92. On the remoteness function in median graphs. [Citation Graph (, )][DBLP]


  93. On the geodetic number and related metric sets in Cartesian product graphs. [Citation Graph (, )][DBLP]


  94. Induced cycles in crossing graphs of median graphs. [Citation Graph (, )][DBLP]


  95. Vertex-, edge-, and total-colorings of Sierpinski-like graphs. [Citation Graph (, )][DBLP]


  96. Preface. [Citation Graph (, )][DBLP]


  97. The distinguishing chromatic number of Cartesian products of two complete graphs. [Citation Graph (, )][DBLP]


  98. Tribes of Cubic Partial Cubes. [Citation Graph (, )][DBLP]


  99. The distinguishing number of Cartesian products of complete graphs. [Citation Graph (, )][DBLP]


  100. On semicube graphs. [Citation Graph (, )][DBLP]


  101. On distance-balanced graphs. [Citation Graph (, )][DBLP]


  102. The packing chromatic number of infinite product graphs. [Citation Graph (, )][DBLP]


  103. Preface. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002