| Publication | Date of Publication | Type |
|---|
| The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization | 2025-01-17 | Paper |
| On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems | 2024-11-12 | Paper |
| On solving MAX-SAT using sum of squares | 2024-07-29 | Paper |
| On Integrality in Semidefinite Programming for Discrete Optimization | 2024-04-03 | Paper |
| Partitioning through projections: strong SDP bounds for large graph partition problems | 2023-07-04 | Paper |
| Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs | 2023-05-25 | Paper |
| On solving the MAX-SAT using sum of squares | 2023-02-14 | Paper |
| Mathematical Programming Models and Exact Algorithms | 2022-11-15 | Paper |
| The Maximum k-Colorable Subgraph Problem and Related Problems | 2022-06-28 | Paper |
| SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning | 2022-06-28 | Paper |
| On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs | 2022-06-17 | Paper |
| Lower bounds for the bandwidth problem | 2022-03-09 | Paper |
| The Chv\'atal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization | 2022-01-25 | Paper |
| The linearization problem of a binary quadratic problem and its applications | 2022-01-24 | Paper |
| On solving the densestk-subgraph problem on large graphs | 2021-04-15 | Paper |
| On Solving the Quadratic Shortest Path Problem | 2021-01-07 | Paper |
| SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning | 2020-09-08 | Paper |
| The quadratic cycle cover problem: special cases and efficient bounds | 2020-04-27 | Paper |
| The maximum $k$-colorable subgraph problem and related problems | 2020-01-27 | Paper |
| Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs | 2019-12-21 | Paper |
| Lower Bounds for the Bandwidth Problem | 2019-04-14 | Paper |
| Graph bisection revisited | 2018-08-13 | Paper |
| Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems | 2018-07-09 | Paper |
| Special cases of the quadratic shortest path problem | 2018-04-13 | Paper |
| The MIN-cut and vertex separator problem | 2018-02-06 | Paper |
| An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem | 2017-03-01 | Paper |
| Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems | 2016-06-24 | Paper |
| SDP Relaxations for Some Combinatorial Optimization Problems | 2016-04-26 | Paper |
| A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives | 2016-01-25 | Paper |
| New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph | 2015-12-14 | Paper |
| On Bounding the Bandwidth of Graphs with Symmetry | 2015-09-11 | Paper |
| Semidefinite programming and eigenvalue bounds for the graph partition problem | 2015-06-19 | Paper |
| On semidefinite programming bounds for graph bandwidth | 2013-06-24 | Paper |
| Multi-start approach for an integer determinant maximization problem | 2013-04-22 | Paper |
| On semidefinite programming relaxations of maximum \(k\)-section | 2012-12-19 | Paper |
| A polynomial optimization approach to constant rebalanced portfolio selection | 2012-12-12 | Paper |
| Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry | 2012-06-26 | Paper |
| Clique-based facets for the precedence constrained knapsack problem | 2012-06-26 | Paper |
| Worst-case CVaR based portfolio optimization models with applications to scenario planning | 2012-05-16 | Paper |
| Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem | 2010-06-01 | Paper |
| Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem | 2010-02-19 | Paper |
| Exploiting group symmetry in truss topology optimization | 2009-12-02 | Paper |
| On Semidefinite Programming Relaxations of the Traveling Salesman Problem | 2009-11-27 | Paper |
| Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design | 2009-07-06 | Paper |
| On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs | 2009-06-17 | Paper |
| A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming | 2008-12-21 | Paper |
| Bounds for the quadratic assignment problem using the bundle method | 2007-03-05 | Paper |
| Recent approaches to the quadratic assignment problem | 2006-08-28 | Paper |
| Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition | 2006-01-13 | Paper |
| On self-regular IPMs (with comments and rejoinder) | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4702451 | 1999-11-24 | Paper |
| The quadratic minimum spanning tree problem: lower bounds via extended formulations | N/A | Paper |
| On convergence of a $q$-random coordinate constrained algorithm for non-convex problems | N/A | Paper |
| Exploiting Symmetries in Optimal Quantum Circuit Design | N/A | Paper |
| Cuts and semidefinite liftings for the complex cut polytope | N/A | Paper |
