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

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl (2020). Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. Submitted to C&OR.

Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum (2020). An A* Search Algorithm for the Constrained Longest Common Subsequence Problem. Submitted to the Journal Bioinformatics.

Marko Djukanovic, Christoph Berger,  Günther Raidl, and Christian Blum (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem. Submitted to the XI International Conference Optimization and Applications (OPTIMA-2020).

Marko Djukanovic, Günther R. Raidl, Christian Blum (2019). Finding Longest Common Subsequences: New A* Anytime Results. Submitted to ASOC (under review).

 

Accepted/published

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.

M. Djukanovic, G. Raidl, and C. Blum. Heuristic approaches for solving the longest common squared subsequence problem. In Proceedings of EUROCAST 2019 - the 17th International Conference on Computer Aided Systems Theory, Part I, volume 12013, pages 429–437. Springer, 2019.

M. Djukanovic, G. Raidl, and C. Blum. A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation. In Proceedings of LOD 2019 – the 5th International Conference on Machine Learning, Optimization, and Data Science, volume 11943, pages 154–167. Springer, 2019.

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.

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).