Christian Rosenke

activity

20142026

most citedTowards Completely Characterizing the Complexity of Boolean Nets Synthesis

6 citations · 10 across the 6 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph Generalizations

Martin Darmüntzel, Christian Rosenke, Mark Scheibner

Flood-It is a single-player game played on a precolored graph $G$ , where the objective is to make $G$ monochromatic using as few flooding moves as possible. In each move, a color $…

cs.DM2014★ 1 cited

Towards a Characterization of Leaf Powers by Clique Arrangements

Ragnar Nevries, Christian Rosenke

The class $L_{k}$ of $k$ -leaf powers consists of graphs $G = (V, E)$ that have a $k$ -leaf root, that is, a tree $T$ with leaf set $V$ , where $x y \in E$ , if and only if the $T$ -di…