Niels Grüttemeier

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 37

Top Topics

Subgraph Isomorphism

Parameterized Complexity

Edge Information

Top Venues

Publications

Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28 (1) (2024)
Jens Otto, Niels Grüttemeier, Felix Specht
Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes. CoRR (2024)
Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA (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)
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023)
Niels Grüttemeier, Andreas Bunte, Stefan Windmann
Optimization of a High Storage System with two Cranes per Aisle. INDIN (2023)
Niels Grüttemeier, Kaja Balzereit, Nehal Soni, Andreas Bunte
Efficient Production Scheduling by Exploiting Repetitive Product Configurations. INDIN (2023)
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Max c-Cut. IJCAI (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. CoRR (2022)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR (2022)
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR (2022)
Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. J. Artif. Intell. Res. 74 (2022)
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
On Critical Node Problems with Vulnerable Vertices. IWOCA (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 Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR (2021)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120 (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. CoRR (2021)
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI (2021)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
Destroying Bicolored $P_3$s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23 (1) (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
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. 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)
Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. IJCAI (2020)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82 (4) (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)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CiE (2019)
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
s by Deleting Few Edges. CoRR (2019)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC (2019)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. CoRR (2018)
Niels Grüttemeier, Christian Komusiewicz
On the Relation of Strong Triadic Closure and Cluster Deletion. WG (2018)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR (2018)