( en | de | ru )

 

Disambiguation of "Grüttemeier, Niels"

Author of the publication

copydeleteadd this publication to your clipboard
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.

, , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 248-259. Springer, (2020)

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

Ferdinand Nielsen

Eva Nielsen

 

Other publications of authors with the same name

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..Colored cut games., , , and . Theor. Comput. Sci., (2022)On the Relation of Strong Triadic Closure and Cluster Deletion., and . Algorithmica, 82 (4): 853-880 (2020)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)Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis., and . J. Artif. Intell. Res., (2022)Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs., , , and . CoRR, (2022)Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs., , , , and . CoRR, (2022)Colored Cut Games., , , and . FSTTCS, volume 182 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs., , , and . Theory Comput. Syst., 66 (5): 1019-1045 (2022)