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

Colored Cut Games. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (FSTTCS, 2020)

A Timecop's Work Is Harder Than You Think. - Nils Morawietz; Carolin Rehs; Mathias Weller (MFCS, 2020)

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. - Nils Morawietz; Niels Grüttemeier; Christian Komusiewicz; Frank Sommer (SOFSEM, 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)

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

Can Local Optimality Be Used for Efficient Data Reduction? - Christian Komusiewicz; Nils Morawietz (CIAC, 2021)

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

A Timecop's Chase Around the Table. - Nils Morawietz; Petra Wolf 002 (MFCS, 2021)

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

Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. - Christian Komusiewicz; Nils Morawietz (IPEC, 2022)

Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. - Christian Komusiewicz; Nils Morawietz (MFCS, 2022)

Exact Algorithms for Group Closeness Centrality. - Luca Pascal Staus; Christian Komusiewicz; Nils Morawietz; Frank Sommer (ACDA, 2023)

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. - Christian Komusiewicz; Simone Linz; Nils Morawietz; Jannik Schestag (CPM, 2023)

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

Graph Clustering Problems Under the Lens of Parameterized Local Search. - Jaroslav Garvardt; Nils Morawietz; André Nichterlein; Mathias Weller (IPEC, 2023)

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. - Jana Holznigenkemper; Christian Komusiewicz; Nils Morawietz; Bernhard Seeger (MFCS, 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)

When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? - Jaroslav Garvardt; Christian Komusiewicz; Nils Morawietz (ISAAC, 2024)

Complexity of Local Search for Euclidean Clustering Problems. - Bodo Manthey; Nils Morawietz; Jesse van Rhijn; Frank Sommer (ISAAC, 2024)

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. - Arnaud Casteigts; Nils Morawietz; Petra Wolf 002 (MFCS, 2024)

On the Complexity of Community-Aware Network Sparsification. - Emanuel Herrendorf; Christian Komusiewicz; Nils Morawietz; Frank Sommer (MFCS, 2024)

Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. - Thomas Erlebach; Nils Morawietz; Petra Wolf 002 (SAND, 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)

A cop and robber game on edge-periodic temporal graphs. - Thomas Erlebach; Nils Morawietz; Jakob T. Spooner; Petra Wolf 002 (J. Comput. Syst. Sci., 2024)

Recognizing and Realizing Temporal Reachability Graphs. - Thomas Erlebach; Othon Michail; Nils Morawietz (ESA, 2025)

Temporal Graph Realization with Bounded Stretch. - George B. Mertzios; Hendrik Molter; Nils Morawietz; Paul G. Spirakis (MFCS, 2025)

Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. - Anton Herrmann; Christian Komusiewicz; Nils Morawietz; Frank Sommer (SAND, 2025)

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

Realization of Temporally Connected Graphs Based on Degree Sequences. - Arnaud Casteigts; Michelle Döring; Nils Morawietz (CoRR, 2025)

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)

The Parameter Report: An Orientation Guide for Data-Driven Parameterization. - Christian Komusiewicz; Nils Morawietz; Frank Sommer; Luca Pascal Staus (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)