| Publication | Date of Publication | Type |
|---|
SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization
Mathematics of Operations Research | 2026-03-20 | Paper |
| Improved approximations for translational packing of convex polygons | 2025-01-06 | Paper |
Sum of Squares Bounds for the Empty Integral Hull Problem
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
A technique for obtaining true approximations for \(k\)-center with covering constraints
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| Sum-of-squares bounds via Boolean function analysis | 2022-07-21 | Paper |
Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
Foundations of Computational Mathematics | 2022-05-31 | Paper |
A technique for obtaining true approximations for \(k\)-center with covering constraints
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
scientific article; zbMATH DE number 7378399 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
New dependencies of hierarchies in polynomial optimization
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Sum-of-squares hierarchy lower bounds for symmetric formulations
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
Sum-of-squares rank upper bounds for matching problems
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Approximability of the robust representatives selection problem
Operations Research Letters | 2018-09-28 | Paper |
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
(available as arXiv preprint) | 2018-02-27 | Paper |
Tight sum-of-squares lower bounds for binary polynomial optimization problems
(available as arXiv preprint) | 2017-12-19 | Paper |
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
On the hardest problem formulations for the 0/1 Lasserre hierarchy
Mathematics of Operations Research | 2017-04-13 | Paper |
Sum-of-squares rank upper bounds for matching problems
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Sum-of-squares hierarchy lower bounds for symmetric formulations
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Approximation schemes for robust makespan scheduling problems
Operations Research Proceedings | 2016-05-19 | Paper |
A Lasserre lower bound for the min-sum single machine scheduling problem
Algorithms - ESA 2015 | 2015-11-19 | Paper |
On the hardest problem formulations for the \(0/1\) Lasserre hierarchy
Automata, Languages, and Programming | 2015-10-27 | Paper |
Improved approximation for the maximum duo-preservation string mapping problem
Lecture Notes in Computer Science | 2015-07-22 | Paper |
Recoverable Robust Combinatorial Optimization Problems
Operations Research Proceedings | 2015-02-12 | Paper |
Inform friends, do not inform enemies
IMA Journal of Mathematical Control and Information | 2014-10-21 | Paper |
Competitive-ratio approximation schemes for makespan scheduling problems
Approximation and Online Algorithms | 2013-09-13 | Paper |
Approximating the min-max (regret) selecting items problem
Information Processing Letters | 2013-03-21 | Paper |
Parallel machine scheduling under uncertainty
Communications in Computer and Information Science | 2012-12-03 | Paper |
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
European Journal of Operational Research | 2012-08-16 | Paper |
