| Publication | Date of Publication | Type |
|---|
Lower bounds on the complexity of mixed-integer programs for stable set and knapsack
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
Integer programs with bounded subdeterminants and two nonzeros per row
Journal of the ACM | 2026-02-24 | Paper |
Polyhedral aspects of feedback vertex set and pseudoforest deletion set
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
| Integer programs with bounded subdeterminants and two nonzeros per row | 2025-08-13 | Paper |
| The Pareto cover problem | 2025-06-19 | Paper |
| Lower bounds on the complexity of mixed-integer programs for stable set and knapsack | 2025-02-07 | Paper |
A simple method for convex optimization in the oracle model
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
scientific article; zbMATH DE number 7788500 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Lifts for Voronoi cells of lattices
Discrete & Computational Geometry | 2023-10-12 | Paper |
| Driver-aware charging infrastructure design | 2022-12-09 | Paper |
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Persistency of linear programming relaxations for the stable set problem
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
A simple method for convex optimization in the oracle model
(available as arXiv preprint) | 2022-08-16 | Paper |
Lattice-free simplices with lattice width \(2d - o(d)\)
(available as arXiv preprint) | 2022-08-16 | Paper |
Binary scalar products
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
Persistency of linear programming relaxations for the stable set problem
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Mathematics of Operations Research | 2020-03-12 | Paper |
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Mathematics of Operations Research | 2020-03-12 | Paper |
Extended formulations for radial cones
Operations Research Letters | 2020-02-10 | Paper |
Distances between optimal solutions of mixed-integer programs
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Optimality certificates for convex minimization and Helly numbers
Operations Research Letters | 2019-02-22 | Paper |
Hidden vertices in extensions of polytopes
Operations Research Letters | 2018-10-01 | Paper |
Subgraph polytopes and independence polytopes of count matroids
Operations Research Letters | 2018-09-28 | Paper |
Lifting linear extension complexity bounds to the mixed-integer setting
(available as arXiv preprint) | 2018-03-15 | Paper |
| Lifting linear extension complexity bounds to the mixed-integer setting | 2018-03-15 | Paper |
Maximum semidefinite and linear extension complexity of families of polytopes
Mathematical Programming. Series A. Series B | 2018-02-28 | Paper |
Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
Mathematics of Operations Research | 2017-12-07 | Paper |
Extension complexities of Cartesian products involving a pyramid
Information Processing Letters | 2017-09-19 | Paper |
Tight bounds on discrete quantitative Helly numbers
Advances in Applied Mathematics | 2017-07-04 | Paper |
Three enhancements for optimization-based bound tightening
Journal of Global Optimization | 2017-04-28 | Paper |
Extended formulations for independence polytopes of regular matroids
Graphs and Combinatorics | 2016-11-29 | Paper |
Lower bounds on the sizes of integer programs without additional variables
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
A short proof that the extension complexity of the correlation polytope grows exponentially
Discrete & Computational Geometry | 2015-04-16 | Paper |
| Computing The Extension Complexities of All 4-Dimensional 0/1-Polytopes | 2014-06-18 | Paper |
Lower bounds on the sizes of integer programs without additional variables
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2013-06-04 | Paper |
