Matthias Horn, Günther R. Raidl. *-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. In Peter J. Stuckey, editor, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5-8, 2021, Proceedings. Volume 12735 of Lecture Notes in Computer Science, pages 72-88, Springer, 2021. [doi]
@inproceedings{HornR21,
title = {*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem},
author = {Matthias Horn and Günther R. Raidl},
year = {2021},
doi = {10.1007/978-3-030-78230-6_5},
url = {https://doi.org/10.1007/978-3-030-78230-6_5},
researchr = {https://researchr.org/publication/HornR21},
cites = {0},
citedby = {0},
pages = {72-88},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5-8, 2021, Proceedings},
editor = {Peter J. Stuckey},
volume = {12735},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-78230-6},
}