Monaldo Mastrolilli

Monaldo Mastrolilli is a Professor at the University of Applied Sciences of Southern Switzerland and holds a permanent position as Senior Researcher at IDSIA (Dalle Molle Institute for Artificial Intelligence), a joint institute of USI and SUPSI. He earned his PhD summa cum laude from the University of Kiel and a Computer Science Engineering degree from Politecnico di Milano. His research focuses on combinatorial optimization, complexity theory, approximation algorithms, and scheduling problems. He has authored over 30 publications in top journals/conferences such as FOCS, SODA, and Journal of Algorithms.

Research interests include approximation algorithms, metaheuristics, scheduling theory, and computational complexity. His work bridges theoretical foundations with practical applications in operations research and artificial intelligence. Notable contributions include advancements in Sum-of-Squares proofs, scheduling algorithms, and combinatorial optimization techniques. He has supervised four PhD students and serves on program committees for ICALP, APPROX, and WAOA. Awards include the Whizzkids'97 competition prize and a prestigious PhD distinction.

• Education: PhD (summa cum laude) in Computer Science, University of Kiel (2002); Master's in Computer Science Engineering, Politecnico di Milano (1997)
• Key Research Areas: Complexity Theory, Approximation Algorithms, Scheduling, Metaheuristics