Stefano Leonardi

Professore ordinario


leonardi@diag.uniroma1.it
Stanza: B205
Tel: +39 0677274022
Fax: +39 0677274002
Biografia: 

 January 2005 - Full Professor, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.

August 2005 - December 2005, Visiting Scholar, Carnegie Mellon University, USA, Aladdin Center, Department of Computer Science.

November 2001 - December 2004, Associate Professor, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.

September 2000 - October 2001, Researcher, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.

May 1997 - October 1997, February 1997 - June 1997, Post-doc in the “Algorithms and Complexity” group at the Max-Planck-Institut fuer Informatik, Saarbreucken, Germany.

January 1996 - September 1996, Post-doc in the Theory Group at the International Computer Science Institute (ICSI), Berkeley, USA.

October 1997 - August 2000, Research fellow, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.

Ph.D. Degree in Computer Science, University of Rome “La Sapienza” (Advisor: Prof. Giorgio Ausiello): “On-line Resource Management with Application to Routing and Scheduling”, February 1996.

Pubblicazioni: 

Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis and Stefano Leonardi. Power in Unity: Forming Teams in Large-Scale Community Systems. Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, 2010.

Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh. Set Covering with Our Eyes Closed. To appear in 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008).

Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, and Stefano Leonardi. Link analysis for web spam detection. ACM Transactions on the Web (TWEB), 2(1), 2008.

Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan H. M. van Zwam. A group-strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing, 37(5):1319–1341, 2008.

L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time on single and Parallel Machines. Journal of the ACM,(51)4, pp. 517-539, 2004.

Riconoscimenti e premi: 
  • Award Committee, EATCS Presburger Award, 2010-2012
  • Program Chair, 5th Workshop on Internet and network Economics, Rome, December 2009
  • Program Chair, 13th Annual European Symposium on Algorithms - ESA 2005, Ibiza, Spain, October 2005.
  • Program Chair, 2nd Workshop on Algorithms and Models for the Web-Graph WAW2004, in conjunction with IEEE FOCS04, Roma, October 16, 2004.
  • Editorial board, Journal of Interconnection Networks, since 2003.
  • Member of Steering Committee, European Symposium on Algorithms, 2004 - 2007.
  • Editorial board, ACM Transactions on Algorithms, since 2008.

 

Interessi di ricerca: 

Approximation algorithms, Online algorithms, Algorithmic Game Theory and Mechanism Design, Network Design, Scheduling, Web Search and Data Mining, Large-scale Complex Network Analysis, Online Social Networks.