On Solving a Generalized Constrained Longest Common Subsequence Problem

Abstract

Full Citation:

Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum. On Solving a Generalized Constrained Longest Common Subsequence Problem. 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.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.