Christian Blum

Recent Publications

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 https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
PDF bib 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 bib
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.
bib 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 bib
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 bib DOI