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 Complexity of Parameterized Local Search for the Maximum Parsimony Problem

Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag. On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. In Laurent Bulteau, Zsuzsanna Lipták, editors, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. Volume 259 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Christian Komusiewicz

This author has not been identified. Look up 'Christian Komusiewicz' in Google

Simone Linz

This author has not been identified. Look up 'Simone Linz' in Google

Nils Morawietz

This author has not been identified. Look up 'Nils Morawietz' in Google

Jannik Schestag

This author has not been identified. Look up 'Jannik Schestag' in Google
runs on