Shlomo Ahal, Yuri Rabinovich. On the Complexity of the Sub-permutation Problem. In Magnús M. Halldórsson, editor, Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings. Volume 1851 of Lecture Notes in Computer Science, pages 490-503, Springer, 2000. [doi]
@inproceedings{AhalR00,
title = {On the Complexity of the Sub-permutation Problem},
author = {Shlomo Ahal and Yuri Rabinovich},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1851/18510490.htm},
researchr = {https://researchr.org/publication/AhalR00},
cites = {0},
citedby = {0},
pages = {490-503},
booktitle = {Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
editor = {Magnús M. Halldórsson},
volume = {1851},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67690-2},
}