Stefano Leonardi

4.9k total citations
116 papers, 2.5k citations indexed

About

Stefano Leonardi is a scholar working on Computer Networks and Communications, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Stefano Leonardi has authored 116 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 60 papers in Computer Networks and Communications, 45 papers in Management Science and Operations Research and 30 papers in Computational Theory and Mathematics. Recurrent topics in Stefano Leonardi's work include Optimization and Search Problems (52 papers), Auction Theory and Applications (41 papers) and Complexity and Algorithms in Graphs (24 papers). Stefano Leonardi is often cited by papers focused on Optimization and Search Problems (52 papers), Auction Theory and Applications (41 papers) and Complexity and Algorithms in Graphs (24 papers). Stefano Leonardi collaborates with scholars based in Italy, United States and United Kingdom. Stefano Leonardi's co-authors include Luca Becchetti, Carlos Castillo, Debora Donato, Aristides Gionis, Alessandro Panconesi, Luciana S. Buriol, Aris Anagnostopoulos, Aldo Gangemi, Ricardo Baeza‐Yates and Alberto Marchetti-Spaccamela and has published in prestigious journals such as ACM Computing Surveys, Journal of the ACM and Mathematical Programming.

In The Last Decade

Stefano Leonardi

109 papers receiving 2.4k citations

Peers

Countries citing papers authored by Stefano Leonardi

Since Specialization

Citations

This map shows the geographic impact of Stefano Leonardi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefano Leonardi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefano Leonardi more than expected).

Fields of papers citing papers by Stefano Leonardi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stefano Leonardi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefano Leonardi. The network helps show where Stefano Leonardi may publish in the future.

Co-authorship network of co-authors of Stefano Leonardi

This figure shows the co-authorship network connecting the top 25 collaborators of Stefano Leonardi. A scholar is included among the top collaborators of Stefano Leonardi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefano Leonardi. Stefano Leonardi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity 2025 ·Theoretical Computer Science ·Georgios Amanatidis, (unknown), (unknown), Stefano Leonardi, Alberto Marchetti-Spaccamela, (unknown)	1
2	Prophet Inequalities via the Expected Competitive Ratio 2025 ·(unknown), Stefano Leonardi, (unknown), M.V. Russo, (unknown)	0
3	The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations 2024 ·Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano) ·Nicolò Cesa‐Bianchi, (unknown), (unknown), (unknown), Stefano Leonardi	4
4	Deep active learning for misinformation detection using geometric deep learning 2023 ·IRIS Research product catalog (Sapienza University of Rome) ·(unknown), (unknown), Carlos Castillo, Stefano Leonardi, Preslav Nakov, Giovanni Da San Martino, Fabrizio Silvestri	11
5	Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness 2023 ·Mathematics of Operations Research ·Georgios Amanatidis, Georgios Birmpas, (unknown), (unknown), Stefano Leonardi, (unknown)	1
6	Pandora’s Box Problem with Order Constraints 2022 ·Mathematics of Operations Research ·(unknown), (unknown), (unknown), Stefano Leonardi	0
7	Online revenue maximization for server pricing 2022 ·IRIS Research product catalog (Sapienza University of Rome) ·(unknown), (unknown), Stefano Leonardi, Yishay Mansour, Ruta Mehta	0
8	Efficient two-sided markets with limited information 2021 ·IRIS Research product catalog (Sapienza University of Rome) ·Paul Dütting, (unknown), (unknown), Stefano Leonardi, (unknown)	7
9	Stochastic bandits for multi-platform budget optimization in online advertising 2021 ·IRIS Research product catalog (Sapienza University of Rome) ·(unknown), (unknown), Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers	11
10	Envy, regret, and social welfare loss 2020 ·IRIS Research product catalog (Sapienza University of Rome) ·(unknown), Stefano Leonardi, Okke Schrijvers, (unknown)	5
11	Proceedings of the 24th International Conference on World Wide Web 2015 ·Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi	152
12	Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects 2015 ·Adaptive Agents and Multi-Agents Systems ·Aris Anagnostopoulos, Diodato Ferraioli, Stefano Leonardi	3
13	Approximately Efficient Double Auctions with Strong Budget Balance 2015 ·Research Portal (King's College London) ·(unknown), Bart de Keijzer, Stefano Leonardi, (unknown)	13
14	A mazing 2+ε approximation for unsplittable flow on a path 2014 ·Symposium on Discrete Algorithms ·Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese	8
15	On multiple keyword sponsored search auctions with budgets 2012 ·Lecture notes in computer science ·(unknown), (unknown), Stefano Leonardi, (unknown)	2
16	Internet and network economics : 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009 : proceedings 2009 ·Springer eBooks ·Stefano Leonardi	2
17	An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem 2007 ·Symposium on Discrete Algorithms ·Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer	15
18	A group-strategyproof mechanism for Steiner forests 2005 ·Symposium on Discrete Algorithms ·Jochen Könemann, Stefano Leonardi, Guido Schäfer	25
19	Algorithms -- ESA 2005 : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings 2005 ·Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) ·Gerth Stølting Brodal, Stefano Leonardi	2
20	On-line randomized call control revisited 1998 ·Symposium on Discrete Algorithms ·Stefano Leonardi, Alberto Marchetti-Spaccamela, (unknown), Adi Rosén	16

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact