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

Approximability of Connected Factors. - Kamiel Cornelissen; Ruben Hoeksma; Bodo Manthey; N. S. Narayanaswamy; C. S. Rahul 001 (WAOA, 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)

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

Approximation Algorithms for Connected Graph Factors of Minimum Weight. - Kamiel Cornelissen; Ruben Hoeksma; Bodo Manthey; N. S. Narayanaswamy; C. S. Rahul 001; Marten Waanders (Theory Comput. Syst., 2018)

Belief propagation for the maximum-weight independent set and minimum spanning tree problems. - Kamiel Cornelissen; Bodo Manthey (Theor. Comput. Sci., 2018)

Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. - Kamiel Cornelissen; Bodo Manthey (J. Graph Algorithms Appl., 2020)