Anytime algorithms for the longest common palindromic subsequence problem M Djukanovic, GR Raidl, C Blum Computers & Operations Research 114, 104827, 2019 | 9 | 2019 |

A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation M Djukanovic, GR Raidl, C Blum International Conference on Machine Learning, Optimization, and Data Science …, 2019 | 7 | 2019 |

Solving longest common subsequence problems via a transformation to the maximum clique problem C Blum, M Djukanovic, A Santini, H Jiang, CM Li, F Manyà, GR Raidl Computers & Operations Research 125, 105089, 2021 | 5 | 2021 |

Finding Longest Common Subsequences: New anytime A* search results M Djukanovic, GR Raidl, C Blum Applied Soft Computing 95, 106499, 2020 | 4 | 2020 |

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. M Djukanovic, GR Raidl, C Blum EUROCAST (1), 429-437, 2019 | 4 | 2019 |

Exact and heuristic approaches for the longest common palindromic subsequence problem M Djukanovic, GR Raidl, C Blum International Conference on Learning and Intelligent Optimization, 199-214, 2018 | 4 | 2018 |

An A* search algorithm for the constrained longest common subsequence problem M Djukanovic, C Berger, GR Raidl, C Blum Information Processing Letters, 106041, 2020 | 3 | 2020 |

On Solving a Generalized Constrained Longest Common Subsequence Problem M Djukanovic, C Berger, GR Raidl, C Blum OPTIMA 2020 1242, 55-70, 2020 | 2 | 2020 |

The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs--Convex Polytopes T Zec, M Djukanovic, D Matic arXiv preprint arXiv:2107.08263, 2021 | | 2021 |

Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings B Nikolic, A Kartelj, M Djukanovic, M Grbic, C Blum, G Raidl Mathematics 9 (13), 1515, 2021 | | 2021 |

Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings B Nikolic, A Kartelj, M Djukanovic, M Grbic, C Blum, G Raidl https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-009.pdf, p. 1515, 2021 | | 2021 |

Graph Search and Variable Neighbourhood Search for Finding Constrained Longest Common Subsequences on Artificial and Real Gene Sequences M Djukanovic, A Kartelj, D Matic, M Grbic, C Blum, G Raidl https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-008.pdf, 2021 | | 2021 |

Clustering of European countries and territories based on cumulative relative number of COVID 19 patients in 2020 V Crnogorac, M Grbić, M Đukanović, D Matić 2021 20th International Symposium INFOTEH-JAHORINA (INFOTEH), 1-6, 2021 | | 2021 |

Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problem B Nikolic, M Djukanovic, D Matic https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-005.pdf, 2021 | | 2021 |

Exact and Heuristic Approaches for Solving String Problems from Bioinformatics M Djukanovic Wien, 2021 | | 2021 |

On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence⋆ M Horn, M Djukanovic, C Blum, GR Raidl The Book of Extended Abstracts of CPIOR conference, 2020 | | 2020 |

On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence M Horn, M Djukanovic, C Blum, GR Raidl OPTIMA 2020, 1242, 134-149, 2020 | | 2020 |

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem− Supplementary Material− M Djukanovic, GR Raidl, C Blum | | 2020 |

Primjena usmjerenih hipergrafova za predstavljanje funkcionalnih zavisnosti u relacionim modelima DR M. Djukanovic MAT-KOL 22 (1), 61-69, 2016 | | 2016 |

Rješavanje lokacijskog problema ogranicenih kapaciteta primjenom algoritma promjenjivih okolina i algoritma roja cestica M Djukanovic MAT-KOL 21, 117-129, 2015 | | 2015 |