String Factorizations Under Various Collision Constraints. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz; Frank Sommer (CPM, 2020)

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (SWAT, 2020)

On the Relation of Strong Triadic Closure and Cluster Deletion. - Niels Grüttemeier; Christian Komusiewicz (Algorithmica, 2020)

Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (AAAI, 2021)

On the Parameterized Complexity of Polytree Learning. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (IJCAI, 2021)

Preventing Small (s,t)Cuts by Protecting Edges. - Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz; Frank Sommer (WG, 2021)

Destroying Bicolored P3s by Deleting Few Edges. - Niels Grüttemeier; Christian Komusiewicz; Jannik Schestag; Frank Sommer (Discret. Math. Theor. Comput. Sci., 2021)

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. - Laurent Bulteau; Niels Grüttemeier; Christian Komusiewicz; Manuel Sorge (J. Comput. Syst. Sci., 2021)

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. - Niels Grüttemeier; Christian Komusiewicz (J. Artif. Intell. Res., 2022)

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Theory Comput. Syst., 2022)

Colored cut games. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Theor. Comput. Sci., 2022)

Parameterized Algorithmics for Graph-Based Data Analysis. - Niels Grüttemeier (2022)

Parameterized Local Search for Max c-Cut. - Jaroslav Garvardt; Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (IJCAI, 2023)

Optimization of a High Storage System with two Cranes per Aisle. - Niels Grüttemeier; Andreas Bunte; Stefan Windmann (INDIN, 2023)

Efficient Production Scheduling by Exploiting Repetitive Product Configurations. - Niels Grüttemeier; Kaja Balzereit; Nehal Soni; Andreas Bunte (INDIN, 2023)

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (SOFSEM, 2023)

A Graph-Theoretic Formulation of Exploratory Blockmodeling. - Alexander Bille; Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (SEA, 2023)

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. - Nils Jakob Eckstein; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (Discret. Math. Theor. Comput. Sci., 2023)

Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes. - Jens Otto; Niels Grüttemeier; Felix Specht (CoRR, 2024)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times. - Kaja Balzereit; Niels Grüttemeier; Nils Morawietz; Dennis Reinhardt; Stefan Windmann; Petra Wolf 002 (CoRR, 2024)

Parameterized Local Search for Max c-Cut. - Jaroslav Garvardt; Niels Grüttemeier; Christian Komusiewicz; Nils Morawietz (CoRR, 2024)

On Critical Node Problems with Vulnerable Vertices. - Jannik Schestag; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (J. Graph Algorithms Appl., 2024)

Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. - Niels Grüttemeier; Philipp Heinrich Keßler; Christian Komusiewicz; Frank Sommer (J. Comb. Optim., 2024)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problem. - Niels Grüttemeier; Nils Morawietz; Frank Sommer (CoRR, 2025)

Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (Discret. Appl. Math., 2026)