Monaldo Mastrolilli

Monaldo Mastrolilli is a Senior Researcher at IDSIA (Dalle Molle Institute for Artificial Intelligence) and a Professor at University of Applied Sciences of Southern Switzerland (SUPSI). His research focuses on scheduling problems, approximation algorithms, combinatorial optimization, and complexity theory, with a particular emphasis on lift-and-project methods like the Sum-of-Squares Hierarchy and their applications to constraint satisfaction problems.

• Politecnico di Milano, Italy (Computer Science Engineering, 1997, with honors)
• University of Kiel, Germany (Ph.D. in Computer Science, 2002, summa cum laude)

His work spans polynomial optimization, integrality gaps, and algebraic geometry approaches, as evidenced by his leadership in the Swiss National Science Foundation project "Ideal Membership Problems and the Bit Complexity of Sum of Squares Proofs". He has mentored several Ph.D. students, including Ola Svensson, Nikos Mutsanas, Georgios Stamoulis, and Sam Leppanen.

• Prize in Whizzkids'97 competition on combinatorial optimization
• Summa cum laude Ph.D. degree (University of Kiel, 2002)

Monaldo's publications highlight trends in approximation algorithms, scheduling theory, and constraint satisfaction, often intersecting with polynomial optimization and algebraic methods. His recent work explores the intersection of universal algebra, proof systems, and computational complexity.

He supervises the Algorithms and Complexity Group at IDSIA, which is part of a collaborative environment involving the University of Lugano and SUPSI. The group includes two Ph.D. students, an IDSIA researcher, and collaborations with leading experts in theoretical computer science.