Destroying Bicolored P3s by Deleting Few Edges. - Niels Grüttemeier; Christian Komusiewicz; Jannik Schestag; Frank Sommer (Discret. Math. Theor. Comput. Sci., 2021)

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. - Christian Komusiewicz; Simone Linz; Nils Morawietz; Jannik Schestag (CPM, 2023)

How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. - Mark Jones 001; Jannik Schestag (IPEC, 2023)

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. - Matthias Bentert; Jannik Schestag; Frank Sommer (IPEC, 2023)

Finding Degree-Constrained Acyclic Orientations. - Jaroslav Garvardt; Malte Renken; Jannik Schestag; Mathias Weller (IPEC, 2023)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem. - Christian Komusiewicz; Jannik Schestag (CoRR, 2023)

Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis. - Jaroslav Garvardt; Christian Komusiewicz; Berthold Blatt Lorke; Jannik Schestag (ADT, 2024)

Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study. - Christian Komusiewicz; Jannik Schestag (FSTTCS, 2024)

Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead. - Mark Jones 001; Jannik Schestag (CoRR, 2024)

Maximizing Network Phylogenetic Diversity. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (CoRR, 2024)

On Critical Node Problems with Vulnerable Vertices. - Jannik Schestag; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (J. Graph Algorithms Appl., 2024)

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (RECOMB-CG, 2025)

Average-Tree Phylogenetic Diversity of Networks. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (WABI, 2025)