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.

Approximation Guarantees for Shortest Superstrings: Simpler and Better

Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001. Approximation Guarantees for Shortest Superstrings: Simpler and Better. In Satoru Iwata 0001, Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. Volume 283 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Matthias Englert

This author has not been identified. Look up 'Matthias Englert' in Google

Nicolaos Matsakis

This author has not been identified. Look up 'Nicolaos Matsakis' in Google

Pavel Veselý 0001

This author has not been identified. Look up 'Pavel Veselý 0001' in Google
runs on