4 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…
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…