Marko Djukanovic

29 papers C 1Journal 19Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem.
IEEE Trans. Evol. Comput.
Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl
2025 J jnl
A learning search algorithm for the Restricted Longest Common Subsequence problem.
Expert Syst. Appl.
Marko Djukanovic, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum
2025 J jnl
An Adaptive CMSA for Solving the Longest Filled Common Subsequence Problem with an Application in Audio Querying.
CoRR
Marko Djukanovic, Christian Blum, Aleksandar Kartelj, Ana Nikolikj, Günther R. Raidl
2025 J jnl
Graph protection under multiple simultaneous attacks: A heuristic approach.
Knowl. Based Syst.
Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj, Dragan Matic
2024 J jnl
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem.
CoRR
Marko Djukanovic, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum
2024 — conf
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.
EvoStar
Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl
2024 J jnl
A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences.
CoRR
Alireza Abdi, Marko Djukanovic, Hesam Tahmasebi Boldaji, Hadis Salehi, Aleksandar Kartelj
2024 — conf
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem.
ICCS (5)
Marko Djukanovic, Aleksandar Kartelj, Tome Eftimov, Jaume Reixach, Christian Blum
2024 J jnl
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach.
CoRR
Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj, Dragan Matic
2024 J jnl
Signed double Roman domination on cubic graphs.
Appl. Math. Comput.
Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl
2024 J jnl
The signed (total) Roman domination problem on some classes of planar graphs - Convex polytopes.
Discret. Math. Algorithms Appl.
Tatjana Zec, Dragan Matic, Marko Djukanovic
2023 J jnl
RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares.
J. Big Data
Aleksandar Kartelj, Marko Djukanovic
2023 J jnl
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem.
Expert Syst. Appl.
Marko Djukanovic, Aleksandar Kartelj, Christian Blum
2023 J jnl
Signed double Roman domination on cubic graphs.
CoRR
Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl
2023 — conf
Variable neighborhood search for solving the k-domination problem.
GECCO Companion
Milan Predojevic, Aleksandar Kartelj, Marko Djukanovic
2023 J jnl
Variable neighborhood search for weighted total domination problem and its application in social network information spreading.
Appl. Soft Comput.
Stefan Kapunac, Aleksandar Kartelj, Marko Djukanovic
2022 — conf
Application of A
ICPRAI (2)
Marko Djukanovic, Dragan Matic, Christian Blum, Aleksandar Kartelj
2022 J jnl
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences.
Appl. Soft Comput.
Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl
2022 J jnl
New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem.
Comput. Appl. Math.
Bojan Nikolic, Marko Djukanovic, Dragan Matic
2021 J jnl
An A
Inf. Process. Lett.
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
2021 J jnl
Solving longest common subsequence problems via a transformation to the maximum clique problem.
Comput. Oper. Res.
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
2021 C conf
Statistical analysis of correlation between weather parameters and new COVID-19 cases: a case study of Bosnia and Herzegovina.
INISTA
Tatjana Zec, Aleksandar Kartelj, Marko Djukanovic, Milana Grbic, Dragan Matic
2020 J jnl
Anytime algorithms for the longest common palindromic subsequence problem.
Comput. Oper. Res.
Marko Djukanovic, Günther R. Raidl, Christian Blum
2020 J jnl
Finding Longest Common Subsequences: New anytime A∗ search results.
Appl. Soft Comput.
Marko Djukanovic, Günther R. Raidl, Christian Blum
2020 — conf
On Solving a Generalized Constrained Longest Common Subsequence Problem.
OPTIMA
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
2020 — conf
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences.
OPTIMA
Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl
2019 — conf
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.
LOD
Marko Djukanovic, Günther R. Raidl, Christian Blum
2019 — conf
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem.
EUROCAST (1)
Marko Djukanovic, Günther R. Raidl, Christian Blum
2018 — conf
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem.
LION
Marko Djukanovic, Günther R. Raidl, Christian Blum