Adam Kurpisz

Bern University of Applied Sciences — Switzerland

Mathematics · Physical Sciences

10h-index253citations40works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Optimization Algorithms Research(15), Complexity and Algorithms in Graphs(13), Optimization and Search Problems(11), Scheduling and Optimization Algorithms(10), Optimization and Packing Problems(8)

Publications40 total

IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation
arXiv (Cornell University)·2025Open Access
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization
Mathematics of Operations Research·2025
On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
arXiv (Cornell University)·2024Open Access
Tight Sum-of-squares Lower Bounds for Binary Polynomial Optimization Problems
ACM Transactions on Computation Theory·2023· 5 cited
Sum of Squares Bounds for the Empty Integral Hull Problem
2023Open Access
Improved Approximations for Translational Packing of Convex Polygons
arXiv (Cornell University)·2023Open Access
SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization
arXiv (Cornell University)·2021Open Access
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials
Foundations of Computational Mathematics·2021· 12 citedOpen Access
A technique for obtaining true approximations for k-center with covering constraints
Mathematical Programming·2021· 15 citedOpen Access
SoS certification for symmetric quadratic functions and its connection to constrained boolean hypercube optimization
Repository for Publications and Research Data (ETH Zurich)·2021Open Access
A Technique for Obtaining True Approximations for $k$-Center with\n Covering Constraints
arXiv (Cornell University)·2020Open Access
A Technique for Obtaining True Approximations for k-Center with Covering Constraints
Lecture notes in computer science·2020· 1 citedOpen Access
New Dependencies of Hierarchies in Polynomial Optimization
2019Open Access
Sum-of-squares hierarchy lower bounds for symmetric formulations
Mathematical Programming·2019Open Access
Sum-Of-Squares Bounds via Boolean Function Analysis
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 1 citedOpen Access
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit\n Polynomials
arXiv (Cornell University)·2018· 1 citedOpen Access
Sum-of-squares rank upper bounds for matching problems
Journal of Combinatorial Optimization·2017· 1 cited
Semidefinite and linear programming integrality gaps for scheduling identical machines
Mathematical Programming·2017· 9 citedOpen Access
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
Mathematical Programming·2017· 10 cited
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Mathematics of Operations Research·2016· 10 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Monaldo Mastrolilli(17), Samuli Leppänen(14), Adam Kasperski(6), Paweł Zieliński(6), Timo de Wolff(4), Georg Anegg(3), Haris Angelidakis(3), Rico Zenklusen(3), Aaron Potechin(3), Mareike Dressler(2), Claire Mathieu(2), Tobias Mömke(2), Víctor Verdugo(2), Andreas Wiese(2), Elias Wirth(2), Elias Samuel Wirth(2), Nicolas Boria(1), Georgios Stamoulis(1), Michał Morayne(1), Johannes Schmitt(1)