Niels Grüttemeier

According to our database, Niels Grüttemeier authored at least 20 papers between 2020 and 2023.

Collaborative distances:

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

2023

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.

Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Discret. Math. Theor. Comput. Sci., 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

Efficient Production Scheduling by Exploiting Repetitive Product Configurations.

Niels Grüttemeier, Kaja Balzereit, Nehal Soni, Andreas Bunte

Proceedings of the 21st IEEE International Conference on Industrial Informatics, 2023

Optimization of a High Storage System with two Cranes per Aisle.

Niels Grüttemeier, Andreas Bunte, Stefan Windmann

Proceedings of the 21st IEEE International Conference on Industrial Informatics, 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

2022

Parameterized Algorithmics for Graph-Based Data Analysis.

Niels Grüttemeier

PhD thesis, 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

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.

Niels Grüttemeier, Christian Komusiewicz

J. Artif. Intell. Res., 2022

Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs.

Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer

CoRR, 2022

On Critical Node Problems with Vulnerable Vertices.

Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.

Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge

J. Comput. Syst. Sci., 2021

Destroying Bicolored P₃s by Deleting Few Edges.

Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer

Discret. Math. Theor. Comput. Sci., 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

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

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

On the Relation of Strong Triadic Closure and Cluster Deletion.

Niels Grüttemeier, Christian Komusiewicz

Algorithmica, 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

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