Deciding positivity of multisymmetric polynomials. - Paul Görlach; Cordian Riener; Tillmann Weißer (J. Symb. Comput., 2016)

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. - Tillmann Weißer; Jean B. Lasserre; Kim-Chuan Toh (Math. Program. Comput., 2018)

Optimal control problems with oscillations, concentrations and discontinuities. - Didier Henrion; Martin Kruzík; Tillmann Weißer (Autom., 2019)

Distributionally robust polynomial chance-constraints under mixture ambiguity sets. - Jean B. Lasserre; Tillmann Weißer (Math. Program., 2021)

Exploiting Sparsity for Semi-Algebraic Set Volume Computation. - Matteo Tacchi 001; Tillmann Weißer; Jean-Bernard Lasserre; Didier Henrion (Found. Comput. Math., 2022)