A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem C Komusiewicz, JT Schestag
Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 109-121, 2023
4 2023 On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem C Komusiewicz, S Linz, N Morawietz, JT Schestag
34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), 2023
4 2023 Destroying Bicolored N Grüttemeier, C Komusiewicz, JT Schestag, F Sommer
Discrete Mathematics & Theoretical Computer Science 23, 2021
4 2021 Finding Degree-Constrained Acyclic Orientations J Garvardt, M Renken, JT Schestag, M Weller
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
2 2023 How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks M Jones, JT Schestag
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
2 2023 On Critical Node Problems with Vulnerable Vertices JT Schestag, N Grüttemeier, C Komusiewicz, F Sommer
Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier …, 2022
2 2022 Liechtenstein-P3s in two-colored graphs JT Schestag
Bachelorarbeit, Philipps-Universität Marburg, 2019
2 2019 Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study C Komusiewicz, J Schestag
arXiv preprint arXiv:2405.17314, 2024
1 2024 Maximizing Network Phylogenetic Diversity L van Iersel, M Jones, J Schestag, C Scornavacca, M Weller
arXiv preprint arXiv:2405.01091, 2024
1 2024 Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead M Jones, JT Schestag
arXiv preprint arXiv:2403.14217, 2024
1 2024 On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model M Bentert, JT Schestag, F Sommer
arXiv preprint arXiv:2308.04575, 2023
1 2023 Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis J Garvardt, C Komusiewicz, BB Lorke, J Schestag
International Conference on Algorithmic Decision Theory, 82-97, 2024
2024 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) D Arroyuelo, JP Castillo, Y Asahiro, H Eto, M Gong, J Jansson, G Lin, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023
2023 Critical Node Problem with Vulnerable Nodes JT Schestag
https://www.uni-marburg.de/de/fb12/arbeitsgruppen/algorith/forschung …, 2021
2021 Who should have a place on the ark?: Parameterized algorithms for the maximization of the phylogenetic J Schestag
Christian KomusiewiczFriedrich-Schiller-Universität JenaZweryfikowany adres z uni-jena.de
