External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Parameterized Complexity of Superstring Problems

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]

Authors

Ivan Bliznets

This author has not been identified. Look up 'Ivan Bliznets' in Google

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google

Nikolay Karpov

This author has not been identified. Look up 'Nikolay Karpov' in Google

Alexander S. Kulikov

This author has not been identified. Look up 'Alexander S. Kulikov' in Google

Saket Saurabh

This author has not been identified. Look up 'Saket Saurabh' in Google
runs on