33 citations · 54 across the 6 of their papers we have counts for
6 papers
Some new general lower bounds for mixed metric dimension of graphs
Milica Milivojević Danas, Jozef Kratica, Aleksandar Savić +1
Let be a connected simple graph. The distance between vertices and from is the number of edges in the shortest path. If is an edge…
An Integer Linear Programming Formulation for the Convex Dominating Set Problems
Jozef Kratica, Vladimir Filipovic, Dragan Matic +1
Due to their importance in practice, dominating set problems in graphs have been greatly studied in past and different formulations of these problems are presented in literature. T…
Edge metric dimension of some generalized Petersen graphs
Vladimir Filipovic. Aleksandar Kartelj, Jozef Kratica
The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations a…
Some properties of -packing function problem in graphs
Jozef J. Kratica, Aleksandar Lj. Savić, Zoran Lj. Maksimović
The recently introduced -packing function problem is considered in this paper. Special relation between a case when , and linear programming relaxation is intr…
The strong metric dimension of some generalized Petersen graphs
Jozef Kratica, Vera Kovačević-Vujčić, Mirjana Čangalović
In this paper the strong metric dimension of generalized Petersen graphs is considered. The exact value is determined for cases and , while for an…
Variable Neighborhood Search for solving Bandwidth Coloring Problem
Dragan Matic, Jozef Kratica, Vladimir Filipovic
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are general…