Marko Djukanovic, MSc

 

Institute of Computer Graphics and Algorithms 186/1
Faculty of Informatics
TU Wien
Room: HA0410
Favoritenstraße 9-11
1040 Vienna, Austria

email: djukanovic@ac.tuwien.ac.at
phone: +43 1 58801 186131
web: personal homepage

 

 

Supervisor:
Günther Raidl

MSc (Mathematics)

Research area in the program
Combinatorial Optimization

Keywords

  • Metaheuristics
  • Combinatorial optimization

Research Interests

  • Combinatorial optimization
  • Mathematical programming
  • Heuristics

Scientific CV

Education
2014–2016 MSc in Mathematics, Department of Mathematics and Computer Sciences, University of Banja Luka
2009–2013 Diploma in Mathematics and Computer Sciences, Department of Mathematics and Computer Sciences, University of Banja Luka


Academic Positions

2014–2016 Assistant, Department of Mathematics and Computer Sciences, University of Banja
Luka

[ Download CV ]

Publications

Submitted

Djukanovic, M., Raidl, G. & Blum, C. (2019). Anytime Algorithms for the Longest Common Palindromic Subsequence Problem.

Djukanovic, M., Raidl, G. & Blum, C. (2019). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. The Fifth International Conference on Machine Learning, Optimization, and Data Science (LOD 2019).

Accepted/published

Djukanovic, M., Raidl, G. & Blum, C. (2018). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION 12 (Kalamata, Greece). Lecture Notes in Computer Science (special issue of Annals of Mathematics and Artificial Intelligence).

Djukanovic, M., Raidl, G. & Blum, C. (2019). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. In: Battiti R., Brunato M., Kotsireas I., Pardalos P. (ed.) Learning and Intelligent Optimization. Springer, 199-215.