| 2026 | CiE | Towards Settling the Complexity of the Lettericity Problem. | Mario Grobler, Nils Morawietz, Silas Cato Sacher |
| 2026 | MFCS | Freeze-Tag with Return. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Tassir Marc, Nils Morawietz |
| 2026 | MFCS | The Descriptive Complexity of Relation Modification Problems. | Florian Chudigiewitsch, Marlene Grndel, Christian Komusiewicz, Nils Morawietz, Till Tantau |
| 2026 | STACS | Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path Metrics. | Justine Cauvi, Nils Morawietz, Laurent Viennot |
| 2026 | WG | Preventing Small Global Cuts by Protecting Edges. | Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, Frank Sommer |
| 2025 | ESA | Recognizing and Realizing Temporal Reachability Graphs. | Thomas Erlebach, Othon Michail, Nils Morawietz |
| 2025 | ISAAC | Realization of Temporally Connected Graphs Based on Degree Sequences. | Arnaud Casteigts, Michelle Dring, Nils Morawietz |
| 2025 | MFCS | Temporal Graph Realization with Bounded Stretch. | George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2025 | WADS | Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. | Niels Grttemeier, Nils Morawietz, Frank Sommer |
| 2025 | WG | Realizing Temporal Transportation Trees. | George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2024 | ISAAC | When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? | Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz |
| 2024 | ISAAC | Complexity of Local Search for Euclidean Clustering Problems. | Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer |
| 2024 | MFCS | Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. | Arnaud Casteigts, Nils Morawietz, Petra Wolf |
| 2024 | MFCS | On the Complexity of Community-Aware Network Sparsification. | Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2023 | CPM | On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. | Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag |
| 2023 | IJCAI | Parameterized Local Search for Max c-Cut. | Jaroslav Garvardt, Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2023 | MFCS | On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. | Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger |
| 2023 | SOFSEM | Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. | Emmanuel Arrighi, Niels Grttemeier, Nils Morawietz, Frank Sommer, Petra Wolf |
| 2022 | MFCS | Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. | Christian Komusiewicz, Nils Morawietz |
| 2021 | AAAI | Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2021 | CIAC | Can Local Optimality Be Used for Efficient Data Reduction? | Christian Komusiewicz, Nils Morawietz |
| 2021 | IJCAI | On the Parameterized Complexity of Polytree Learning. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz |
| 2021 | MFCS | A Timecop's Chase Around the Table. | Nils Morawietz, Petra Wolf |
| 2021 | WG | Preventing Small (s,t)Cuts by Protecting Edges. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | CPM | String Factorizations Under Various Collision Constraints. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | MFCS | A Timecop's Work Is Harder Than You Think. | Nils Morawietz, Carolin Rehs, Mathias Weller |
| 2020 | SOFSEM | Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. | Nils Morawietz, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |