Follow
Niels Grüttemeier
Niels Grüttemeier
Fraunhofer IOSB-INA
Verified email at iosb-ina.fraunhofer.de
Title
Cited by
Cited by
Year
On the relation of strong triadic closure and cluster deletion
N Grüttemeier, C Komusiewicz
Algorithmica 82 (4), 853-880, 2020
282020
Learning Bayesian networks under sparsity constraints: A parameterized complexity analysis
N Grüttemeier, C Komusiewicz
Journal of Artificial Intelligence Research 74, 1225-1267, 2022
142022
On the parameterized complexity of polytree learning
N Grüttemeier, C Komusiewicz, N Morawietz
arXiv preprint arXiv:2105.09675, 2021
92021
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
72021
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
62022
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
62021
Colored cut games
N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theoretical Computer Science 936, 13-32, 2022
42022
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
42021
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
42020
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
32023
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
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
22023
On Critical Node Problems with Vulnerable Vertices
J Schestag, N Grüttemeier, C Komusiewicz, F Sommer
International Workshop on Combinatorial Algorithms, 494-508, 2022
22022
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
22020
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
12023
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
12023
Parameterized Algorithmics for Graph-Based Data Analysis
N Grüttemeier
Philipps-Universität Marburg, 2022
12022
Security Decisions for Cyber-physical Systems based on Solving Critical Node Problems with Vulnerable Nodes
J Otto, N Grüttemeier, F Specht
2024
Optimization of a High Storage System with two Cranes per Aisle
N Grüttemeier, A Bunte, S Windmann
2023 IEEE 21st International Conference on Industrial Informatics (INDIN), 1-6, 2023
2023
A Graph-Theoretic Formulation of Exploratory Blockmodeling
A Bille, N Grüttemeier, C Komusiewicz, N Morawietz
21st International Symposium on Experimental Algorithms (SEA 2023), 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20