4 citations · 5 across the 14 of their papers we have counts for
15 papers
Maximizing All-Paths Phylogenetic Diversity: Parameterized Approaches for Networks
Mark Jones, Jannik Schestag
Phylogenetic Diversity (PD) is a fundamental measure of biodiversity, originally defined on phylogenetic trees and widely used in conservation biology. Phylogenetic trees are often…
Orienting Unrooted Binary Networks Faster: Focus on the Generator
Jannik Schestag, Norbert Zeh
The problem of orienting an unrooted network to obtain a specific class of rooted phylogenetic networks is known to be NP-hard in many cases. In this paper, we introduce two algori…
Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
Niels Holtgrefe, Jannik Schestag
Background: Identifying a subset of taxa that maximizes phylogenetic diversity is a cornerstone of quantitative conservation planning. Traditionally, phylogenetic diversity is defi…
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
Leo van Iersel, Mark Jones, Jannik Schestag +2
We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural…
Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
Niels Holtgrefe, Jannik Schestag, Norbert Zeh
In the Maximize Phylogenetic Diversity problem, we are given a phylogenetic tree that represents the genetic proximity of species, and we are asked to select a subset of species of…
The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth
Jannik Schestag, Norbert Zeh
Structural parameters of graphs, such as treewidth, play a central role in the study of the parameterized complexity of graph problems. Motivated by the study of parametrized algor…
Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
Mark Jones, Jannik Schestag
For a phylogenetic tree, the phylogenetic diversity of a set A of taxa is the total weight of edges on paths to A. Finding small sets of maximal diversity is crucial for conservati…
Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity
Jannik Schestag
Phylogenetic Diversity(PD)is a well-regarded measure of the overall biodiversity of a set of present-day species(taxa)that indicates its ecological significance.In the Maximize Phy…
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
Jannik Schestag
Phylogenetic trees represent certain species and their likely ancestors. In such a tree, present-day species are leaves and an edge from u to v indicates that u is an ancestor of v…
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
Christian Komusiewicz, Jannik Schestag
In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree over a set of taxa , a food-web that describes the prey-predator rela…
Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond
Leo van Iersel, Mark Jones, Jannik Schestag +2
Network Phylogenetic Diversity (Network-PD) is a measure for the diversity of a set of species based on a rooted phylogenetic network (with branch lengths and inheritance probabili…
Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead
Mark Jones, Jannik Schestag
Phylogenetic Diversity (PD) is a measure of the overall biodiversity of a set of present-day species (taxa) within a phylogenetic tree. In Maximize Phylogenetic Diversity (MPD) one…
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
Matthias Bentert, Jannik Schestag, Frank Sommer
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we ass…
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
Christian Komusiewicz, Jannik Schestag
In the Generalized Noah's Ark Problem, one is given a phylogenetic tree on a set of species X and a set of conservation projects for each species. Each project comes with a cost an…
Destroying Bicolored s by Deleting Few Edges
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag +1
We introduce and study the Bicolored Deletion problem defined as follows. The input is a graph where the edge set is partitioned into a set of red edges a…