Experience

Sign in to view more

Education

Sign in to view more

Bio

I received my Ph.D. from the University of Rome Tor Vergata in 2004 (spending part of the Ph.D. as a Marie-Curie Fellow at MPII). I was a PostDoc at MPII, University of Rome Sapienza, and TU Berlin, and an Assistant Professor at the University of Rome Tor Vergata. I made long research visits at the University of Berkeley, EPFL, and University of Bergen. Since 2011 I am a Research Professor at IDSIA, University of Lugano.

My work on Steiner tree approximation received the best STOC paper award in 2010. I was the recipient of an ERC Starting Grant in 2011. My work on Measure and Conquer was awarded the EATCS-IPEC Nerode Prize in 2017. I served (25 times, once as a co-chair) in the PC of most of the main conferences in my area, including STOC, SODA, ICALP, and ESA. I taught approximation algorithms at Ph.D. level in 5 Universities and Research Centers, including ETH Zurich.

My research is focused on the design and (mostly theoretical) analysis of algorithms and data structures to address a variety of problems. My main sub-area of interest is polynomial-time approximation algorithms. I also work(ed) on polynomial-time exact algorithms and data structures, exact/parameterized exponential-time algorithms, and distributed algorithms.

My work on Steiner tree approximation received the best STOC paper award in 2010. I was the recipient of an ERC Starting Grant in 2011. My work on Measure and Conquer was awarded the EATCS-IPEC Nerode Prize in 2017. I served (25 times, once as a co-chair) in the PC of most of the main conferences in my area, including STOC, SODA, ICALP, and ESA. I taught approximation algorithms at Ph.D. level in 5 Universities and Research Centers, including ETH Zurich.

My research is focused on the design and (mostly theoretical) analysis of algorithms and data structures to address a variety of problems. My main sub-area of interest is polynomial-time approximation algorithms. I also work(ed) on polynomial-time exact algorithms and data structures, exact/parameterized exponential-time algorithms, and distributed algorithms.