( en | de | ru )

 

Disambiguation of "Grüttemeier, Niels"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.

, , and . AAAI, page 12328-12335. AAAI Press, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tim Grüttemeier

Hans Peter Grüttemeier

Hans Gustav Grüttemeier

Thea Nielsen

Heimo Nielsen

 

Other publications of authors with the same name

Colored Cut Games., , , and . FSTTCS, volume 182 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis., and . IJCAI, page 4245-4251. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..On Critical Node Problems with Vulnerable Vertices., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 494-508. Springer, (2022)Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 99-111. Springer, (2019)String Factorizations Under Various Collision Constraints., , , and . CPM, volume 161 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Optimization of a High Storage System with two Cranes per Aisle., , and . INDIN, page 1-6. IEEE, (2023)Parameterized Algorithmics for Graph-Based Data Analysis.. University of Marburg, Germany, (2022)Destroying Bicolored P3s by Deleting Few Edges., , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 193-204. Springer, (2019)On Critical Node Problems with Vulnerable Vertices., , , and . J. Graph Algorithms Appl., 28 (1): 1-26 (2024)Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs., , and . SWAT, volume 162 of LIPIcs, page 26:1-26:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)