Fast Rendering of General Ellipses. - Dieter W. Fellner; Christoph Helmberg (Eurographics, 1991)

A spectral approach to bandwidth and separator problems in graphs. - Christoph Helmberg; Bojan Mohar; Svatopluk Poljak; Franz Rendl (IPCO, 1993)

Robust Rendering of General Ellipses and Elliptical Arcs. - Dieter W. Fellner; Christoph Helmberg (ACM Trans. Graph., 1993)

Best approximate general ellipses on integer grids. - Dieter W. Fellner; Christoph Helmberg (Comput. Graph., 1994)

Combining Semidefinite and Polyhedral Relaxations for Integer Programs. - Christoph Helmberg; Svatopluk Poljak; Franz Rendl; Henry Wolkowicz (IPCO, 1995)

Cutting aluminium coils with high length variabilities. - Christoph Helmberg (Ann. Oper. Res., 1995)

Quadratic Knapsack Relaxations Using Cutting Planes. - Christoph Helmberg; Franz Rendl; Robert Weismantel (IPCO, 1996)

An Interior-Point Method for Semidefinite Programming. - Christoph Helmberg; Franz Rendl; Robert J. Vanderbei; Henry Wolkowicz (SIAM J. Optim., 1996)

Incorporating Inequality Constraints in the Spectral Bundle Method. - Christoph Helmberg; Krzysztof C. Kiwiel; Franz Rendl (IPCO, 1998)

The m-Cost ATSP. - Christoph Helmberg (IPCO, 1999)

A Semidefinite Programming Approach to the Quadratic Knapsack Problem. - Christoph Helmberg; Franz Rendl; Robert Weismantel (J. Comb. Optim., 2000)

A Spectral Bundle Method for Semidefinite Programming. - Christoph Helmberg; Franz Rendl (SIAM J. Optim., 2000)

Fixing Variables in Semidefinite Relaxations. - Christoph Helmberg (SIAM J. Matrix Anal. Appl., 2000)

Semidefinite programming. - Christoph Helmberg (Eur. J. Oper. Res., 2002)

A spectral bundle method with bounds. - Christoph Helmberg; Krzysztof C. Kiwiel (Math. Program., 2002)

Numerical evaluation of SBmethod. - Christoph Helmberg (Math. Program., 2003)

A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations. - Christoph Helmberg (The Sharpest Cut, 2004)

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. - Michael Armbruster; Marzena Fügenschuh; Christoph Helmberg; Nikolay Jetchev; Alexander Martin 001 (OR, 2005)

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. - Michael Armbruster; Marzena Fügenschuh; Christoph Helmberg; Nikolay Jetchev; Alexander Martin 001 (EvoCOP, 2006)

A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses. - Christoph Helmberg; Stefan Röhl (Oper. Res., 2007)

Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. - Frank Fischer 002; Christoph Helmberg; Jürgen Janßen; Boris Krostitz (ATMOS, 2008)

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. - Michael Armbruster; Marzena Fügenschuh; Christoph Helmberg; Alexander Martin 001 (IPCO, 2008)

On the Graph Bisection Cut Polytope. - Michael Armbruster; Christoph Helmberg; Marzena Fügenschuh; Alexander Martin 001 (SIAM J. Discret. Math., 2008)

Embedded in the Shadow of the Separator. - Frank Göring; Christoph Helmberg; Markus Wappler (SIAM J. Optim., 2008)

Network Models with Convex Cost Structure like Bundle Methods. - Christoph Helmberg (Models and Algorithms for Optimization in Logistics, 2009)

Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. - Frank Fischer 002; Christoph Helmberg (ATMOS, 2010)

A note on Fiedler vectors interpreted as graph realizations. - Christoph Helmberg; Susanna Reiss (Oper. Res. Lett., 2010)

The rotational dimension of a graph. - Frank Göring; Christoph Helmberg; Markus Wappler (J. Graph Theory, 2011)

Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. - Frank Göring; Christoph Helmberg; Susanna Reiss (Math. Program., 2012)

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. - Michael Armbruster; Marzena Fügenschuh; Christoph Helmberg; Alexander Martin 001 (Math. Program. Comput., 2012)

The symmetric quadratic traveling salesman problem. - Anja Fischer; Christoph Helmberg (Math. Program., 2013)

On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. - Frank Göring; Christoph Helmberg; Susanna Reiss (SIAM J. Optim., 2013)

Dynamic graph generation for the shortest path problem in time expanded networks. - Frank Fischer 002; Christoph Helmberg (Math. Program., 2014)

The spectral bundle method with second-order information. - Christoph Helmberg; Michael L. Overton; Franz Rendl (Optim. Methods Softw., 2014)

A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions. - Frank Fischer 002; Christoph Helmberg (SIAM J. Optim., 2014)

Threshold graphs of maximal Laplacian energy. - Christoph Helmberg; Vilmar Trevisan (Discret. Math., 2015)

Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs. - Christoph Helmberg; Israel Rocha; Uwe Schwerdtfeger (SIAM J. Discret. Math., 2017)

Periodic Event Scheduling for Automated Production Systems. - Christoph Helmberg; Tobias Hofmann; David Wenzel (INFORMS J. Comput., 2022)

A preconditioned iterative interior point approach to the conic bundle subproblem. - Christoph Helmberg (Math. Program., 2024)

An Interlacing Property of the Signless Laplacian of Threshold Graphs. - Christoph Helmberg; Guilherme Porto; Guilherme Torres; Vilmar Trevisan (Electron. J. Comb., 2025)