др Марко Ђукановић

Milan Predojević
 
др Марко Ђукановић
доцент

Ужа научна област: Информационе науке и биоинфроматика (развој софтвера)

Катедра: Катедра за рачунарске и информатичке науке

Образовање:

  • Јул, 2013. Дипломирани математичар и информатичар, Природно-математички факултет, Универзитет у Бањој Луци (9.87/10.00)
  • Март, 2016. Мастер математичар, Природно-математички факултет, Универзитет у Бањој Луци (10.00/10.00)
  • Мај, 2021. Доктор техничких наука (Компјутерске науке), ТУ Вин, Беч, Аустрија (докторат одбрањен са највишом похвлом)

Радови објављени у водећим међународним часописима:

  1. Nikolić, B., Djukanović, M., Grbić, M., & Matić, D. (2023). Theoretical Studies of the k-Strong Roman Domination Problem. The Kuwait Journal of Science, 1-30.
  2. Reixach, J., Blum, C., Djukanović, M., & Raidl, G. R. (2024). A biased random key genetic algorithm for solving the longest common square subsequence problem. IEEE Transactions on Evolutionary Computation.
  3. 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)
  4. 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)
  5. 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)
  6. 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)
  7. 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)
  8. 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)
  9. 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)
  10. 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)
  11. 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)
  12. 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)
  13. 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)

Радови у осталим међународним часописима:

  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.

Радови објављени на међународним конференцијама штампани у цјелини (conference proceedings):

  1. Djukanović, M., Kartelj, A., Eftimov, T., Reixach, J., & Blum, C. (2024, June). Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem. In International Conference on Computational Science (pp. 58-73). Cham: Springer Nature Switzerland.
  2. Reixach, J., Blum, C., Djukanović, M., & Raidl, G. R. (2024, April). A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar) (pp. 1-15). Cham: Springer Nature Switzerland.
  3. 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.
  4. 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).
  5. 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.
  6. 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.
  7. 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
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.

Радови објављени у националним часописима:

  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. (2011). Uređivanje složenih crteža pomoću grafičkog jezika. Softverske aplikacije, informacione tehnologije, 7 (5), 69-79.

Новости

12. јул, 2024 – Учествовао сам на панел дискусији „Facilitating the Transfer of Knowledge and Innovation between Bosnia and Herzegovina and Our Global Expert Community“ организованој од стране B&H Futures Foundation (линк).

04. јул, 2024 – Рад под називом „Theoretical studies of the k-strong Roman domination problem“ (са B. Nikolić, M. Grbić и D. Matić) прихваћен је у The Kuwait Journal of Science (IF: 1.9).

04. јун, 2024 – Рад под називом „A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem“ (са J. Reixach, C. Blum и G. Raidl) прихваћен је у IEEE Transactions on Evolutionary Computation (IF: 14.3).

09. април, 2024 – Рад под називом „On double Roman domination problem for several graph classes“ (са T. Zec и D. Matić) прихваћен је у Aequationes mathematicae.

05. април, 2024 – Рад под називом „A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem“ добитник је награде за најбољи рад на конференцији EvoStar, одржаној у Велсу, Уједињено Краљевство.

02. април, 2024 – Рад под називом „Efficient Search Algorithms for solving the Restricted Longest Common Subsequence Problem“ прихваћен је за излагање на ICCS 2024, која ће се одржати у Малаги (02.07.-04.07.2024).

05. март, 2024 – Рад под називом „Signed double Roman domination on cubic graphs“ сада је јавно доступан на линку.