Marko Djukanovic

Recent Publications

Exact and heuristic approaches for solving string problems from bioinformatics
Marko Djukanovic
December 2021, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G.~R.~Raidl
PDF Cite DOI
Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problem
Bojan Nikolic, Marko Djukanovic, Dragan Matic
2021, Technical report AC-TR-21-005, Algorithms and Complexity Group, TU Wien.
PDF Cite
An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
Information Processing Letters, volume 166, number 106041, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
PDF Cite DOI
An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien.
PDF Cite
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.
Cite DOI
Finding Longest Common Subsequences: New anytime A$^*$ Search Results
Marko Djukanovic, Günther Raidl, Christian Blum
Applied Soft Computing, volume 95, number 106400, 2020.
PDF Cite
On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 55-79, 2020, Springer.
PDF Cite DOI
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl
2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.
PDF Cite
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini and Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl
Computers & Operations Research, volume 125, number 105089, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
PDF Cite DOI
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019.
Note: accepted for presentation
PDF Cite
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199-214, 2019, Springer.
Cite DOI
Finding Longest Common Subsequences: New A* Anytime Results
Marko Djukanovic, Günther Raidl, Christian Blum
2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.
PDF Cite
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien.
PDF Cite