Niels Grüttemeier

Orcid: 0000-0002-6789-2918

Affiliations:
  • Fraunhofer IOSB-INA, Lemgo, Germany
  • Philipps-Universität Marburg, Germany (former)


According to our database1, Niels Grüttemeier authored at least 23 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs.
J. Comb. Optim., October, 2024

On Critical Node Problems with Vulnerable Vertices.
J. Graph Algorithms Appl., 2024

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

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times.
CoRR, 2024

Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes.
CoRR, 2024

2023
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
Discret. Math. Theor. Comput. Sci., 2023

A Graph-Theoretic Formulation of Exploratory Blockmodeling.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Efficient Production Scheduling by Exploiting Repetitive Product Configurations.
Proceedings of the 21st IEEE International Conference on Industrial Informatics, 2023

Optimization of a High Storage System with two Cranes per Aisle.
Proceedings of the 21st IEEE International Conference on Industrial Informatics, 2023

Parameterized Local Search for Max c-Cut.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Parameterized Algorithmics for Graph-Based Data Analysis.
PhD thesis, 2022

Colored cut games.
Theor. Comput. Sci., 2022

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.
Theory Comput. Syst., 2022

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.
J. Artif. Intell. Res., 2022

2021
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.
J. Comput. Syst. Sci., 2021

Destroying Bicolored P<sub>3</sub>s by Deleting Few Edges.
Discret. Math. Theor. Comput. Sci., 2021

Preventing Small (s,t)Cuts by Protecting Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

On the Parameterized Complexity of Polytree Learning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
On the Relation of Strong Triadic Closure and Cluster Deletion.
Algorithmica, 2020

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

String Factorizations Under Various Collision Constraints.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020


  Loading...