Prof. Dr. Adam Andrzej Kurpisz

• Dozent, Tenured Professor of Mathematics at Business School at BFH

• Researcher at the Department of Mathematics at ETH Zürich

• Algorithm Design

• Explainable AI

• Machine Learning

• Bachelor in Business Administration

• Mathematics (ETH Zürich)

• Quantitative Methods I

• Quantitative Methods II

• Convex Optimization

• Algebraic Proof Systems

• Combinatorial Optimization

• Approximation Algorithms

• Computational Complexity

• Artificial Inteligence

• Explainable Artificial Intelligence (XAI)

• My research interests are focused on Combinatorial Optimization problems both from the perspective of constructing efficient algorithms and proving complexity bounds. The core of my research is applying methods from Real Algebraic Geometry to construct and analyze Semi-algebraic Proof Systems that, in turns, provide unified algorithmic frameworks (e.g. Sum-of-Squares algorithm). To prove strength and limitations of such Semi-algebraic Proof Systems I use various techniques from Linear Algebra, Fourier Analysis of Boolean Functions and Approximation Theory. During my PhD time I was working on Robust Optimization and this topic stays close to my heart. Recently, I have also been exploring machine learning and explainable. In free time I enjoy exploring random walks in graphs.

• I am a Tenured Professor for Mathematoics at Business School at BFH and a Researcher Assistant in the Department of Mathematics at ETH Zürich.
  
  Previously, I was the Head of Ambizione Junior Research Group hosted by Prof. Rico Zenklusen at the Institute for Operations Research (IFOR) of the Department of Mathematics at ETH Zürich.
  
  Before joining ETH Zürich I had the pleasure to be a postdoctoral researcher and an exchange PhD student at IDSIA under the supervision of Prof. Monaldo Mastrolilli and a visiting researcher at Max-Planck-Institut für Informatik hosted by Prof. Andreas Wiese.
  
  I obtained my PhD degree under the supervision of Prof. Paweł Zieliński at the Department of Computer Science of the Faculty of Fundamental Problems of Technology at Wrocław University of Science and Technology, Poland.

• 2025 - Professor for Operations Research in Tenure-Track Bern Business School, Switzerland
• 2022 - 2025 Professor for Operations Research in Tenure-Track Bern Business School, Switzerland
• 2022 - Research Assistant Department of Mathematics at ETH Zürich
• 2021 - Co-founder and head of the Scientific Council Deeptale.ai, Switzerland/Poland
• 2017 - Co-Founder and Head of Algorithms Silencions, Switzerland/Poland
• 2015 - 2018 Postdoctoral researcher IDSIA, Switzerland

• 2009 - 2014 Ph.D. Mathematics Wroclaw University of Technology, Poland
• 2006 - 2011 M.Sc. Mathematics Wroclaw University of Technology, Poland
• 2004 - 2009 M.Sc. Computer Science Wroclaw University of Technology, Poland

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2024). Tight Sum-of-squares Lower Bounds for Binary Polynomial Optimization Problems. In ACM Transactions on Computation Theory (Vol. 16, Issue 1). Association for Computing Machinery (ACM). https://doi.org/10.24451/dspace/11500

• Anegg, G., Angelidakis, H., Kurpisz, A. A., & Zenklusen, R. (2021). A technique for obtaining true approximations for k-center with covering constraints. In Mathematical Programming (Vol. 192). Springer. https://doi.org/10.24451/dspace/11761

• Dressler, M., Kurpisz, A. A., & de Wolff, T. (2021). Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. In Foundations of Computational Mathematics (Vol. 22, Issue 2). Springer. https://doi.org/10.24451/dspace/11718

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2020). Sum-of-squares hierarchy lower bounds for symmetric formulations. In Mathematical Programming (Vol. 182). Springer. https://doi.org/10.24451/dspace/11790

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2018). Sum-of-squares rank upper bounds for matching problems. In Journal of Combinatorial Optimization (Vol. 36). Springer. https://doi.org/10.24451/dspace/11793

• Kurpisz, A. A., Mastrolilli, M., Mathieu, C., Mömke, T., Verdugo, V., & Wiese, A. (2017). Semidefinite and linear programming integrality gaps for scheduling identical machines. In Mathematical Programming (Vol. 172, Issues 1–2). Springer. https://doi.org/10.24451/dspace/11712

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2017). An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. In Mathematical Programming (Vol. 166, Issues 1–2). Springer. https://doi.org/10.24451/dspace/11789

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2016). On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. In Mathematics of Operations Research (Vol. 42, Issue 1). Institute for Operations Research and the Management Sciences (INFORMS). https://arbor.bfh.ch/handle/arbor/45081

• Kurpisz, A. A., Leppänen, S., & Mastrolilli, M. (2015). On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. ICALP. https://arbor.bfh.ch/handle/arbor/45075

• Kasperski, A., Kurpisz, A. A., & Zieliński, P. (2015). Approximability of the robust representatives selection problem. In Operations Research Letters (Vol. 43, Issue 1). Elsevier. https://doi.org/10.24451/dspace/11692

• Kurpisz, A. A., & Morayne, M. (2014). Inform friends, do not inform enemies. In IMA Journal of Mathematical Control and Information (Vol. 31, Issue 3). Oxford University Press. https://doi.org/10.24451/dspace/11792

• Kasperski, A., Kurpisz, A. A., & Zieliński, P. (2013). Approximating the min–max (regret) selecting items problem. In Information Processing Letters (Vol. 113, Issues 1–2). Elsevier. https://doi.org/10.24451/dspace/11794

• Kasperski, A., Kurpisz, A. A., & Zieliński, P. (2012). Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. In European Journal of Operational Research (Vol. 217, Issue 1). Elsevier BV. https://doi.org/10.24451/dspace/11671

• Co-founder and advisor of Deeptale.ai

• Co-founder and advisor of Silencions.com

• Co-founder and advisor of Spes3d.com

2019

• Skorupinski Ruben Fairness Aspects of the k-center Problems 2021

• Zaytsev Mikhail Large SOS Rank via Nonnegativity Certificates 2026

• Silvan Suter Translational Packings of Rectangles and Convex Polygons 2023

• Keiser Delia Two-Stage Models for Sustainable Portfolio Optimisation 2022

• Elias Wirth Sum of Squares Bounds for Combinatorial Optimization Problems 2020

• English - Full professional proficiency
• German - Professional working proficiency
• Italian - Limited working proficiency
• Polish - Native or bilingual proficiency