Maximizing phylogenetic diversity under ecological constraints: a parameterized complexity study

DOI10.4230/LIPICS.FSTTCS.2024.28MaRDI QIDQ7263589zbMATH OpenFDO

Authors Christian Komusiewicz, Jannik Schestag

Publication date 12 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2024.28

zbMATH Keywords

dynamic programmingcolor-codingstructural parameterizationphylogenetic diversityfood-webs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• A multivariate complexity analysis of the generalized Noah's ark problem
• A new proof of Cayley's formula for counting labeled trees
• Color-coding
• Constant Time Generation of Rooted Trees
• Face covers and the genus problem for apex graphs
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Fundamentals of parameterized complexity
• How can we maximize phylogenetic diversity? Parameterized approaches for networks
• Maximizing a submodular function with viability constraints
• On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
• Optimizing phylogenetic diversity under constraints
• Optimizing phylogenetic diversity with ecological constraints
• Parameterized algorithms
• Phylogenetic diversity and biodiversity indices on phylogenetic networks

This page was built for publication: Maximizing phylogenetic diversity under ecological constraints: a parameterized complexity study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263589)