Kamiel Cornelissen

According to our database, Kamiel Cornelissen authored at least 7 papers between 2013 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Belief propagation for the maximum-weight independent set and minimum spanning tree problems.

Kamiel Cornelissen, Bodo Manthey

Theor. Comput. Sci., 2018

Approximation Algorithms for Connected Graph Factors of Minimum Weight.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders

Theory Comput. Syst., 2018

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

Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.

Kamiel Cornelissen, Bodo Manthey

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2013

Approximability of Connected Factors.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Smoothed Analysis of the Successive Shortest Path Algorithm.

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013