Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein. Constrained LCS: Hardness and Approximation. In Paolo Ferragina, Gad M. Landau, editors, Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Volume 5029 of Lecture Notes in Computer Science, pages 255-262, Springer, 2008. [doi]
@inproceedings{GotthilfHL08,
title = {Constrained LCS: Hardness and Approximation},
author = {Zvi Gotthilf and Danny Hermelin and Moshe Lewenstein},
year = {2008},
doi = {10.1007/978-3-540-69068-9_24},
url = {http://dx.doi.org/10.1007/978-3-540-69068-9_24},
researchr = {https://researchr.org/publication/GotthilfHL08},
cites = {0},
citedby = {0},
pages = {255-262},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings},
editor = {Paolo Ferragina and Gad M. Landau},
volume = {5029},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-69066-5},
}