Christian Komusiewicz

activity

20132026

most citedH-Index Manipulation by Merging Articles: Models, Theory, and Experiments

30 citations · 100 across the 41 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.CC2019

Graph Motif Problems Parameterized by Dual

Guillaume Fertin, Christian Komusiewicz

Let $G = (V, E)$ be a vertex-colored graph, where $C$ is the set of colors used to color $V$ . The Graph Motif (or GM) problem takes as input $G$ , a multiset $M$ of colors built from $…

cs.DS2019★ 4 cited

Destroying Bicolored $P_{3}$ s by Deleting Few Edges

Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag +1

We introduce and study the Bicolored $P_{3}$ Deletion problem defined as follows. The input is a graph $G = (V, E)$ where the edge set $E$ is partitioned into a set $E_{r}$ of red edges a…

Graph Motif Problems Parameterized by Dual

Destroying Bicolored P3​s by Deleting Few Edges

Destroying Bicolored $P_{3}$ s by Deleting Few Edges