Smoothed Analysis of the Successive Shortest Path Algorithm. - Tobias Brunsch; Kamiel Cornelissen; Bodo Manthey; Heiko Röglin; Clemens Rösner (SIAM J. Comput., 2015)

The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. - Heiko Röglin; Clemens Rösner (TAMC, 2017)

Privacy Preserving Clustering with Constraints. - Clemens Rösner; Melanie Schmidt 001 (ICALP, 2018)

New deterministic algorithms for solving parity games. - Matthias Mnich; Heiko Röglin; Clemens Rösner (Discret. Optim., 2018)

On the Cost of Essentially Fair Clusterings. - Ioana Oriana Bercea; Martin Groß 001; Samir Khuller; Aounon Kumar; Clemens Rösner; Daniel R. Schmidt 001; Melanie Schmidt 001 (APPROX-RANDOM, 2019)

Constrained Clustering Problems and Parity Games - Clemens Rösner (2019)

The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. - René Beier; Heiko Röglin; Clemens Rösner; Berthold Vöcking (Math. Program., 2023)

FPT Approximations for Fair k-Min-Sum-Radii. - Lena Carta; Lukas Drexler; Annika Hennes; Clemens Rösner; Melanie Schmidt 001 (ISAAC, 2024)

FPT Approximations for Fair k-Min-Sum-Radii. - Lena Carta; Lukas Drexler; Annika Hennes; Clemens Rösner; Melanie Schmidt 001 (CoRR, 2024)