| Publication | Date of Publication | Type |
|---|
| A preconditioned iterative interior point approach to the conic bundle subproblem | 2024-04-09 | Paper |
| An interlacing property of the signless Laplacian of threshold graphs | 2023-08-24 | Paper |
| Combining semidefinite and polyhedral relaxations for integer programs | 2022-08-30 | Paper |
| Periodic Event Scheduling for Automated Production Systems | 2022-06-30 | Paper |
| Optimization and stabilization of hierarchical electrical networks | 2021-09-03 | Paper |
| Quadratic knapsack relaxations using cutting planes and semidefinite programming | 2019-01-11 | Paper |
| Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem | 2018-04-12 | Paper |
| Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs | 2017-06-14 | Paper |
| Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy | 2016-11-08 | Paper |
| Threshold graphs of maximal Laplacian energy | 2015-04-01 | Paper |
| The spectral bundle method with second-order information | 2014-10-29 | Paper |
| A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions | 2014-09-26 | Paper |
| Dynamic graph generation for the shortest path problem in time expanded networks | 2014-02-25 | Paper |
| The symmetric quadratic traveling salesman problem | 2014-02-03 | Paper |
| On minimizing the spectral width of graph Laplacians and associated graph realizations | 2013-09-25 | Paper |
| LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison | 2013-08-05 | Paper |
| Towards solving very large scale train timetabling problems by Lagrangian relaxation | 2012-09-28 | Paper |
| Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling | 2012-09-28 | Paper |
| Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian | 2012-02-22 | Paper |
| The rotational dimension of a graph | 2011-04-19 | Paper |
| A note on Fiedler vectors interpreted as graph realizations | 2010-09-07 | Paper |
| On the Graph Bisection Cut Polytope | 2009-08-20 | Paper |
| Embedded in the Shadow of the Separator | 2009-03-06 | Paper |
| A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem | 2008-06-10 | Paper |
| The rotational Dimension of a graph | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416563 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465120 | 2005-08-22 | Paper |
| Numerical evaluation of SBmethod | 2003-10-29 | Paper |
| Semidefinite programming | 2002-06-16 | Paper |
| A spectral bundle method with bounds | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517106 | 2000-11-23 | Paper |
| A semidefinite programming approach to the quadratic knapsack problem | 2000-10-30 | Paper |
| A Spectral Bundle Method for Semidefinite Programming | 2000-10-19 | Paper |
| Fixing Variables in Semidefinite Relaxations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263716 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234142 | 1999-09-15 | Paper |
| Solving quadratic (0,1)-problems by semidefinite programs and cutting planes | 1999-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840376 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400647 | 1998-08-02 | Paper |
| An Interior-Point Method for Semidefinite Programming | 1996-09-22 | Paper |
| A spectral approach to bandwidth and separator problems in graphs | 1995-12-11 | Paper |
| Cutting aluminium coils with high length variabilities | 1995-10-18 | Paper |
| Robust rendering of general ellipses and elliptical arcs | 1994-03-13 | Paper |
