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.

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi. On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. In Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, editors, Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Volume 12911 of Lecture Notes in Computer Science, pages 52-79, Springer, 2021. [doi]

Authors

Isja Mannens

This author has not been identified. Look up 'Isja Mannens' in Google

Jesper Nederlof

This author has not been identified. Look up 'Jesper Nederlof' in Google

Céline M. F. Swennenhuis

This author has not been identified. Look up 'Céline M. F. Swennenhuis' in Google

Krisztina Szilágyi

This author has not been identified. Look up 'Krisztina Szilágyi' in Google
runs on