Jannik Schestag

According to our database, Jannik Schestag authored at least 20 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth.

Niels Holtgrefe, Jannik Schestag

CoRR, May, 2026

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility.

Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller

CoRR, April, 2026

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies.

Niels Holtgrefe, Jannik Schestag, Norbert Zeh

CoRR, February, 2026

The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth.

Jannik Schestag, Norbert Zeh

CoRR, February, 2026

A multivariate complexity analysis of the Generalized Noah's Ark Problem.

Christian Komusiewicz, Jannik Schestag

Discret. Appl. Math., 2026

Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder.

Jannik Schestag

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity.

Jannik Schestag

CoRR, October, 2025

Average-Tree Phylogenetic Diversity of Networks.

Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond.

Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller

Proceedings of the Comparative Genomics - 22nd RECOMB International Workshop, 2025

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies.

Mark Jones, Jannik Schestag

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

2024

Maximizing Network Phylogenetic Diversity.

Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller

CoRR, 2024

Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead.

Mark Jones, Jannik Schestag

CoRR, 2024

Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study.

Christian Komusiewicz, Jannik Schestag

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis.

Jaroslav Garvardt, Christian Komusiewicz, Berthold Blatt Lorke, Jannik Schestag

Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

2023

Finding Degree-Constrained Acyclic Orientations.

Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

Matthias Bentert, Jannik Schestag, Frank Sommer

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks.

Mark Jones, Jannik Schestag

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

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

Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

On Critical Node Problems with Vulnerable Vertices.

Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2019

Destroying Bicolored P₃s by Deleting Few Edges.

Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer

Proceedings of the Computing with Foresight and Industry, 2019