33 citations · 54 across the 8 of their papers we have counts for
9 papers
Twenty Years of Personality Computing: Threats, Challenges and Future Directions
Fabio Celli, Aleksandar Kartelj, Miljan Đorđević +7
Personality Computing is a field at the intersection of Personality Psychology and Computer Science. Started in 2005, research in the field utilizes computational methods to unders…
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem
Marko Djukanović, Jaume Reixach, Ana Nikolikj +3
This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant…
A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences
Alireza Abdi, Marko Djukanovic, Hesam Tahmasebi Boldaji +2
The Closest String Problem is an NP-hard problem that aims to find a string that has the minimum distance from all sequences that belong to the given set of strings. Its applicatio…
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach
Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj +1
This work focuses on developing an effective meta-heuristic approach to protect against simultaneous attacks on nodes of a network modeled using a graph. Specifically, we focus on…
Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods
Vladimir Filipović, Dragan Matić, Aleksandar Kartelj
In this paper we deal with the signed Roman domination and signed total Roman domination problems. For each problem we propose two integer linear programming (ILP) formulations, th…
Topologically sensitive metaheuristics
Aleksandar Kartelj, Vladimir Filipović, Siniša Vrećica +1
This paper proposes topologically sensitive metaheuristics, and describes conceptual design of topologically sensitive Variable Neighborhood Search method (TVNS) and topologically…
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…
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted -plexes
Milana Grbić, Aleksandar Kartelj, Savka Janković +2
In a network, a -plex represents a subset of vertices where the degree of each vertex in the subnetwork induced by this subset is at least . The maximum edge-weight …
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…