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
18 2020 A Timecop's Chase Around the Table N Morawietz, P Wolf
46th International Symposium on Mathematical Foundations of Computer Science …, 2021
15 2021 On the parameterized complexity of polytree learning N Grüttemeier, C Komusiewicz, N Morawietz
arXiv preprint arXiv:2105.09675, 2021
10 2021 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
9 2023 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
9 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
8 2021 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
5 2023 Colored cut games N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theoretical Computer Science 936, 13-32, 2022
5 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
5 2022 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 Parameterized algorithms for multi-label periodic temporal graph realization T Erlebach, N Morawietz, P Wolf
Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2024
4 2024 On the complexity of community-aware network sparsification E Herrendorf, C Komusiewicz, N Morawietz, F Sommer
arXiv preprint arXiv:2402.15494, 2024
4 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), 18: 1-18: 18, 2023
4 2023 Preventing Small N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
International Workshop on Graph-Theoretic Concepts in Computer Science, 143-155, 2021
4 * 2021 Finding 3-swap-optimal independent sets and dominating sets is hard C Komusiewicz, N Morawietz
ACM Transactions on Computation Theory 17 (1), 1-31, 2025
3 2025 Parameterized Local Search for Max J Garvardt, N Grüttemeier, C Komusiewicz, N Morawietz
arXiv preprint arXiv:2409.13380, 2024
3 2024 A cop and robber game on edge-periodic temporal graphs T Erlebach, N Morawietz, JT Spooner, P Wolf
Journal of Computer and System Sciences 144, 103534, 2024
3 2024 String factorizations under various collision constraints N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 17: 1-17: 14, 2020
3 2020 Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs A Casteigts, N Morawietz, P Wolf
arXiv preprint arXiv:2406.19514, 2024
2 2024 Complexity of Local Search for Euclidean Clustering Problems B Manthey, N Morawietz, J van Rhijn, F Sommer
arXiv preprint arXiv:2312.14916, 2023
2 2023 
Christian KomusiewiczFriedrich-Schiller-Universität JenaZweryfikowany adres z uni-jena.de