People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic
,
Günther Raidl
,
Christian Blum
January 2019
Cite
DOI
Type
Conference Paper
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×