Nils Morawietz

62 papers A* 3A 3B 21C 1Journal 29Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Parameterized-Complexity Framework for Finding Local Optima. ITCS Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026	J	`jnl`	A Parameterized-Complexity Framework for Finding Local Optima. CoRR Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026	A	`conf`	Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path Metrics. STACS Justine Cauvi, Nils Morawietz, Laurent Viennot
2026	J	`jnl`	Graph clustering problems under the lens of parameterized local search. J. Comput. Syst. Sci. Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
2026	J	`jnl`	Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. Discret. Appl. Math. Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2026	J	`jnl`	The Descriptive Complexity of Relation Modification Problems. CoRR Florian Chudigiewitsch, Marlene Gründel, Christian Komusiewicz, Nils Morawietz, Till Tantau
2026	J	`jnl`	When can Cluster Deletion with bounded weights be solved efficiently? Discret. Appl. Math. Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz
2025	J	`jnl`	Can Local Optimality Be Used for Efficient Data Reduction? Theory Comput. Syst. Christian Komusiewicz, Nils Morawietz
2025	J	`jnl`	Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problem. CoRR Niels Grüttemeier, Nils Morawietz, Frank Sommer
2025	B	`conf`	Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. WADS Niels Grüttemeier, Nils Morawietz, Frank Sommer
2025	J	`jnl`	Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard. ACM Trans. Comput. Theory Christian Komusiewicz, Nils Morawietz
2025	J	`jnl`	Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics. CoRR Justine Cauvi, Nils Morawietz, Laurent Viennot
2025	J	`jnl`	Parameterized algorithms for multi-label periodic temporal graph realization. Theor. Comput. Sci. Thomas Erlebach, Nils Morawietz, Petra Wolf
2025	B	`conf`	Realization of Temporally Connected Graphs Based on Degree Sequences. ISAAC Arnaud Casteigts, Michelle Döring, Nils Morawietz
2025	J	`jnl`	Realization of Temporally Connected Graphs Based on Degree Sequences. CoRR Arnaud Casteigts, Michelle Döring, Nils Morawietz
2025	B	`conf`	Realizing Temporal Transportation Trees. WG George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	A	`conf`	Recognizing and Realizing Temporal Reachability Graphs. ESA Thomas Erlebach, Othon Michail, Nils Morawietz
2025	J	`jnl`	Recognizing and Realizing Temporal Reachability Graphs. CoRR Thomas Erlebach, Othon Michail, Nils Morawietz
2025	—	`conf`	Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions. SAND Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025	J	`jnl`	Temporal Graph Realization With Bounded Stretch. CoRR George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	B	`conf`	Temporal Graph Realization with Bounded Stretch. MFCS George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	J	`jnl`	The Parameter Report: An Orientation Guide for Data-Driven Parameterization. CoRR Christian Komusiewicz, Nils Morawietz, Frank Sommer, Luca Pascal Staus
2025	B	`conf`	Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. IPEC Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2025	J	`jnl`	Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set. CoRR Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024	J	`jnl`	A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf
2024	B	`conf`	Complexity of Local Search for Euclidean Clustering Problems. ISAAC Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2024	B	`conf`	Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. MFCS Arnaud Casteigts, Nils Morawietz, Petra Wolf
2024	J	`jnl`	Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. CoRR Arnaud Casteigts, Nils Morawietz, Petra Wolf
2024	B	`conf`	On the Complexity of Community-Aware Network Sparsification. MFCS Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024	J	`jnl`	On the Complexity of Community-aware Network Sparsification. CoRR Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2024	—	`conf`	Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND Thomas Erlebach, Nils Morawietz, Petra Wolf
2024	J	`jnl`	Parameterized Local Search for Max CoRR Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2024	J	`jnl`	Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times. CoRR Kaja Balzereit, Niels Grüttemeier, Nils Morawietz, Dennis Reinhardt, Stefan Windmann, Petra Wolf
2024	B	`conf`	When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? ISAAC Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz
2023	B	`conf`	A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2023	J	`jnl`	Complexity of Local Search for Euclidean Clustering Problems. CoRR Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2023	—	`conf`	Exact Algorithms for Group Closeness Centrality. ACDA Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2023	B	`conf`	Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
2023	B	`conf`	Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2023	B	`conf`	On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger
2023	B	`conf`	On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag
2023	A*	`conf`	Parameterized Local Search for Max c-Cut. IJCAI Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2022	J	`jnl`	Colored cut games. Theor. Comput. Sci. Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2022	B	`conf`	Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. MFCS Christian Komusiewicz, Nils Morawietz
2022	J	`jnl`	Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
2022	B	`conf`	Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC Christian Komusiewicz, Nils Morawietz
2022	J	`jnl`	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2021	B	`conf`	A Timecop's Chase Around the Table. MFCS Nils Morawietz, Petra Wolf
2021	J	`jnl`	A Timecop's Chase Around the Table. CoRR Nils Morawietz, Petra Wolf
2021	C	`conf`	Can Local Optimality Be Used for Efficient Data Reduction? CIAC Christian Komusiewicz, Nils Morawietz
2021	A*	`conf`	Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021	A*	`conf`	On the Parameterized Complexity of Polytree Learning. IJCAI Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021	J	`jnl`	On the Parameterized Complexity of Polytree Learning. CoRR Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2021	J	`jnl`	Preventing Small (s, t)-Cuts by Protecting Edges. CoRR Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2021	B	`conf`	Preventing Small (s,t)Cuts by Protecting Edges. WG Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2020	B	`conf`	A Timecop's Work Is Harder Than You Think. MFCS Nils Morawietz, Carolin Rehs, Mathias Weller
2020	—	`conf`	Colored Cut Games. FSTTCS Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020	—	`conf`	Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2020	J	`jnl`	Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. CoRR Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
2020	B	`conf`	Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
2020	B	`conf`	String Factorizations Under Various Collision Constraints. CPM Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer