default search action
Niels Grüttemeier
Person information
- affiliation: Fraunhofer IOSB-INA, Lemgo, Germany
- affiliation (former): Philipps-Universität Marburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Niels Grüttemeier
, Philipp Heinrich Keßler, Christian Komusiewicz
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. J. Comb. Optim. 48(3): 16 (2024) - [j8]Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28(1): 1-26 (2024) - [i14]Jens Otto, Niels Grüttemeier, Felix Specht:
Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes. CoRR abs/2406.10287 (2024) - [i13]Kaja Balzereit, Niels Grüttemeier, Nils Morawietz, Dennis Reinhardt, Stefan Windmann, Petra Wolf:
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times. CoRR abs/2409.00771 (2024) - [i12]Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Parameterized Local Search for Max c-Cut. CoRR abs/2409.13380 (2024) - 2023
- [j7]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) - [c17]Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Max c-Cut. IJCAI 2023: 5586-5594 - [c16]Niels Grüttemeier, Andreas Bunte, Stefan Windmann:
Optimization of a High Storage System with two Cranes per Aisle. INDIN 2023: 1-6 - [c15]Niels Grüttemeier, Kaja Balzereit, Nehal Soni, Andreas Bunte:
Efficient Production Scheduling by Exploiting Repetitive Product Configurations. INDIN 2023: 1-6 - [c14]Emmanuel Arrighi
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM 2023: 283-297 - [c13]Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA 2023: 14:1-14:20 - 2022
- [b1]Niels Grüttemeier:
Parameterized Algorithmics for Graph-Based Data Analysis. University of Marburg, Germany, 2022 - [j6]Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. J. Artif. Intell. Res. 74: 1225-1267 (2022) - [j5]Nils Morawietz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66(5): 1019-1045 (2022) - [j4]Nils Morawietz
Colored cut games. Theor. Comput. Sci. 936: 13-32 (2022) - [c12]Jannik Schestag, Niels Grüttemeier
On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508 - [i11]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 abs/2203.07401 (2022) - [i10]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR abs/2204.02902 (2022) - [i9]Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer:
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR abs/2211.01701 (2022) - 2021
- [j3]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j2]Laurent Bulteau
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120: 75-96 (2021) - [c11]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI 2021: 12328-12335 - [c10]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. IJCAI 2021: 4221-4227 - [c9]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155 - [i8]Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR abs/2104.03138 (2021) - [i7]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
On the Parameterized Complexity of Polytree Learning. CoRR abs/2105.09675 (2021) - [i6]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR abs/2107.04482 (2021) - 2020
- [j1]Niels Grüttemeier
On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82(4): 853-880 (2020) - [c8]Niels Grüttemeier
String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14 - [c7]Nils Morawietz
Colored Cut Games. FSTTCS 2020: 30:1-30:17 - [c6]Niels Grüttemeier, Christian Komusiewicz:
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. IJCAI 2020: 4245-4251 - [c5]Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020: 248-259 - [c4]Niels Grüttemeier
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT 2020: 26:1-26:17 - [i5]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. CoRR abs/2002.08659 (2020) - [i4]Niels Grüttemeier, Christian Komusiewicz:
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. CoRR abs/2004.14724 (2020)
2010 – 2019
- 2019
- [c3]Laurent Bulteau
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC 2019: 99-111 - [c2]Niels Grüttemeier, Christian Komusiewicz
Destroying Bicolored P3s by Deleting Few Edges. CiE 2019: 193-204 - [i3]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. CoRR abs/1901.03627 (2019) - 2018
- [c1]Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. WG 2018: 239-251 - [i2]Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. CoRR abs/1803.00807 (2018) - [i1]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 abs/1811.09411 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: