| Approximating a two-machine flow shop scheduling under discrete scenario uncertainty A Kasperski, A Kurpisz, P Zieliński European Journal of Operational Research 217 (1), 36-43, 2012 | 80 | 2012 |
| A Technique for Obtaining True Approximations for k-Center with Covering Constraints G Anegg, H Angelidakis, A Kurpisz, R Zenklusen International conference on integer programming and combinatorial …, 2020 | 70 | 2020 |
| Approximating the min–max (regret) selecting items problem A Kasperski, A Kurpisz, P Zieliński Information Processing Letters 113 (1-2), 23-29, 2013 | 35 | 2013 |
| Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials M Dressler, A Kurpisz, T De Wolff Foundations of Computational Mathematics 22 (2), 365-387, 2022 | 32 | 2022 |
| On the hardest problem formulations for the 0/1 lasserre hierarchy A Kurpisz, S Leppänen, M Mastrolilli Mathematics of Operations Research 42 (1), 135-143, 2017 | 31 | 2017 |
| Sum-of-squares hierarchy lower bounds for symmetric formulations A Kurpisz, S Leppänen, M Mastrolilli Mathematical Programming 182 (1), 369-397, 2020 | 29* | 2020 |
| Fair and fast k-center clustering for data summarization H Angelidakis, A Kurpisz, L Sering, R Zenklusen International Conference on Machine Learning, 669-702, 2022 | 26 | 2022 |
| Parallel machine scheduling under uncertainty A Kasperski, A Kurpisz, P Zieliński International Conference on Information Processing and Management of …, 2012 | 21 | 2012 |
| An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem A Kurpisz, S Leppänen, M Mastrolilli Mathematical Programming 166 (1), 1-17, 2017 | 20* | 2017 |
| Tight Sum-of-squares Lower Bounds for Binary Polynomial Optimization Problems A Kurpisz, S Leppänen, M Mastrolilli ACM Transactions on Computation Theory 16 (1), 1-16, 2024 | 16* | 2024 |
| Approximability of the robust representatives selection problem A Kasperski, A Kurpisz, P Zieliński Operations Research Letters 43 (1), 16-19, 2015 | 16 | 2015 |
| Recoverable robust combinatorial optimization problems A Kasperski, A Kurpisz, P Zieliński Operations Research Proceedings 2012: Selected Papers of the International …, 2013 | 16 | 2013 |
| Improved approximation for the maximum duo-preservation string mapping problem N Boria, A Kurpisz, S Leppänen, M Mastrolilli International Workshop on Algorithms in Bioinformatics, 14-25, 2014 | 14 | 2014 |
| Semidefinite and linear programming integrality gaps for scheduling identical machines A Kurpisz, M Mastrolilli, C Mathieu, T Mömke, V Verdugo, A Wiese Mathematical Programming 172 (1), 231-248, 2018 | 12 | 2018 |
| New dependencies of hierarchies in polynomial optimization A Kurpisz, T de Wolff Proceedings of the 2019 International Symposium on Symbolic and Algebraic …, 2019 | 9 | 2019 |
| SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization A Kurpisz, A Potechin, E Wirth Mathematics of Operations Research, 2025 | 5 | 2025 |
| Competitive-ratio approximation schemes for makespan scheduling problems A Kurpisz, M Mastrolilli, G Stamoulis International Workshop on Approximation and Online Algorithms, 159-172, 2012 | 5 | 2012 |
| Sum-of-squares bounds via boolean function analysis A Kurpisz Proceedings of the 46th International Colloquium on Automata, Languages, and …, 2019 | 4 | 2019 |
| Inform friends, do not inform enemies A Kurpisz, M Morayne IMA Journal of Mathematical Control and Information 31 (3), 435-440, 2014 | 3 | 2014 |
| IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation J Schmitt, G Bérczi, J Dekoninck, J Feusi, T Gehrunger, R Appenzeller, ... arXiv preprint arXiv:2509.26076, 2025 | 2 | 2025 |
Monaldo MastrolilliSUPSI-IDSIAVerified email at supsi.ch
