基本信息
浏览量:266
职业迁徙
个人简介
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.
研究兴趣
论文共 162 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2024)
引用0浏览0EI引用
0
0
Algorithmicano. 10 (2023): 3088-3109
引用0浏览0EI引用
0
0
SIAM JOURNAL ON COMPUTINGno. 2 (2023)
引用0浏览0引用
0
0
ITCSpp.63:1-63:13, (2023)
引用0浏览0EI引用
0
0
SODApp.2368-2410, (2023)
SODApp.940-986, (2023)
CoRR (2023)
引用0浏览0EI引用
0
0
Society for Industrial and Applied Mathematics eBookspp.940-986, (2023)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn