Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. - Tobias Brunsch; Heiko Röglin (TAMC, 2011)

Smoothed analysis of the successive shortest path algorithm. - Tobias Brunsch; Kamiel Cornelissen; Bodo Manthey; Heiko Röglin (CTW, 2013)

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. - Tobias Brunsch; Heiko Röglin (ICALP (1), 2013)

Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. - Tobias Brunsch; Kamiel Cornelissen; Bodo Manthey; Heiko Röglin (J. Graph Algorithms Appl., 2013)

A bad instance for k-means++. - Tobias Brunsch; Heiko Röglin (Theor. Comput. Sci., 2013)

Smoothed performance guarantees for local search. - Tobias Brunsch; Heiko Röglin; Cyriel Rutten; Tjark Vredeveld (Math. Program., 2014)

Lower Bounds for the Average and Smoothed Number of Pareto-Optima. - Tobias Brunsch; Navin Goyal; Luis Rademacher; Heiko Röglin (Theory Comput., 2014)

Smoothed Analysis of Selected Optimization Problems and Algorithms. - Tobias Brunsch (2014)

Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. - Tobias Brunsch; Anna Großwendt; Heiko Röglin (STACS, 2015)

Improved Smoothed Analysis of Multiobjective Optimization. - Tobias Brunsch; Heiko Röglin (J. ACM, 2015)

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

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