Parallel Machine Scheduling under Uncertainty. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (IPMU (4), 2012)

Recoverable Robust Combinatorial Optimization Problems. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (OR, 2012)

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. - Adam Kurpisz; Monaldo Mastrolilli; Georgios Stamoulis (WAOA, 2012)

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Eur. J. Oper. Res., 2012)

Approximating the min-max (regret) selecting items problem. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Inf. Process. Lett., 2013)

Approximation Schemes for Robust Makespan Scheduling Problems. - Adam Kurpisz (OR, 2014)

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)

Inform friends, do not inform enemies. - Adam Kurpisz; Michal Morayne (IMA J. Math. Control. Inf., 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)

Approximability of the robust representatives selection problem. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Oper. Res. Lett., 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)

Semidefinite and linear programming integrality gaps for scheduling identical machines. - Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese (Math. Program., 2018)

Sum-Of-Squares Bounds via Boolean Function Analysis. - Adam Kurpisz (ICALP, 2019)

New Dependencies of Hierarchies in Polynomial Optimization. - Adam Kurpisz; Timo de Wolff (ISSAC, 2019)

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. - Adam Kurpisz; Aaron Potechin; Elias Samuel Wirth (ICALP, 2021)

Fair and Fast k-Center Clustering for Data Summarization. - Haris Angelidakis; Adam Kurpisz; Leon Sering; Rico Zenklusen (ICML, 2022)

Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. - Mareike Dressler; Adam Kurpisz; Timo de Wolff (Found. Comput. Math., 2022)

A technique for obtaining true approximations for k-center with covering constraints. - Georg Anegg; Haris Angelidakis; Adam Kurpisz; Rico Zenklusen (Math. Program., 2022)

Improved Approximations for Translational Packing of Convex Polygons. - Adam Kurpisz; Silvan Suter (ESA, 2023)

Sum of Squares Bounds for the Empty Integral Hull Problem. - Adam Kurpisz; Elias Samuel Wirth (ISSAC, 2023)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control. - Luca M. Hartmann; Orcun Karaca; Tinus Dorfling; Tobias Geyer; Adam Kurpisz (CoRR, 2024)

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

A Wiener Process Perspective on Local Intrinsic Dimension Estimation Methods. - Piotr Tempczyk; Lukasz Garncarek; Dominik Filipiak; Adam Kurpisz (AAAI, 2025)