Sandi Klavzar
Orcid: 0000-0002-1556-4744Affiliations:
- University of Ljubljana, Faculty of Mathematics and Physics
According to our database1,
Sandi Klavzar authored at least 301 papers
between 1987 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2026
Comput. Appl. Math., April, 2026
Discret. Math., 2026
Discret. Appl. Math., 2026
Discret. Appl. Math., 2026
Appl. Math. Comput., 2026
2025
CoRR, December, 2025
Graphs Comb., August, 2025
CoRR, April, 2025
Discret. Math. Theor. Comput. Sci., 2025
Discuss. Math. Graph Theory, 2025
Appl. Math. Comput., 2025
Appl. Math. Comput., 2025
2024
Theor. Comput. Sci., 2024
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products.
Discuss. Math. Graph Theory, 2024
Discret. Appl. Math., 2024
AKCE Int. J. Graphs Comb., 2024
2023
Theor. Comput. Sci., October, 2023
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3.
Discret. Appl. Math., October, 2023
Theor. Comput. Sci., September, 2023
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension.
Appl. Math. Comput., September, 2023
Comput. Appl. Math., February, 2023
Discret. Math. Theor. Comput. Sci., 2023
Comput. Appl. Math., 2023
Appl. Math. Comput., 2023
Appl. Math. Comput., 2023
WorldScientific, ISBN: 9789811269165, 2023
2022
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs.
Discret. Math., 2022
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks.
Appl. Math. Comput., 2022
2021
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.
J. Supercomput., 2021
Optim. Lett., 2021
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength.
J. Graph Algorithms Appl., 2021
J. Comb. Optim., 2021
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee.
Inf. Process. Lett., 2021
Discuss. Math. Graph Theory, 2021
Discuss. Math. Graph Theory, 2021
Discret. Appl. Math., 2021
Appl. Math. Comput., 2021
Some binary products and integer linear programming for k-metric dimension of graphs.
Appl. Math. Comput., 2021
2020
Eur. J. Comb., 2020
Discuss. Math. Graph Theory, 2020
Discret. Math., 2020
Local metric dimension of graphs: Generalized hierarchical products and some applications.
Appl. Math. Comput., 2020
Appl. Math. Comput., 2020
2019
J. Appl. Math. Comput., June, 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Discret. Appl. Math., 2019
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs.
CoRR, 2019
Central Eur. J. Oper. Res., 2019
Characterization of general position sets and its applications to cographs and bipartite graphs.
Appl. Math. Comput., 2019
2018
Fundam. Informaticae, 2018
Discret. Appl. Math., 2018
Ars Math. Contemp., 2018
Appl. Math. Comput., 2018
On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs.
Appl. Math. Comput., 2018
Art Discret. Appl. Math., 2018
2017
Discret. Appl. Math., 2017
Graphs that are simultaneously efficient open domination and efficient closed domination graphs.
Discret. Appl. Math., 2017
2016
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five.
Graphs Comb., 2016
Discuss. Math. Graph Theory, 2016
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two.
Comput. J., 2016
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs.
Comput. J., 2016
Modified Wiener index via canonical metric representation, and some fullerene patches.
Ars Math. Contemp., 2016
2015
Discret. Math. Theor. Comput. Sci., 2015
Discret. Appl. Math., 2015
2014
Average distance, surface area, and other structural properties of exchanged hypercubes.
J. Supercomput., 2014
Improved bounds on the difference between the Szeged index and the Wiener index of graphs.
Eur. J. Comb., 2014
Eur. J. Comb., 2014
Discret. Math., 2014
Discret. Optim., 2014
Discret. Appl. Math., 2014
2013
Discret. Appl. Math., 2013
2012
Discuss. Math. Graph Theory, 2012
A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs.
Discret. Appl. Math., 2012
2011
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes.
Comput. Math. Appl., 2011
2010
Discret. Math., 2010
Comput. Math. Appl., 2010
2009
Discret. Appl. Math., 2009
Ars Math. Contemp., 2009
On Even and Harmonic-Even Partial Cubes.
Ars Comb., 2009
2008
IEEE Trans. Circuits Syst. II Express Briefs, 2008
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs.
Electron. Notes Discret. Math., 2008
Eur. J. Comb., 2008
Discret. Math., 2008
2007
SIAM J. Discret. Math., 2007
Electron. Notes Discret. Math., 2007
Comb. Probab. Comput., 2007
2006
The Δ<sup>2</sup>-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2006
On the canonical metric representation, average distance, and partial Hamming graphs.
Eur. J. Comb., 2006
Discuss. Math. Graph Theory, 2006
Discret. Math., 2006
Discret. Math., 2006
Appl. Math. Lett., 2006
Adv. Appl. Math., 2006
2005
Inf. Process. Lett., 2005
Eur. J. Comb., 2005
Discret. Math., 2005
Discret. Math., 2005
Optimal <i>L</i>(<i>d</i>, 1)-labelings of certain direct products of cycles and Cartesian products of cycles.
Discret. Appl. Math., 2005
Discret. Appl. Math., 2005
Some new bounds and exact results on the independence number of Cartesian product graphs.
Ars Comb., 2005
2004
Edge-critical isometric subgraphs of hypercubes.
Ars Comb., 2004
Square-free colorings of graphs.
Ars Comb., 2004
2003
Eur. J. Comb., 2003
Discret. Math., 2003
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers.
Discret. Appl. Math., 2003
Electron. J. Comb., 2003
Australas. J Comb., 2003
2002
J. Chem. Inf. Comput. Sci., 2002
Discret. Math., 2002
Discret. Appl. Math., 2002
2001
Comput. Chem., 2001
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem.
Ars Comb., 2001
2000
An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons.
Comput. Chem., 2000
1999
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract).
Electron. Notes Discret. Math., 1999
1998
Discret. Math., 1998
Independence in Direct-Product Graphs.
Ars Comb., 1998
A characterization of halved cubes.
Ars Comb., 1998
Proceedings of the Discrete Mathematical Chemistry, 1998
1997
Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of the Wiener Index.
J. Chem. Inf. Comput. Sci., 1997
J. Chem. Inf. Comput. Sci., 1997
Discuss. Math. Graph Theory, 1997
Discret. Appl. Math., 1997
1996
J. Chem. Inf. Comput. Sci., 1996
Eur. J. Comb., 1996
On independence numbers of the cartesian product of graphs.
Ars Comb., 1996
1995
J. Chem. Inf. Comput. Sci., 1995
J. Chem. Inf. Comput. Sci., 1995
J. Chem. Inf. Comput. Sci., 1995
1994
On the chromatic number of the lexicographic product and the Cartesian sum of graphs.
Discret. Math., 1994
1992
1988
Microprocess. Microprogramming, 1988
1987