( 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

Thea Nielsen

Sigurd Nielsen

 

Other publications of authors with the same name

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times., , , , , and . CoRR, (2024)Colored Cut Games., , , and . FSTTCS, volume 182 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Parameterized Local Search for Max c-Cut., , , and . CoRR, (2024)Destroying Bicolored P3s by Deleting Few Edges., , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 193-204. Springer, (2019)Parameterized Algorithmics for Graph-Based Data Analysis.. University of Marburg, Germany, (2022)Optimization of a High Storage System with two Cranes per Aisle., , and . INDIN, page 1-6. IEEE, (2023)On Critical Node Problems with Vulnerable Vertices., , , and . J. Graph Algorithms Appl., 28 (1): 1-26 (2024)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)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)