Marko Djukanovic

Address:
Marko Djukanovic
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Email:	djukanovic@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/djukanovic/

Publications

12 results

2022
[12]	Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences Marko Djukanovic, Aleksandar Kartelj, Dragan Matić, Milana Grbić, Christian Blum, Günther R. Raidl Applied Soft Computing, volume 122, pages 108844, 2022. [bibtex] [pdf] [doi]
2021
[11]	Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Bojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbić, Christian Blum, Günther Raidl Mathematics, volume 9, number 13, 2021. [bibtex] [pdf] [doi]
[10]	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ünter R. Raidl Computers & Operations Research, volume 125, number 105089, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf [bibtex] [pdf] [doi]
2020
[9]	Finding Longest Common Subsequences: New anytime A$^$ Search Results Marko Djukanovic, Günther R. Raidl, Christian Blum Applied Soft Computing*, volume 95, number 106400, 2020. [bibtex] [pdf]
[8]	An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum Information Processing Letters, volume 166, number 106041, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf [bibtex] [pdf] [doi]
[7]	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. [bibtex] [doi]
[6]	On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 134–149, 2020, Springer. [bibtex] [doi]
[5]	On Solving a Generalized Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer. [bibtex] [pdf] [doi]
[4]	A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation Marko Djukanovic, Günther R Raidl, Christian Blum Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer. [bibtex] [pdf] [doi]
2019
[3]	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 429-437, 2019, Springer. [bibtex] [doi]
[2]	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019. Note: accepted for presentation [bibtex] [pdf]
[1]	Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther R. 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. [bibtex] [doi]

Technical Reports

7 results

2021
[7]	Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings Bojan Nikolic, Kartelj Aleksandar, Marko Djukanovic, Milana Grbic, Christian Blum, Guenther Raidl 2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[6]	Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings Marko Djukanovic, Kartelj Aleksandar, Dragan Matic, Milana Grbic, Christian Blum, Guenther Raidl 2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[5]	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. [bibtex] [pdf]
2020
[4]	An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum 2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[3]	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 R. Raidl 2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
2019
[2]	Finding Longest Common Subsequences: New A* Anytime Results Marko Djukanovic, Günther R. Raidl, Christian Blum 2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
2018
[1]	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. [bibtex] [pdf]