Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Leonardi 0001
Person information
- affiliation (PhD 1996): Sapienza University of Rome, Department of Computer, Control and Management Engineering, Italy
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Stefano Leonardi — disambiguation page
- Stefano Leonardi 0002 — University of Texas at Dallas, Richardson, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j62]Giorgio Barnabò, Federico Siciliano
, Carlos Castillo, Stefano Leonardi, Preslav Nakov, Giovanni Da San Martino, Fabrizio Silvestri:
Deep active learning for misinformation detection using geometric deep learning. Online Soc. Networks Media 33: 100244 (2023)- [i40]Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo:
Fully Dynamic Online Selection through Online Contention Resolution Schemes. CoRR abs/2301.03099 (2023) - [i39]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. CoRR abs/2301.13652 (2023) - [i38]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - 2022
- [j61]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online revenue maximization for server pricing. Auton. Agents Multi Agent Syst. 36(1): 11 (2022) - [j60]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. J. Artif. Intell. Res. 74: 661-690 (2022) - [c103]Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi:
Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective. IJCAI 2022: 95-101 - [c102]Giorgio Barnabò, Federico Siciliano, Carlos Castillo, Stefano Leonardi, Preslav Nakov, Giovanni Da San Martino, Fabrizio Silvestri:
FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection. IJCNN 2022: 1-8 - [c101]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. SODA 2022: 252-274 - [c100]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - [e13]Stefano Leonardi, Anupam Gupta:
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. ACM 2022, ISBN 978-1-4503-9264-8 [contents] - [i37]Marianna Maranghi, Aris Anagnostopoulos, Irene Cannistraci, Ioannis Chatzigiannakis, Federico Croce, Giulia Di Teodoro, Michele Gentili, Giorgio Grani, Maurizio Lenzerini, Stefano Leonardi, Andrea Mastropietro, Laura Palagi, Massimiliano Pappa, Riccardo Rosati, Riccardo Valentini, Paola Velardi:
AI-based Data Preparation and Data Analytics in Healthcare: The Case of Diabetes. CoRR abs/2206.06182 (2022) - [i36]Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis:
Prophet Inequalities via the Expected Competitive Ratio. CoRR abs/2207.03361 (2022) - [i35]Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. CoRR abs/2211.02004 (2022) - 2021
- [j59]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. Algorithmica 83(5): 1222-1237 (2021) - [j58]Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn:
Algorithms for fair k-clustering with multiple protected attributes. Oper. Res. Lett. 49(5): 787-789 (2021) - [c99]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ICML 2021: 231-242 - [c98]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. EC 2021: 289-309 - [c97]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow time scheduling with uncertain processing time. STOC 2021: 1070-1080 - [c96]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient two-sided markets with limited information. STOC 2021: 1452-1465 - [c95]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. WINE 2021: 149-166 - [c94]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic bandits for multi-platform budget optimization in online advertising. WWW 2021: 2805-2817 - [i34]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. CoRR abs/2102.08327 (2021) - [i33]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. CoRR abs/2102.08754 (2021) - [i32]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow Time Scheduling with Uncertain Processing Time. CoRR abs/2103.05604 (2021) - [i31]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. CoRR abs/2103.10246 (2021) - [i30]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Prophet Inequalities for Matching with a Single Sample. CoRR abs/2104.02050 (2021) - [i29]Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi:
Learning Fair Equilibria in Sponsored Search Auctions. CoRR abs/2107.08271 (2021) - [i28]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. CoRR abs/2109.08424 (2021) - [i27]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. CoRR abs/2109.08644 (2021) - [i26]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. CoRR abs/2109.12974 (2021) - [i25]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - 2020
- [j57]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
FUN editorial. Theor. Comput. Sci. 842: 131 (2020) - [j56]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Prior-free multi-unit auctions with ordered bidders. Theor. Comput. Sci. 846: 160-171 (2020) - [j55]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. ACM Trans. Economics and Comput. 8(1): 4:1-4:29 (2020) - [c93]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. IJCAI 2020: 4106-4112 - [c92]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. NeurIPS 2020 - [c91]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. EC 2020: 439-458 - [c90]Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka:
Envy, Regret, and Social Welfare Loss. WWW 2020: 2913-2919 - [i24]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. CoRR abs/2002.06968 (2020) - [i23]Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi:
Algorithms for Hiring and Outsourcing in the Online Labor Market. CoRR abs/2002.07618 (2020) - [i22]Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Fair Clustering with Multiple Colors. CoRR abs/2002.07892 (2020) - [i21]Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Algorithms for Fair Team Formation in Online Labour Marketplaces. CoRR abs/2002.11621 (2020) - [i20]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient Two-Sided Markets with Limited Information. CoRR abs/2003.07503 (2020) - [i19]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2007.05014 (2020)
2010 – 2019
- 2019
- [j54]George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. Theory Comput. Syst. 63(1): 4-25 (2019) - [c89]Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki:
Stochastic Graph Exploration. ICALP 2019: 136:1-136:14 - [c88]Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon:
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA 2019: 1886-1898 - [c87]Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Algorithms for Fair Team Formation in Online Labour Marketplaces✱. WWW (Companion Volume) 2019: 484-490 - [e12]Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi:
46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. LIPIcs 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-109-2 [contents] - [i18]Aris Anagnostopoulos, Luca Becchetti, Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn:
Principal Fairness: \\ Removing Bias via Projections. CoRR abs/1905.13651 (2019) - [i17]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. CoRR abs/1906.09880 (2019) - [i16]Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka:
Envy, Regret, and Social Welfare Loss. CoRR abs/1907.07721 (2019) - 2018
- [j53]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14(4): 55:1-55:23 (2018) - [c86]Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi:
Algorithms for Hiring and Outsourcing in the Online Labor Market. KDD 2018: 1109-1118 - [p3]Giorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Prize Collecting Traveling Salesman and Related Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 611-628 - [e11]Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe:
9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy. LIPIcs 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-067-5 [contents] - 2017
- [j52]Artur Czumaj, Stefano Leonardi:
Report on HALG 2016/2017. Bull. EATCS 123 (2017) - [j51]Artur Czumaj, Stefano Leonardi:
HALG: Highlights of Algorithms. SIGACT News 48(3): 83-86 (2017) - [j50]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted-Price Mechanisms with Correlated Valuations. ACM Trans. Economics and Comput. 5(4): 22:1-22:39 (2017) - [c85]Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP 2017: 35:1-35:15 - [c84]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. IPCO 2017: 368-379 - [c83]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. EC 2017: 591-608 - [c82]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Fixed Price Approximability of the Optimal Gain from Trade. WINE 2017: 146-160 - [i15]Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk:
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR abs/1707.01702 (2017) - [i14]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Fixed Price Approximability of the Optimal Gain From Trade. CoRR abs/1710.08394 (2017) - 2016
- [j49]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski:
Online Network Design with Outliers. Algorithmica 76(1): 88-109 (2016) - [j48]Silvio Lattanzi, Stefano Leonardi:
Efficient computation of the Weighted Clustering Coefficient. Internet Math. 12(6): 381-401 (2016) - [c81]Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme:
Reservation Exchange Markets for Internet Advertising. ICALP 2016: 142:1-142:13 - [c80]Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian:
Community Detection on Evolving Graphs. NIPS 2016: 3522-3530 - [c79]George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. SAGT 2016: 327-339 - [c78]Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, Stefano Leonardi:
Lottery Pricing Equilibria. EC 2016: 401-418 - [c77]Noor Aldeen Alawad, Aris Anagnostopoulos, Stefano Leonardi, Ida Mele, Fabrizio Silvestri:
Network-Aware Recommendations of Novel Tweets. SIGIR 2016: 913-916 - [c76]Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta:
Approximately Efficient Double Auctions with Strong Budget Balance. SODA 2016: 1424-1443 - [c75]Aris Anagnostopoulos, Ruggiero Cavallo, Stefano Leonardi, Maxim Sviridenko:
Bidding Strategies for Fantasy-Sports Auctions. WINE 2016: 102-115 - [c74]Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang:
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets. WINE 2016: 207-220 - [r3]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2016: 766-768 - [i13]Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang:
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets. CoRR abs/1610.09221 (2016) - [i12]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. CoRR abs/1611.05342 (2016) - [i11]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. CoRR abs/1612.03150 (2016) - 2015
- [j47]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152(1-2): 147-188 (2015) - [j46]Riccardo Colini-Baldeschi, Stefano Leonardi, Monika Henzinger, Martin Starnberger:
On Multiple Keyword Sponsored Search Auctions with Budgets. ACM Trans. Economics and Comput. 4(1): 2:1-2:34 (2015) - [j45]Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele, Piotr Sankowski:
Stochastic Query Covering for Fast Approximate Document Retrieval. ACM Trans. Inf. Syst. 33(3): 11:1-11:35 (2015) - [c73]Aris Anagnostopoulos, Diodato Ferraioli, Stefano Leonardi:
Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects. AAMAS 2015: 1767-1768 - [c72]Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn:
Robust Hierarchical k-Center Clustering. ITCS 2015: 211-218 - [c71]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. WINE 2015: 1-15 - [e10]Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi:
Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015. ACM 2015, ISBN 978-1-4503-3469-3 [contents] - [e9]Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi:
Proceedings of the 24th International Conference on World Wide Web Companion, WWW 2015, Florence, Italy, May 18-22, 2015 - Companion Volume. ACM 2015, ISBN 978-1-4503-3473-0 [contents] - [i10]Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi:
Sequential Posted Price Mechanisms with Correlated Valuations. CoRR abs/1503.02200 (2015) - 2014
- [j44]Paolo Boldi, Stefano Leonardi, Cecilia Mascolo, Michalis Vazirgiannis:
Web and Social Graph Mining. IEEE Internet Comput. 18(5): 9-10 (2014) - [j43]Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre:
Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. 43(4): 1263-1290 (2014) - [c70]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. SODA 2014: 26-41 - [c69]Silvio Lattanzi, Stefano Leonardi:
Efficient Computation of the Weighted Clustering Coefficient. WAW 2014: 34-46 - [c68]Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang:
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets. WINE 2014: 233-246 - [c67]Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni:
Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. WWW 2014: 349-360 - 2013
- [j42]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013) - [j41]Camil Demetrescu, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Preface. Theor. Comput. Sci. 514: 1 (2013) - [c66]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. IPCO 2013: 25-36 - [c65]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Near-optimal multi-unit auctions with ordered bidders. EC 2013: 91-102 - [p2]Vincenzo Bonifaci, Stefano Leonardi:
Algorithms for Auctions and Games. The Power of Algorithms 2013: 207-234 - [e8]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis:
Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013. ACM 2013, ISBN 978-1-4503-1869-3 [contents] - 2012
- [j40]Alexander Kesselman, Stefano Leonardi:
Game-theoretic analysis of Internet switching with selfish users. Theor. Comput. Sci. 452: 107-116 (2012) - [c64]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski:
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360 - [c63]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger:
On Multiple Keyword Sponsored Search Auctions with Budgets. ICALP (2) 2012: 1-12 - [c62]Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski:
Revenue maximizing envy-free multi-unit auctions with budgets. EC 2012: 532-549 - [c61]Stefano Leonardi, Tim Roughgarden:
Prior-free auctions with ordered bidders. STOC 2012: 427-434 - [c60]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi:
Online team formation in social networks. WWW 2012: 839-848 - [i9]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+eps Approximation for Unsplittable Flow on a Path. CoRR abs/1211.2670 (2012) - [i8]Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden:
Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012) - 2011
- [c59]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40 - [c58]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Single valued combinatorial auctions with budgets. EC 2011: 223-232 - [c57]Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski:
Stochastic query covering. WSDM 2011: 725-734 - [i7]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011) - [i6]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger:
On Multiple Round Sponsored Search Auctions with Budgets. CoRR abs/1112.6361 (2011) - 2010
- [j39]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer:
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010) - [j38]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén:
Fully decentralized computation of aggregates over data streams. SIGKDD Explor. 12(2): 83-91 (2010) - [c56]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi:
Power in unity: forming teams in large-scale community systems. CIKM 2010: 599-608 - [c55]