Jul, 2013. Diplomirani matematičar i informatičar, Prirodno-matematički fakultet, Univerzitet u Banjoj Luci (9.87/10.00)
Mart, 2016. Master matematičar, Prirodno-matematički fakultet, Univerzitet u Banjoj Luci (10.00/10.00)
Maj, 2021. Doktor tehničkih nauka (Kompjuterske nauke), TU Wien, Beč, Austrija (doktorat odbranjen sa najvišom pohvlom)

Radovi objavljenu i vodećim međunarodnim časopisima:

1. E. Iurlano, T. Zec, M. Djukanovic, G. R. Raidl (2024). Signed double Roman domination on cubic graphs, Applied Mathematics and Computation, Volume 471 (IF: 4.0)

2. M Djukanovic, A Kartelj, C Blum (2023). Self-Adaptive Cmsa for Solving the Multidimensional Multi-Way Number Partitioning Problem. Expert Systems with Applications, 232: 120762 (IF 8.5)
3. A Kartelj, M Djukanovic (2023). RILS-ROLS: Robust Symbolic Regression via Iterated Local Search and Ordinary Least Squares. Journal of Big Data 10 (71), 1-28 (IF 10.1)
4.S Kapunac, A Kartelj, M Djukanovic (2023). Variable Neighborhood Search for Weighted Total Domination Problem and Its Application in Social Network Information Spreading. Applied Soft Computing, 110387 (IF 8.7)
5. Djukanovic, M., Kartelj A., Matić D., Grbić M., Blum C., & Raidl, G. R. (2022). Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Applied Soft Computing, 122, 108844 (IF 6.725)
6. Nikolic, B., Djukanovic, M. & Matic, D. (2022). New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem. Comp. Appl. Math. 41, 119 (IF 2.239)
7. Nikolic B, Kartelj A, Djukanovic M, Grbic M, Blum C, Raidl G. (2021) Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings. Mathematics, 9(13):1515. (IF 2.258)
8. Blum, C., Djukanovic, M., Santini, A., Jiang, H., Li, C. M., Manyà, F., & Raidl, G. R. (2021). Solving longest common subsequence
problems via a transformation to the maximum clique problem. Computers & Operations Research, 125, 105089. (IF 4.008)
9. Djukanovic, M., Berger, C., Raidl, G. R., & Blum, C. (2021). An A* search algorithm for the constrained longest common subsequence problem. Information Processing Letters, 166, 106041. (IF 0.959)
10. Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Finding Longest Common Subsequences: New anytime A* search results. Applied Soft Computing, 95, 106499. (IF 6.725)

11. Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Anytime algorithms for the longest common palindromic subsequence problem. Computers & Operations Research, 114, 104827. (IF 4.008)

Radovi u ostalim međunarodnom časopisima:

1. Predojević M., Đukanović M., Grbić M., Dragan M. (2021). Can greedy-like heuristics be useful for solving the Weighted Orthogonal Art Gallery Problem under regular grid discretization?, International Journal of Electrical Engineering and Computing, 5 (2): 77–85

Radovi objaveni na međunarodnim konferencijama štampani u cjelini (conference proceedings):

