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 2017Show all

3 papers · 1 filter

cs.CC2017

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph

Guillaume Fertin, Julien Fradin, Christian Komusiewicz

Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG) rooted in some vertex r, and let H be its color hierarchy graph, defined as follows: V(H) is the color set…

cs.CC2017

When can Graph Hyperbolicity be computed in Linear Time?

Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen int…

cs.CC2017

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs

Iyad Kanj, Christian Komusiewicz, Manuel Sorge +1

A graph $G$ is a $(Π_{A}, Π_{B})$ -graph if $V (G)$ can be bipartitioned into $A$ and $B$ such that $G [A]$ satisfies property $Π_{A}$ and $G [B]$ satisfies property $Π_{B}$ . The $(Π_{A},Π_{B})…