Parameterized Complexity of Superstring Problems. Bliznets, I., Fomin, F. V., Golovach, P. A., Karpov, N., Kulikov, A. S., & Saurabh, S. In Proceedings of Combinatorial Pattern Matching (CPM), pages 89-99, 2015.
Parameterized Complexity of Superstring Problems [link]Paper  bibtex   
@inproceedings{ dblp1761305,
  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},
  author_short = {Bliznets, I. and Fomin, F. V. and Golovach, P. A. and Karpov, N. and Kulikov, A. S. and Saurabh, S.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2015},
  key = {dblp1761305},
  id = {dblp1761305},
  biburl = {http://www.dblp.org/rec/bibtex/conf/cpm/BliznetsFGKKS15},
  url = {http://dx.doi.org/10.1007/978-3-319-19929-0_8},
  conference = {CPM},
  pages = {89-99},
  text = {CPM 2015:89-99},
  booktitle = {Proceedings of Combinatorial Pattern Matching (CPM)}
}

Downloads: 0