33 citations · 54 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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…