Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh. Parameterized Complexity of Superstring Problems. In Ferdinando Cicalese, Ely Porat, Ugo Vaccaro, editors, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Volume 9133 of Lecture Notes in Computer Science, pages 89-99, Springer, 2015. [doi]
@inproceedings{BliznetsFGKKS15,
title = {Parameterized Complexity of Superstring Problems},
author = {Ivan Bliznets and Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov and Saket Saurabh},
year = {2015},
doi = {10.1007/978-3-319-19929-0_8},
url = {http://dx.doi.org/10.1007/978-3-319-19929-0_8},
researchr = {https://researchr.org/publication/BliznetsFGKKS15},
cites = {0},
citedby = {0},
pages = {89-99},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
editor = {Ferdinando Cicalese and Ely Porat and Ugo Vaccaro},
volume = {9133},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-19928-3},
}