1.Predojević, M., Kartelj, A., & Djukanović, M., Variable neighborhood search for solving the k-domination problem. In Proceedings of the Companion Conference on Genetic and Evolutionary Computation (pp. 239-242), Lisbon, Portugal, 2023.
2. Djukanović, M., Kartelj, A., Integrating Top-level Constraints into a Symbolic Regression Search Algorithm. In 2023 Second Serbian International Conference on Applied Artificial Intelligence (SICAAI), Kragujevac, Serbia, 2023. (Best paper award).
3. Djukanovic, M., Matic, D., Blum, C., & Kartelj, A. (2022). Application of A* to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. In International Conference on Pattern Recognition and Artificial Intelligence (pp. 53-64). Springer, Cham.
4. Jaguzović, M., Grbić, M., Ðukanović, M., and Matić. D. (2022) Identification of protein complexes by overlapping community detection algorithms: A comparative study. In Proceedings of 21st International Symposium INFOTEH-JAHORINA (INFOTEH). pp. 1-6, doi:10.1109/INFOTEH53737.2022.9751314.
5. Zec, T., Kartelj, A., Djukanović, M., Grbić, M., and Matić, D. (2021). Statistical analysis of correlation between weather parameters and new COVID-19 cases: a case study of Bosnia and Herzegovina. In Proceedings of 15th International Conference on INnovations in Intelligent SysTems and Applications
(INISTA). pp. 1-6
6. Crnogorac,V., Grbić, M., Đukanović, M., and Matić, D. (2021). Clustering of European countries and territories based on cumulative relative number of COVID 19 patients in 2020. In Proceedings of 20th International Symposium INFOTEH-JAHORINA (INFOTEH). pp. 1-6, doi: 10.1109/INFOTEH51037.2021.9400670.
7. Djukanovic, M., Berger, C., Raidl, G.R., Blum, C. (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem . In Optimization and Applications. OPTIMA 2020. Lecture Notes in Computer Science(), vol 12422.Springer, Cham.
8. Horn, M., Djukanovic, M., Blum, C., Raidl, G.R. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences . In Optimization and Applications. OPTIMA 2020. Lecture Notes in Computer Science(), vol 12422. Springer, Cham.
9. Djukanovic, M., Raidl, G.R., Blum, C. (2020). A Heuristic Approach for Solving the Longest Common Square Subsequence Problem . In Computer Aided Systems Theory – EUROCAST 2019. EUROCAST 2019. Lecture Notes in Computer Science(), vol 12013. Springer, Cham.
10. Djukanovic, M., Raidl, G.R., Blum, C. (2019). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation . In Machine Learning, Optimization, and Data Science. LOD 2019. Lecture Notes in Computer Science(), vol 11943. Springer, Cham.
11. Djukanovic, M., Raidl, G.R., Blum, C. (2018). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem . In Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham.

Radovi objavljeni u nacionalnim časopisima:

1.Djukanović, M (2015). Solving the Facility location problem by using Variable Neighborhood Search and Particle Swarm Optimization (in Serbian), Mat – Kol, XXI (2), 117-129

2. Ðukanović, M., & Radić, D. (2016). Primjena usmjerenih hipergrafova za predstavljanje funkcionalnih zavisnosti u relacionim modelima. Mat-Kol. XXII(1), 61-69

Projektne aktivnosti:

U svojstvu koordinatora na sljedećim projektima:

1. Projekat „Theoretical and computational aspects of Roman domination problem“ u okviru bilateralne saradnje između BiH i Austrije, 2023-2024 (budžet 10,000 KM finansijer je Ministarstvo civilnih poslova BiH). Koordinator sa austrijske strane je prof. Ginter Rajdl sa Tehničkog univerziteta u Beču.

2. Projekat „Theoretical and computational aspects of some graph problems with applications on network information spreading“ u okviru bilateralne saradnje između BiH i Slovenije, 2024-2025 (budžet 4,000 KM finansijer je Ministarstvo za naučnotehnoloski razvoj, visoko obrazovanje i informaciono društvo). Koordinator sa slovenske strane je Tome Eftimov sa Instituta Jožef Štefan u Ljubljani.

3. Projekat „Razvoj novih modela i algoritama vještačke inteligencije za rješavanje teških problema kombinatorne optimizacije“ (odobren, finanijer Ministarstvo za naučnotehnoloski razvoj, visoko obrazovanje i informaciono društvo), 2024-2025

4. Član COST akcije ROAR-NET (https://roar-net.eu/), i to WG1 (WG1. Problem modelling and user experience), 2023-2027

Nagrade i priznanja:

1. Nagrada za najbolji rad na konferenciji „EvoStar“ (Aberystwyth University, Walles, 03.04.-05.04.2024), u autorstvu sa J. Reixach, C. Blum, i G. Raidl, za rad pod nazivom „A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem“, informacije na linku https://www.evostar.org/2024/awards/ (2024)

2. „Zlatna plaketa“ za izuzetna naučna dostignuća Opštine Novi Grad (jul, 2023)

3. Nagrada za najbolji rad na konferenciji „Second Serbian International Conference on Applied Artificial Intelligence (SICAAI)“, u koautorstvu sa kolegom A. Karteljom (2023)

4. Danubius Young Scientist Award,  dobitnik za BiH (2022)
5.  „Dr Milan jelić“ stupendija u kategoriji studenata doktorskih studija (2020)
6. „Zlatna plaketa“: dodjeljena najboljem studentu generacije 2009. na PMF-u (2014)

7. „Dr Milan Jelić“ stipendija za studente osnovnih studija 2010-2013

Nastava:

Ljetnji semestar, akademske 2022/23.

1. Proceduralno programiranje

2. Projektovanje baza podataka

3. Uvod u vještačku inteligenciju

4. Uvod u programiranje

Zimski semestar akademske 2023/24.

1. Operaciona istraživanja

2. Baze podataka / Relacione baze podataka

3. Informacioni sistemi

(Materijali sa datih kurseva se mogu naći na odgovarajućim Gugl učionicama.)

Novosti

09. april, 2024 – Rad pod nazivom “ „On double Roman domination problem for several graph classes“ (u autorstvu sa T. Zec i D. Matićem) je prihvaćen u Aequationes mathematicae

05. april, 2024  – Rad pod nazivom “A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem“‘ dobitnik je narade za najbolji rad na konferenciji EvoStar, održanoj u Velsu, Ujedinjeno kraljevstvo

02. april, 2024: Rad pod nazivom „Efficient Search Algorithms for solving the Restricted Longest Common Subsequence Problem“ prihvaćen za izlaganje na ICCS 2024, koja će se održati u Malagi (02.07.-04.07.2024)

05.mart, 2024 – Rad pod nazivom „Signed double Roman domination on cubic graphs“ je sada javno dostupan na linku:  https://www.sciencedirect.com/science/article/pii/S0096300324000845