Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. - Nicolas Boria; Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (WABI, 2014)

On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (CoRR, 2014)

A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ESA, 2015)

On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ICALP (1), 2015)

Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ICALP, 2016)

Sum-of-squares hierarchy lower bounds for symmetric formulations. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Electron. Colloquium Comput. Complex., 2016)

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Math. Oper. Res., 2017)

An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Math. Program., 2017)

Sum-of-squares rank upper bounds for matching problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (J. Comb. Optim., 2018)

Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ACM Trans. Comput. Theory, 2024)