Nils Morawietz

According to our database, Nils Morawietz authored at least 26 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A cop and robber game on edge-periodic temporal graphs.

Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf

J. Comput. Syst. Sci., 2024

Parameterized Local Search for Max <i>c</i>-Cut.

Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

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

CoRR, 2024

Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization.

Thomas Erlebach, Nils Morawietz, Petra Wolf

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

On the Complexity of Community-Aware Network Sparsification.

Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs.

Arnaud Casteigts, Nils Morawietz, Petra Wolf

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Complexity of Local Search for Euclidean Clustering Problems.

Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer

CoRR, 2023

A Graph-Theoretic Formulation of Exploratory Blockmodeling.

Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

Proceedings of the 21st International Symposium on Experimental Algorithms, 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

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric.

Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Graph Clustering Problems Under the Lens of Parameterized Local Search.

Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Local Search for Max c-Cut.

Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem.

Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Exact Algorithms for Group Closeness Centrality.

Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Colored cut games.

Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Theor. Comput. Sci., 2022

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.

Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Theory Comput. Syst., 2022

Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard.

Christian Komusiewicz, Nils Morawietz

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial.

Christian Komusiewicz, Nils Morawietz

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Preventing Small (s,t)Cuts by Protecting Edges.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

A Timecop's Chase Around the Table.

Nils Morawietz, Petra Wolf

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Parameterized Complexity of Polytree Learning.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Can Local Optimality Be Used for Efficient Data Reduction?

Christian Komusiewicz, Nils Morawietz

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

A Timecop's Work Is Harder Than You Think.

Nils Morawietz, Carolin Rehs, Mathias Weller

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

String Factorizations Under Various Collision Constraints.

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020