"On the Complexity of Parameterized Local Search for the Maximum Parsimony ..."

Christian Komusiewicz et al. (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2023.18

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/KomusiewiczLMS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/KomusiewiczLMS23
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag:
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.