2 citations · 3 across the 4 of their papers we have counts for
5 papers
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 , where the objective is to make monochromatic using as few flooding moves as possible. In each move, a color $…
Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph according to a prescribed template $t \colon V \right…
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Van Bang Le, Christian Rosenke
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the dis…
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis
Ronny Tredup, Christian Rosenke
Boolean nets are Petri nets that permit at most one token per place. Research has approached this important subject in many ways which resulted in various different classes of bool…
The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs
Christian Rosenke, Ronny Tredup
Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial proce…