1 citations · 1 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Privacy preserving clustering with constraints
Clemens Rösner, Melanie Schmidt
The -center problem is a classical combinatorial optimization problem which asks to find centers such that the maximum distance of any input point in a set to its assign…
cs.CC2015★ 1 cited
New Deterministic Algorithms for Solving Parity Games
Matthias Mnich, Heiko Röglin, Clemens Rösner
We study parity games in which one of the two players controls only a small number of nodes and the other player controls the other nodes of the game. Our main result is…