| An interior-point method for semidefinite programming C Helmberg, F Rendl, RJ Vanderbei, H Wolkowicz SIAM Journal on Optimization 6 (2), 342-361, 1996 | 1075 | 1996 |
| A spectral bundle method for semidefinite programming C Helmberg, F Rendl SIAM Journal on Optimization 10 (3), 673-696, 2000 | 626 | 2000 |
| Semidefinite programming for combinatorial optimization C Helmberg | 337 | 2000 |
| Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes C Helmberg, F Rendl Mathematical programming 82 (3), 291-315, 1998 | 319 | 1998 |
| A semidefinite programming approach to the quadratic knapsack problem C Helmberg, F Rendl, R Weismantel Journal of combinatorial optimization 4 (2), 197-215, 2000 | 166 | 2000 |
| Semidefinite programming C Helmberg European Journal of Operational Research 137 (3), 461-482, 2002 | 131 | 2002 |
| A spectral bundle method with bounds C Helmberg, KC Kiwiel Mathematical Programming 93 (2), 173-194, 2002 | 129 | 2002 |
| Robust rendering of general ellipses and elliptical arcs DW Fellner, C Helmberg ACM Transactions on Graphics (TOG) 12 (3), 251-276, 1993 | 77 | 1993 |
| A cutting plane algorithm for large scale semidefinite relaxations C Helmberg The Sharpest Cut: The Impact of Manfred Padberg and His Work, 233-256, 2004 | 66 | 2004 |
| A spectral approach to bandwidth and separator problems in graphs C Helmberg, F Rendl, B Mohar, S Poljak Linear and Multilinear Algebra 39 (1-2), 73-90, 1995 | 66 | 1995 |
| Fixing variables in semidefinite relaxations C Helmberg SIAM Journal on Matrix Analysis and Applications 21 (3), 952-969, 2000 | 58 | 2000 |
| Bundle methods to minimize the maximum eigenvalue function C Helmberg, F Oustry Handbook of semidefinite programming, 307-337, 2000 | 58 | 2000 |
| Embedded in the shadow of the separator F Göring, C Helmberg, M Wappler SIAM Journal on Optimization 19 (1), 472-501, 2008 | 56 | 2008 |
| The symmetric quadratic traveling salesman problem A Fischer, C Helmberg Mathematical Programming 142 (1-2), 205-254, 2013 | 54 | 2013 |
| Quadratic knapsack relaxations using cutting planes and semidefinite programming C Helmberg, F Rendl, R Weismantel International Conference on Integer Programming and Combinatorial …, 1996 | 54 | 1996 |
| A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem M Armbruster, M Fügenschuh, C Helmberg, A Martin International Conference on Integer Programming and Combinatorial …, 2008 | 48 | 2008 |
| Combining semidefinite and polyhedral relaxations for integer programs C Helmberg, S Poljak, F Rendl, H Wolkowicz International Conference on Integer Programming and Combinatorial …, 1995 | 48 | 1995 |
| Dynamic graph generation for the shortest path problem in time expanded networks F Fischer, C Helmberg Mathematical Programming 143 (1-2), 257-297, 2014 | 45 | 2014 |
| Towards solving very large scale train timetabling problems by lagrangian relaxation F Fischer, C Helmberg, J Janßen, B Krostitz 8th Workshop on Algorithmic Approaches for Transportation Modeling …, 2008 | 42 | 2008 |
| SBmethod---A C++ Implementation of the Spectral Bundle Method. Manual to Version 1.1 C Helmberg | 38 | 2000 |
