Christoph Berger

Recent Publications

Solving a Generalized Constrained Longest Common Subsequence Problem
Christoph Berger
June 2020, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Djukanovic
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
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