Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (LION, 2018)

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (EUROCAST (1), 2019)

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (LOD, 2019)

On Solving a Generalized Constrained Longest Common Subsequence Problem. - Marko Djukanovic; Christoph Berger; Günther R. Raidl; Christian Blum 001 (OPTIMA, 2020)

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. - Matthias Horn; Marko Djukanovic; Christian Blum 001; Günther R. Raidl (OPTIMA, 2020)

Finding Longest Common Subsequences: New anytime A∗ search results. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (Appl. Soft Comput., 2020)

Anytime algorithms for the longest common palindromic subsequence problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (Comput. Oper. Res., 2020)

Statistical analysis of correlation between weather parameters and new COVID-19 cases: a case study of Bosnia and Herzegovina. - Tatjana Zec; Aleksandar Kartelj; Marko Djukanovic; Milana Grbic; Dragan Matic (INISTA, 2021)

Solving longest common subsequence problems via a transformation to the maximum clique problem. - Christian Blum 001; Marko Djukanovic; Alberto Santini; Hua Jiang; Chu-Min Li 001; Felip Manyà; Günther R. Raidl (Comput. Oper. Res., 2021)

An A⁎ search algorithm for the constrained longest common subsequence problem. - Marko Djukanovic; Christoph Berger; Günther R. Raidl; Christian Blum 001 (Inf. Process. Lett., 2021)

Application of A* to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. - Marko Djukanovic; Dragan Matic; Christian Blum 001; Aleksandar Kartelj (ICPRAI (2), 2022)

Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. - Marko Djukanovic; Aleksandar Kartelj; Dragan Matic; Milana Grbic; Christian Blum 001; Günther R. Raidl (Appl. Soft Comput., 2022)

New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem. - Bojan Nikolic; Marko Djukanovic; Dragan Matic (Comput. Appl. Math., 2022)

Variable neighborhood search for solving the k-domination problem. - Milan Predojevic; Aleksandar Kartelj; Marko Djukanovic (GECCO Companion, 2023)

RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares. - Aleksandar Kartelj; Marko Djukanovic (J. Big Data, 2023)

Variable neighborhood search for weighted total domination problem and its application in social network information spreading. - Stefan Kapunac; Aleksandar Kartelj; Marko Djukanovic (Appl. Soft Comput., 2023)

Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. - Marko Djukanovic; Aleksandar Kartelj; Christian Blum 001 (Expert Syst. Appl., 2023)

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. - Jaume Reixach; Christian Blum 001; Marko Djukanovic; Günther R. Raidl (EvoStar, 2024)

Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem. - Marko Djukanovic; Aleksandar Kartelj; Tome Eftimov; Jaume Reixach; Christian Blum 001 (ICCS (5), 2024)

Signed double Roman domination on cubic graphs. - Enrico Iurlano; Tatjana Zec; Marko Djukanovic; Günther R. Raidl (Appl. Math. Comput., 2024)

A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences. - Alireza Abdi; Marko Djukanovic; Hesam Tahmasebi Boldaji; Hadis Salehi; Aleksandar Kartelj (CoRR, 2024)

The signed (total) Roman domination problem on some classes of planar graphs - Convex polytopes. - Tatjana Zec; Dragan Matic; Marko Djukanovic (Discret. Math. Algorithms Appl., 2024)

A learning search algorithm for the Restricted Longest Common Subsequence problem. - Marko Djukanovic; Jaume Reixach; Ana Nikolikj; Tome Eftimov; Aleksandar Kartelj; Christian Blum 001 (Expert Syst. Appl., 2025)

Graph protection under multiple simultaneous attacks: A heuristic approach. - Marko Djukanovic; Stefan Kapunac; Aleksandar Kartelj; Dragan Matic (Knowl. Based Syst., 2025)

A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem. - Jaume Reixach; Christian Blum 001; Marko Djukanovic; Günther R. Raidl (IEEE Trans. Evol. Comput., 2025)