Computational complexity of sum-of-squares bounds for copositive programs
with Marilena Palomba, Luis Felipe Vargas, and Monaldo Mastrolilli (2024) [arXiv]

A sparsified Christoffel function for high-dimensional inference
with Jean-Bernard Lasserre (2024) [arXiv]

Testably Learning Polynomial Threshold Functions
with Stefan Tiegel and Manuel Wiedmer (2024) [arXiv]

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
with Manuel Wiedmer. In NACO (2024) [arXiv] [journal]

Degree bounds for Putinar's Positivstellensatz on the hypercube
with Lorenzo Baldi. In SIAM J. Applied Algebra and Geometry (2024) [arXiv] [journal]

A Note on the Computational Complexity of the Moment-SOS Hierarchy for Polynomial Optimization
with Sander Gribling and Sven Polak. In ISSAC 2023. [arXiv] [conference]

The Christoffel-Darboux kernel for topological data analysis
with Pepijn Roos Hoefgeest.  In SoCG 2023 [arXiv] [conference]

A recursive theta body for hypergraphs
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin. In Combinatorica (2023) [arXiv] [journal]

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
in SIAM J. Optimization (2022) [arXiv] [journal] [erratum]

An effective version of Schmüdgen's Positivstellensatz for the hypercube
with Monique Laurent.  In Optimization Letters (2022) [arXiv] [journal]

A recursive Lovász theta number for simplex-avoiding sets
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin. In Proc. American Mathematical Society (2022) [arXiv] [journal]

Sum-of-squares hierarchies for binary polynomial optimization
with Monique Laurent. In IPCO'21. Extended version in Mathematical Programming (2022) [arXiv] [conference] [journal]

Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization
with Monique Laurent. In Mathematical Programming (2021) [arXiv] [journal]

Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets
with Monique Laurent. In Mathematical Programming (2022) [arXiv] [journal]

Convergence Rates of Sums of Squares Hierarchies for Polynomial Optimization
with Monique Laurent (2024) [arXiv]

Polynomiale optimalisatie en sommen van kwadraten
in Nieuw Archief voor Wiskunde (Dec. 2024)

PhD Mathematics (cum laude) at Centrum Wiskunde & Informatica (CWI), Amsterdam and Tilburg University (2018-2022)
Thesis:   Asymptotic Analysis of Semidefinite Bounds for Polynomial Optimization and Independent Sets in Geometric Hypergraphs
promotors: prof. dr. Monique Laurent and prof. dr. Etienne de Klerk.

Msc. Mathematics at the University of Bonn (2016-2018)
Thesis:  Global Gate Sizing and Buffering, under the supervision of prof. dr. Stephan Held

Bsc. Mathematics and Bsc. Computer Science at the University of Amsterdam (2013-2016)
Thesis:  Ultrametric Simplices, under the supervision of dr. Jan Brandts and dr. Leen Torenvliet