A timecop’s work is harder than you think N Morawietz, C Rehs, M Weller
45th International Symposium on Mathematical Foundations of Computer Science …, 2020
12 2020 A Timecop's Chase Around the Table N Morawietz, P Wolf
46th International Symposium on Mathematical Foundations of Computer Science …, 2021
10 2021 On the parameterized complexity of polytree learning N Grüttemeier, C Komusiewicz, N Morawietz
arXiv preprint arXiv:2105.09675, 2021
9 2021 Refined parameterizations for computing colored cuts in edge-colored graphs N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theory of Computing Systems, 1-27, 2022
6 2022 Efficient Bayesian network structure learning via parameterized local search on topological orderings N Grüttemeier, C Komusiewicz, N Morawietz
Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12328 …, 2021
6 2021 Maximum edge-colorable subgraph and strong triadic closure parameterized by distance to low-degree graphs N Grüttemeier, C Komusiewicz, N Morawietz
arXiv preprint arXiv:2002.08659, 2020
5 2020 Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs E Arrighi, N Grüttemeier, N Morawietz, F Sommer, P Wolf
International Conference on Current Trends in Theory and Practice of …, 2023
4 2023 Colored cut games N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theoretical Computer Science 936, 13-32, 2022
4 2022 Parameterized local search for vertex cover: When only the search radius is crucial C Komusiewicz, N Morawietz
17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022
3 2022 Preventing Small N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
International Workshop on Graph-Theoretic Concepts in Computer Science, 143-155, 2021
3 * 2021 On the complexity of community-aware network sparsification E Herrendorf, C Komusiewicz, N Morawietz, F Sommer
arXiv preprint arXiv:2402.15494, 2024
2 2024 On the complexity of parameterized local search for the maximum parsimony problem C Komusiewicz, S Linz, N Morawietz, J Schestag
34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), 2023
2 2023 Finding 3-swap-optimal independent sets and dominating sets is hard C Komusiewicz, N Morawietz
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
2 2022 String factorizations under various collision constraints N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
2 2020 Computational Complexity of Network Robustness in Edge-Colored Graphs N Morawietz
Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, 2019
2 2019 Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization T Erlebach, N Morawietz, P Wolf
Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2024
1 2024 Parameterized local search for max c-cut J Garvardt, N Grüttemeier, C Komusiewicz, N Morawietz
Proceedings of the Thirty-Second International Joint Conference on …, 2023
1 2023 Exact algorithms for group closeness centrality LP Staus, C Komusiewicz, N Morawietz, F Sommer
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), 1-12, 2023
1 2023 A cop and robber game on edge-periodic temporal graphs T Erlebach, N Morawietz, JT Spooner, P Wolf
Journal of Computer and System Sciences, 103534, 2024
2024 Complexity of Local Search for Euclidean Clustering Problems B Manthey, N Morawietz, J van Rhijn, F Sommer
arXiv preprint arXiv:2312.14916, 2023
2023 
Christian KomusiewiczFriedrich-Schiller-Universität JenaBestätigte E-Mail-Adresse bei uni-jena.de
