Kamiel Cornelissen

16 papers A* 1B 2C 3Misc 1Journal 9
YearRankTypeTitle / Venue / Authors
2020 J jnl
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.
J. Graph Algorithms Appl.
Kamiel Cornelissen, Bodo Manthey
2018 J jnl
Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Theory Comput. Syst.
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
2018 J jnl
Belief propagation for the maximum-weight independent set and minimum spanning tree problems.
Theor. Comput. Sci.
Kamiel Cornelissen, Bodo Manthey
2015 Misc conf
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.
COCOON
Kamiel Cornelissen, Bodo Manthey
2015 C conf
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.
CTW
Kamiel Cornelissen, Bodo Manthey
2015 J jnl
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm.
CoRR
Kamiel Cornelissen, Bodo Manthey
2015 J jnl
Smoothed Analysis of the Successive Shortest Path Algorithm.
CoRR
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2015 J jnl
Smoothed Analysis of the Successive Shortest Path Algorithm.
SIAM J. Comput.
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2013 C ed.
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013.
CTW
Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey
2013 B conf
Approximability of Connected Factors.
WAOA
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013 J jnl
Approximability of Connected Factors.
CoRR
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013 B conf
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.
WALCOM
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013 J jnl
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.
J. Graph Algorithms Appl.
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013 A* conf
Smoothed Analysis of the Successive Shortest Path Algorithm.
SODA
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013 C conf
Smoothed analysis of the successive shortest path algorithm.
CTW
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2012 J jnl
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
CoRR
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin