Nils Morawietz

Publication Activity (10 Years)

Years Active: 2020-2023
Publications (10 Years): 28

Top Topics

Bayesian Network Structure Learning

Parameterized Complexity

Subgraph Isomorphism

Top Venues

Publications

Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA (2023)
Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
Complexity of Local Search for Euclidean Clustering Problems. CoRR (2023)
Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM (2023)
Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM (2023)
Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS (2023)
Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC (2023)
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Max c-Cut. IJCAI (2023)
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Exact Algorithms for Group Closeness Centrality. ACDA (2023)
Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC (2022)
Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR (2022)
Christian Komusiewicz, Nils Morawietz
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. MFCS (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored cut games. Theor. Comput. Sci. 936 (2022)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66 (5) (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small $\mathbf {(s, t)}$-Cuts by Protecting Edges. WG (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. IJCAI (2021)
Nils Morawietz, Petra Wolf
A Timecop's Chase Around the Table. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. CoRR (2021)
Christian Komusiewicz, Nils Morawietz
Can Local Optimality Be Used for Efficient Data Reduction? CIAC (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI (2021)
Nils Morawietz, Petra Wolf
A Timecop's Chase Around the Table. MFCS (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. CoRR (2020)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT (2020)
Nils Morawietz, Carolin Rehs, Mathias Weller
A Timecop's Work Is Harder Than You Think. MFCS (2020)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
String Factorizations Under Various Collision Constraints. CPM (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Colored Cut Games. FSTTCS (2020)
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM (2020)