Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. - Michael Etscheid; Heiko Röglin (ESA, 2015)

Performance guarantees for scheduling algorithms under perturbed machine speeds. - Michael Etscheid (Discret. Appl. Math., 2015)

Bounds for the Convergence Time of Local Search in Scheduling Problems. - Tobias Brunsch; Michael Etscheid; Heiko Röglin (WINE, 2016)

Polynomial kernels for weighted problems. - Michael Etscheid; Stefan Kratsch; Matthias Mnich; Heiko Röglin (J. Comput. Syst. Sci., 2017)

Smoothed Analysis of Local Search for the Maximum-Cut Problem. - Michael Etscheid; Heiko Röglin (ACM Trans. Algorithms, 2017)

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. - Michael Etscheid; Matthias Mnich (Algorithmica, 2018)

Beyond Worst-Case Analysis of Max-Cut and Local Search - Michael Etscheid (2018)