| Publication | Date of Publication | Type |
|---|
| An oracle-based framework for robust combinatorial optimization | 2024-01-26 | Paper |
| On the complexity of the bilevel minimum spanning tree problem | 2023-12-12 | Paper |
| Bounded variation in binary sequences | 2023-08-03 | Paper |
| Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations | 2023-07-13 | Paper |
| The polytope of binary sequences with bounded variation | 2023-06-30 | Paper |
| Convex optimization under combinatorial sparsity constraints | 2022-12-12 | Paper |
| Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation | 2022-11-15 | Paper |
| The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective | 2022-07-19 | Paper |
| The stochastic bilevel continuous knapsack problem with uncertain follower's objective | 2022-07-18 | Paper |
| On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency | 2022-06-01 | Paper |
| On the complexity of robust bilevel optimization with uncertain follower's objective | 2021-12-13 | Paper |
| Lower bounds for cubic optimization over the sphere | 2021-06-15 | Paper |
| Stochastic single-allocation hub location | 2021-06-03 | Paper |
| On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective | 2021-05-18 | Paper |
| Quadratic Combinatorial Optimization Using Separable Underestimators | 2020-11-25 | Paper |
| A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization | 2020-08-31 | Paper |
| An active set algorithm for robust combinatorial optimization based on separation oracles | 2020-03-11 | Paper |
| An active set algorithm for robust combinatorial optimization based on separation oracles | 2020-02-17 | Paper |
| SDP-based branch-and-bound for non-convex quadratic integer optimization | 2019-05-23 | Paper |
| \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty | 2019-04-30 | Paper |
| Robust combinatorial optimization under convex and discrete cost uncertainty | 2019-03-19 | Paper |
| Berge-acyclic multilinear 0-1 optimization problems | 2018-10-30 | Paper |
| A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations | 2018-09-28 | Paper |
| Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty | 2018-08-17 | Paper |
| Reliable single allocation hub location problem under hub breakdowns | 2018-07-11 | Paper |
| The quadratic shortest path problem: complexity, approximability, and solution methods | 2018-05-30 | Paper |
| A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization | 2018-03-13 | Paper |
| Min-max-min robust combinatorial optimization | 2017-05-15 | Paper |
| Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization | 2017-04-28 | Paper |
| Ellipsoid Bounds for Convex Quadratic Integer Programming | 2017-01-13 | Paper |
| A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs | 2016-11-30 | Paper |
| A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels | 2016-11-30 | Paper |
| A compact linearisation of Euclidean single allocation hub location problems | 2016-10-18 | Paper |
| Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions | 2016-10-18 | Paper |
| Lower bounding procedures for the single allocation hub location problem | 2016-10-18 | Paper |
| A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming | 2016-09-02 | Paper |
| Robust Critical Node Selection by Benders Decomposition | 2016-05-19 | Paper |
| Lagrangean Decomposition for Mean-Variance Combinatorial Optimization | 2015-10-16 | Paper |
| Active Set Methods with Reoptimization for Convex Quadratic Integer Programming | 2015-10-16 | Paper |
| Exact Algorithms for Combinatorial Optimization Problems with Submodular Objective Functions | 2015-07-22 | Paper |
| On the separation of split inequalities for non-convex quadratic integer programming | 2015-04-09 | Paper |
| Combinatorial optimization with one quadratic term: spanning trees and forests | 2014-09-08 | Paper |
| Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators | 2014-06-02 | Paper |
| An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations | 2013-12-13 | Paper |
| Semidefinite relaxations for non-convex quadratic mixed-integer programming | 2013-11-11 | Paper |
| An effective branch-and-bound algorithm for convex quadratic integer programming | 2012-10-15 | Paper |
| Exact Algorithms for the Quadratic Linear Ordering Problem | 2012-07-28 | Paper |
| Submodular Formulations for Range Assignment Problems | 2012-05-13 | Paper |
| An Exact Algorithm for Robust Network Design | 2011-09-09 | Paper |
| Integer Programming Subject to Monomial Constraints | 2011-03-21 | Paper |
| Speeding up IP-based algorithms for constrained quadratic 0-1 optimization | 2010-09-16 | Paper |
| An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming | 2010-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181648 | 2009-10-12 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Linear optimization over permutation groups | 2009-06-02 | Paper |
| Testing planarity of geometric automorphisms in linear time | 2009-05-13 | Paper |
| On the subgroup distance problem. | 2009-04-09 | Paper |
| Local cuts revisited | 2009-03-04 | Paper |
| A New Exact Algorithm for the Two-Sided Crossing Minimization Problem | 2009-03-03 | Paper |
| Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case | 2008-12-05 | Paper |
| A branch-and-cut approach to the crossing number problem | 2008-10-29 | Paper |
| Bimodal Crossing Minimization | 2007-09-10 | Paper |
| Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem | 2007-09-10 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Crossing minimization for symmetries | 2005-06-14 | Paper |
| On the complexity of drawing trees nicely: Corrigendum | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043715 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472311 | 2004-08-04 | Paper |
| Réduction des tores déployés par une extension modérément ramifiée. (Reduction of tori split over tamely ramified extensions). | 2004-03-15 | Paper |
| Detecting symmetries by branch and cut. | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427877 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422294 | 2003-09-03 | Paper |
