3 citations · 3 across the 5 of their papers we have counts for
6 papers
Balanced Domination in Convex Polytopes, Trees, and Grid Graphs
Bojan Nikolic, Marko Djukanovic
This paper addresses two open questions posed in [27] regarding the balanced domination number in graphs. We show that three new classes of graphs, those of convex polytopes A_n, D…
Longest Filled Common Subsequence for Song Identification from Degraded Audio via Construct--Merge--Solve--Adapt Optimization
Marko Djukanovic, Christian Blum, Aleksandar Kartelj +2
This paper addresses the Longest Filled Common Subsequence (LFCS) problem, a challenging NP-hard problem with applications in bioinformatics, including gene mutation prediction and…
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…
Signed double Roman domination on cubic graphs
Enrico Iurlano, Tatjana Zec, Marko Djukanovic +1
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from to each vertex feasibly, such that the…
The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs -- Convex Polytopes
Tatjana Zec, Marko Djukanovic, Dragan Matic
In this paper we deal with the calculation of the signed (total) Roman domination numbers, and respectively, on a few classes of planar graphs from the literatur…