Pubblicazioni di Leonardi Stefano
2015
Lattanzi Silvio, Leonardi Stefano, Mirrokni Vahab, Razenshteyny Ilya
Robust hierarchical k-center clustering. ITCS '15 Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science 2015: 211-218
Adamczyk MAREK PIOTR, Borodin Allan, Ferraioli Diodato, DE KEIJZER Bart, Leonardi Stefano
Sequential posted price mechanisms with correlated valuations. Web and Internet Economics. 11th International Conference, WINE 2015 Amsterdam, The Netherlands, December 9 – 12, 2015 Proceedings 2015: 1-15
Anagnostopoulos Aristidis, Becchetti Luca, Ilaria Bordino, Leonardi Stefano, Ida Mele, Piotr Sankowski
Stochastic Query Covering for Fast Approximate Document Retrieval. ACM TRANSACTIONS ON INFORMATION SYSTEMS 2015: 1-35
2014
Anagnostopoulos Aristidis, Fabrizio Grandoni, Leonardi Stefano, Andreas Wiese
A Mazing 2+eps Approximation Algorithm for Unsplittable Flow on a Path. Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014 2014: 26-41
Lattanzi Silvio, Leonardi Stefano
Efficient Computation of the Weighted Clustering Coefficient. Algorithms and Models for the Web Graph. 11th International Workshop, WAW 2014 Beijing, China, December 17–18, 2014 Proceedings 2014: 34-46
EPASTO ALESSANDRO, J. Feldman, LATTANZI SILVIO, LEONARDI Stefano, V. Mirrokni
Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs. Proceedings of the 23rd International World Wide Web Conference, WWW '14 2014: 349-360
COLINI BALDESCHI Riccardo, Leonardi Stefano, P. Sankowski, Q. Zhang
Revenue maximizing envy-free fixed-price auctions with budgets. Web and Internet Economics 2014: 233-246
Grandoni Fabrizio, Krysta Piotr, Leonardi Stefano, Ventre Carmine
Utilitarian mechanism design for multiobjective optimization. SIAM JOURNAL ON COMPUTING 2014: 1263-1290
2013
Bonifaci Vincenzo, Leonardi Stefano
Algorithms for auctions and games. The Power of Algorithms: Inspiration and Examples in Everyday Life 2013: 207-234
Anagnostopoulos Aristidis, Fabrizio Grandoni, Leonardi Stefano, Wiese Andreas
Constant integrality gap LP formulations of unsplittable flow on a path. Lecture Notes in Computer Science Integer Programming and Combinatorial Optimization 2013: 25-36
Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Leonardi Stefano, Tim Roughgarden, Xiaoming Xu
Near-optimal multi-unit auctions with ordered bidders. Proceedings of ACM Conference on Electronic Commerce, EC '13 2013: 91-102
Fabrizio Grandoni, Anupam Gupta, Leonardi Stefano, Pauli Miettinen, Sankowski Piotr, Mohit Singh
SET COVERING WITH OUR EYES CLOSED. SIAM JOURNAL ON COMPUTING 2013: 808-830
2012
Cygan Marek, Fabrizio Grandoni, LEONARDI Stefano, Marcin Pilipczuk, Piotr Sankowski
A path-decomposition theorem with applications to pricing and covering on trees. Proceedings of ESA 2012 2012: 349-360
Alex Kesselman, Leonardi Stefano
Game-theoretic analysis of Internet switching with selfish users. THEORETICAL COMPUTER SCIENCE 2012: 107-116
COLINI BALDESCHI Riccardo, Monika Henzinger, Leonardi Stefano, Martin Starnberger
On multiple keyword sponsored search auctions with budgets. Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings 2012: 1-12
Anagnostopoulos Aristidis, Becchetti Luca, Carlos Castillo, Aristides Gionis, Leonardi Stefano
Online team formation in social networks. Proceedings of the 21st International World Wide Web Conference 2012 (WWW 2012) 2012: 839-848
Leonardi Stefano, Tim Roughgarden
Prior-free auctions with ordered bidders. Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 2012: 427-433
Michal Feldman, Amos Fiat, LEONARDI Stefano, SANKOWSKI PIOTR
Revenue maximizing envy-free multi-unit auctions with budgets. ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012 2012: 532-549
2011
Marek Cygan, Fabrizio Grandoni, LEONARDI Stefano, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Approximation algorithms for union and intersection covering problems. LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICSProceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011 2011: 28-40
Leonardi Stefano
Prof. Guido Schaefer. 2011: -
Amos Fiat, LEONARDI Stefano, Jared Saia, Piotr Sankowski
Single valued combinatorial auctions with budgets. Proceedings 12th ACM Conference on Electronic Commerce (EC-2011) 2011: 223-232
ANAGNOSTOPOULOS ARISTIDIS, BECCHETTI Luca, LEONARDI Stefano, Ida Mele, Piotr Sankowski
Stochastic query covering. Proceedings of the fourth ACM international conference on Web search and data mining 2011: 725-734
2010
Becchetti Luca, Bordino Ilaria, Leonardi Stefano, Adi Rosen
Fully decentralized computation of aggregates over data streams. SIGKDD EXPLORATIONS 2010: 83-91
ANAGNOSTOPOULOS ARISTIDIS, Fabrizio Grandoni, LEONARDI Stefano, Piotr Sankowski
Online Network Design with Outliers. Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) 2010: 114-126
ANAGNOSTOPOULOS ARISTIDIS, BECCHETTI Luca, Carlos Castillo, Aristides Gionis, LEONARDI Stefano
Power in unity: Forming teams in large-scale community systems. Proceedings of the 19th ACM interna- tional conference on Information and knowledge management 2010: 599-608
Lisa Fleischer, J. Koenemann, Leonardi Stefano, G. Schaefer
Strict cost sharing schemes for steiner forest. SIAM JOURNAL ON COMPUTING 2010: 3616-3632
Grandoni Fabrizio, P. Krysta, Leonardi Stefano, C. Ventre
Utilitarian mechanism design for multi-objective optimization. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. 2010: 573-584