| On the relation of strong triadic closure and cluster deletion N Grüttemeier, C Komusiewicz Algorithmica 82 (4), 853-880, 2020 | 34 | 2020 |
| Learning Bayesian networks under sparsity constraints: A parameterized complexity analysis N Grüttemeier, C Komusiewicz Journal of Artificial Intelligence Research 74, 1225-1267, 2022 | 20 | 2022 |
| On the parameterized complexity of polytree learning N Grüttemeier, C Komusiewicz, N Morawietz International Joint Conference on Artificial Intelligence (IJCAI 2021), 2021 | 10 | 2021 |
| 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 |
| 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 | 7 | 2023 |
| Refined parameterizations for computing colored cuts in edge-colored graphs N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer Theory of Computing Systems 66 (5), 1019-1045, 2022 | 7 | 2022 |
| Your rugby mates don't need to know your colleagues: Triadic closure with edge colors L Bulteau, N Grüttemeier, C Komusiewicz, M Sorge Journal of Computer and System Sciences 120, 75-96, 2021 | 7 | 2021 |
| Maximum edge-colorable subgraph and strong triadic closure parameterized by distance to low-degree graphs N Grüttemeier, C Komusiewicz, N Morawietz Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020 | 6 | 2020 |
| Destroying multicolored paths and cycles in edge-colored graphs NJ Eckstein, N Grüttemeier, C Komusiewicz, F Sommer Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2023 | 4 | 2023 |
| Colored cut games N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer Theoretical Computer Science 936, 13-32, 2022 | 4 | 2022 |
| Destroying Bicolored s by Deleting Few Edges N Grüttemeier, C Komusiewicz, J Schestag, F Sommer Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory), 2021 | 4 | 2021 |
| Preventing Small -Cuts by Protecting Edges N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer International Workshop on Graph-Theoretic Concepts in Computer Science, 143-155, 2021 | 3* | 2021 |
| Parameterized local search for max c-cut J Garvardt, N Grüttemeier, C Komusiewicz, N Morawietz International Joint Conference on Artificial Intelligence (IJCAI 2023), 5586 …, 2023 | 2 | 2023 |
| Efficient production scheduling by exploiting repetitive product configurations N Grüuttemeier, K Balzereit, N Soni, A Bunte 2023 IEEE 21st International Conference on Industrial Informatics (INDIN), 1-6, 2023 | 2 | 2023 |
| On critical node problems with vulnerable vertices J Schestag, N Grüttemeier, C Komusiewicz, F Sommer International Workshop on Combinatorial Algorithms, 494-508, 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 |
| Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes J Otto, N Grüttemeier, F Specht arXiv preprint arXiv:2406.10287, 2024 | 1 | 2024 |
| Parameterized Algorithmics for Graph-Based Data Analysis N Grüttemeier Philipps-Universität Marburg, 2022 | 1 | 2022 |
| Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs N Grüttemeier, PH Keßler, C Komusiewicz, F Sommer Journal of Combinatorial Optimization 48 (3), 16, 2024 | | 2024 |
| Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times K Balzereit, N Grüttemeier, N Morawietz, D Reinhardt, S Windmann, ... arXiv preprint arXiv:2409.00771, 2024 | | 2024 |
Christian KomusiewiczFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
