Matthias Horn, Marko Djukanovic, Christian Blum 0001, Günther R. Raidl. On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. In Nicholas N. Olenev, Yuri Evtushenko, Mikhail Yu. Khachay, Vlasta Malkova, editors, Optimization and Applications - 11th International Conference, OPTIMA 2020, Moscow, Russia, September 28 - October 2, 2020, Proceedings. Volume 12422 of Lecture Notes in Computer Science, pages 134-149, Springer, 2020. [doi]
@inproceedings{HornDBR20,
title = {On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences},
author = {Matthias Horn and Marko Djukanovic and Christian Blum 0001 and Günther R. Raidl},
year = {2020},
doi = {10.1007/978-3-030-62867-3_11},
url = {https://doi.org/10.1007/978-3-030-62867-3_11},
researchr = {https://researchr.org/publication/HornDBR20},
cites = {0},
citedby = {0},
pages = {134-149},
booktitle = {Optimization and Applications - 11th International Conference, OPTIMA 2020, Moscow, Russia, September 28 - October 2, 2020, Proceedings},
editor = {Nicholas N. Olenev and Yuri Evtushenko and Mikhail Yu. Khachay and Vlasta Malkova},
volume = {12422},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-62867-3},
}