E-LIB Suche - Ergebnisse für: Grüttemeier, Niels

1

Multi-Parameter Analysis of Finding Minors and Subgraphs in..:

, In: Lecture Notes in Computer Science; SOFSEM 2023: Theory and Practice of Computer Science,

Arrighi, Emmanuel ; Grüttemeier, Niels ; Morawietz, Nils.. - p. 283-297 , 2023

Link: https://doi.org/10.1007/..

2

Optimization of a High Storage System with two Cranes per A..:

, In: 2023 IEEE 21st International Conference on Industrial Informatics (INDIN),

Gruttemeier, Niels ; Bunte, Andreas ; Windmann, Stefan - p. 1-6 , 2023

Link: https://doi.org/10.1109/..

3

Destroying Multicolored Paths and Cycles in Edge-Colored Gr..:

Eckstein, Nils Jakob ; Grüttemeier, Niels ; Komusiewicz, Christian.
Discrete Mathematics & Theoretical Computer Science. 25:1 (2023) Graph Theory - p. , 2023

Link: https://doi.org/10.46298..

4

Parameterized Algorithmics for Graph-Based Data Analysis:

Grüttemeier, Niels , 2022

Link: https://nbn-resolving.de..

5

On Critical Node Problems with Vulnerable Vertices:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Schestag, Jannik ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 494-508 , 2022

Link: https://doi.org/10.1007/..

6

Refined Parameterizations for Computing Colored Cuts in Edg..:

Morawietz, Nils ; Grüttemeier, Niels ; Komusiewicz, Christian.
Theory of Computing Systems. 66 (2022) 5 - p. 1019-1045 , 2022

Link: https://doi.org/10.1007/..

7

Colored cut games:

Morawietz, Nils ; Grüttemeier, Niels ; Komusiewicz, Christian.
Theoretical Computer Science. 936 (2022) - p. 13-32 , 2022

Link: https://doi.org/10.1016/..

8

Your rugby mates don't need to know your colleagues: Triadi..:

Bulteau, Laurent ; Grüttemeier, Niels ; Komusiewicz, Christian.
Journal of Computer and System Sciences. 120 (2021) - p. 75-96 , 2021

Link: https://doi.org/10.1016/..

9

Destroying Bicolored $P_3$s by Deleting Few Edges:

Grüttemeier, Niels ; Komusiewicz, Christian ; Schestag, Jannik.
Discrete Mathematics & Theoretical Computer Science. 23 no. 1 (2021) Graph Theory - p. , 2021

Link: https://doi.org/10.46298..

10

Preventing Small $$\mathbf {(s,t)}$$-Cuts by Protecting Edg..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Grüttemeier, Niels ; Komusiewicz, Christian ; Morawietz, Nils. - p. 143-155 , 2021

Link: https://doi.org/10.1007/..

11

Refined Parameterizations for Computing Colored Cuts in Edg..:

, In: SOFSEM 2020: Theory and Practice of Computer Science; Lecture Notes in Computer Science,

Morawietz, Nils ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 248-259 , 2020

Link: https://doi.org/10.1007/..

12

Your Rugby Mates Don't Need to Know Your Colleagues: Triadi..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Bulteau, Laurent ; Grüttemeier, Niels ; Komusiewicz, Christian. - p. 99-111 , 2019

Link: https://doi.org/10.1007/..

13

On the Relation of Strong Triadic Closure and Cluster Delet..:

Grüttemeier, Niels ; Komusiewicz, Christian
Algorithmica. 82 (2019) 4 - p. 853-880 , 2019

Link: https://doi.org/10.1007/..

14

Destroying Bicolored $$P_3$$s by Deleting Few Edges:

, In: Computing with Foresight and Industry; Lecture Notes in Computer Science,

Grüttemeier, Niels ; Komusiewicz, Christian ; Schestag, Jannik. - p. 193-204 , 2019

Link: https://doi.org/10.1007/..

15

On the Relation of Strong Triadic Closure and Cluster Delet..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Grüttemeier, Niels ; Komusiewicz, Christian - p. 239-251 , 2018

Link: https://doi.org/10.1007/..