Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Christian Rosenke

Christian Rosenke

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Discrete Math×1Algorithms×1

Frequent co-authors

Martin Darmüntzel1×
Mark Scheibner1×

Research Timeline

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

This paper studies the complexity of the Flood-It game on various graph classes and provides polynomial-time algorithms for Free Flood-It on graphs free of certain jewels, while proving NP-completeness on thin-spider graphs.

Highlighted terms show continued research focus across papers

Papers

cs.DMcs.DSTheoreticalRecentJun 22, 2026

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

Martin Darmüntzel, Christian Rosenke, Mark Scheibner

This paper studies the complexity of the Flood-It game on various graph classes and provides polynomial-time algorithms for Free Flood-It on graphs free of certain jewels, while proving NP-completenes…

View →