Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Künnemann, Marvin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Bringmann, K., & Künnemann, M. (2018). Multivariate Fine-Grained Complexity of Longest Common Subsequence. In A. Czumaj (Ed.), Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1216-1235). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.79.