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
- 2024
[j64]Michal Feldman, Federico Fusco
, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. Algorithmica 86(5): 1600-1622 (2024)- [i44]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Algorithmically Fair Maximization of Multiple Submodular Objective Functions. CoRR abs/2402.15155 (2024) - [i43]Tomer Ezra, Stefano Leonardi, Matteo Russo:
Contracts with Inspections. CoRR abs/2402.16553 (2024) - 2023
- [j63]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. Math. Oper. Res. 48(1): 498-519 (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) - [c107]Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo:
Fully Dynamic Online Selection through Online Contention Resolution Schemes. AAAI 2023: 6693-6700 - [c106]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - [c105]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. EC 2023: 67-87 - [c104]Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis:
Prophet Inequalities via the Expected Competitive Ratio. WINE 2023: 272-289 - [i42]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) - [i41]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) - [i40]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - [i39]Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo:
Fair Division with Interdependent Values. CoRR abs/2305.14096 (2023) - [i38]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. CoRR abs/2307.09478 (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]Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski:
Online Network Design with Outliers. ICALP (1) 2010: 114-126 - [c54]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén:
Fully decentralized computation of aggregates over data streams. StreamKDD@KDD 2010: 1-9 - [c53]Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre:
Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010: 573-584 - [e7]Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer:
Flexible Network Design, 24.05. - 28.05.2010. Dagstuhl Seminar Proceedings 10211, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i5]Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer:
10211 Abstracts Collection - Flexible Network Design. Flexible Network Design 2010 - [i4]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Combinatorial Auctions with Budgets. CoRR abs/1001.1686 (2010)
2000 – 2009
- 2009
- [e6]Stefano Leonardi:
Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings. Lecture Notes in Computer Science 5929, Springer 2009, ISBN 978-3-642-10840-2 [contents] - 2008
- [j37]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam:
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008) - [j36]Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-Yates, Stefano Leonardi:
Link analysis for Web spam detection. ACM Trans. Web 2(1): 2:1-2:42 (2008) - [c52]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with our Eyes Closed. FOCS 2008: 347-356 - [c51]Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi:
Mining Large Networks with Subgraph Counting. ICDM 2008: 737-742 - [c50]Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski:
Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951 - [r2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2008 - 2007
- [j35]Debora Donato, Stefano Leonardi, Panayiotis Tsaparas:
Stability and Similarity of Link Analysis Ranking Algorithms. Internet Math. 3(4): 479-507 (2007) - [j34]Stefano Leonardi, Danny Raz:
Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73(6): 875-891 (2007) - [j33]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007) - [j32]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Trans. Algorithms 3(2): 23 (2007) - [j31]Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi:
The Web as a graph: How far we are. ACM Trans. Internet Techn. 7(1): 4 (2007) - [c49]Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, Stefano Leonardi:
New Metrics for Reputation Management in P2P Networks. AIRWeb 2007: 65-72 - [c48]Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi:
Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509 - [c47]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler:
Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632 - [c46]Stefano Leonardi, Piotr Sankowski:
Network formation games with local coalitions. PODC 2007: 299-305 - [c45]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162 - [r1]Alberto Marchetti-Spaccamela, Vincenzo Bonifaci, Stefano Leonardi, Giorgio Ausiello:
Prize-Collecting Traveling Salesman and Related Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j30]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006) - [j29]Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. 10(2): 219-236 (2006) - [j28]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31(1): 85-108 (2006) - [j27]Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo:
Design of trees in the hose model: The balanced case. Oper. Res. Lett. 34(6): 601-606 (2006) - [j26]Yair Bartal, Amos Fiat, Stefano Leonardi:
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. SIAM J. Comput. 36(2): 354-393 (2006) - [j25]Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna:
A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) - [c44]Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Ricardo A. Baeza-Yates:
Link-Based Characterization and Detection of Web Spam. AIRWeb 2006: 1-8 - [c43]Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters:
On the Value of Preemption in Scheduling. APPROX-RANDOM 2006: 39-48 - [c42]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446 - [c41]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler:
Counting triangles in data streams. PODS 2006: 253-262 - [c40]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer:
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC 2006: 663-670 - [c39]Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, Stefano Millozzi:
Temporal Analysis of the Wikigraph. Web Intelligence 2006: 45-51 - [p1]Stefano Leonardi:
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. Efficient Approximation and Online Algorithms 2006: 203-212 - [e5]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Dagstuhl Seminar Proceedings 05361, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i3]Andrea Capocci, Vito Domenico Pietro Servedio, Francesca Colaiori, Luciana S. Buriol, Debora Donato, Stefano Leonardi, Guido Caldarelli:
Preferential attachment in the growth of social networks: the case of Wikipedia. CoRR abs/physics/0602026 (2006) - 2005
- [j24]Dimitris Achlioptas, Stefano Leonardi:
Special Issue on Algorithms and Models for the Web-Graph. Internet Math. 2(3): 249 (2005) - [j23]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal:
Parallel scheduling problems in next generation wireless networks. Networks 45(1): 9-22 (2005) - [c38]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel:
The Self-Star Vision. Self-star Properties in Complex Information Systems 2005: 1-20 - [c37]Debora Donato, Stefano Leonardi, Panayiotis Tsaparas:
Stability and Similarity of Link Analysis Ranking Algorithms. ICALP 2005: 717-729 - [c36]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam:
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942 - [c35]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384 - [c34]Jochen Könemann, Stefano Leonardi, Guido Schäfer:
A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619 - [c33]Debora Donato, Stefano Leonardi, Stefano Millozzi, Panayiotis Tsaparas:
Mining the inner structure of the Web graph. WebDB 2005: 145-150 - [c32]Alexander Kesselman, Stefano Leonardi, Vincenzo Bonifaci:
Game-Theoretic Analysis of Internet Switching with Selfish Users. WINE 2005: 236-245 - [e4]Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel, Maarten van Steen:
Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004]. Lecture Notes in Computer Science 3460, Springer 2005, ISBN 3-540-26009-9 [contents] - [e3]Gerth Stølting Brodal, Stefano Leonardi:
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3669, Springer 2005, ISBN 3-540-29118-0 [contents] - [i2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information 2005 - [i1]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. Algorithmic Aspects of Large and Complex Networks 2005 - 2004
- [j22]Stefano Leonardi:
Preface. Algorithmica 40(4): 217 (2004) - [j21]Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi:
Simulating the Webgraph: a comparative analysis of models. Comput. Sci. Eng. 6(6): 84-89 (2004) - [j20]Luca Becchetti, Stefano Leonardi:
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4): 517-539 (2004) - [j19]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Average stretch without migration. J. Comput. Syst. Sci. 68(1): 80-95 (2004) - [j18]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004) - [j17]Stefano Leonardi, Guido Schäfer:
Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004) - [c31]Stefano Leonardi, Guido Schäfer:
Cross-monotonic cost-sharing methods for connected facility location games. EC 2004: 242-243 - [c30]Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide:
Scheduling against an adversarial network. SPAA 2004: 151-159 - [e2]Stefano Leonardi:
Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings. Lecture Notes in Computer Science 3243, Springer 2004, ISBN 3-540-23427-6 [contents] - 2003
- [j16]Monika Rauch Henzinger, Stefano Leonardi:
Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66(3): 567-611 (2003) - [c29]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant Scheduling. ESA 2003: 67-77 - [c28]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. ESA 2003: 703-714 - [c27]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471 - [c26]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer:
Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223 - 2002
- [j15]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002) - [c25]Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti:
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. ALENEX 2002: 71-85 - [c24]Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti:
Parallel scheduling problems in next generation wireless networks. SPAA 2002: 238-247 - [c23]Luigi Laura, Stefano Leonardi, Guido Caldarelli, Paolo De Los Rios:
A Multi-Layer Model for the Web Graph. WebDyn@WWW 2002: 25-34 - [e1]Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani:
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2462, Springer 2002, ISBN 3-540-44186-7 [contents] - 2001
- [j14]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Algorithms for the On-Line Travelling Salesman. Algorithmica 29(4): 560-581 (2001) - [j13]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks. Algorithmica 31(1): 29-43 (2001) - [j12]Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén:
On-line Randomized Call Control Revisited . SIAM J. Comput. 31(1): 86-112 (2001) - [j11]Stefano Leonardi, Alberto Marchetti-Spaccamela:
Preface. Theor. Comput. Sci. 268(1): 1 (2001) - [c22]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47 - [c21]Luca Becchetti, Stefano Leonardi:
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001: 94-103 - 2000
- [j10]Susanne Albers, Naveen Garg, Stefano Leonardi:
Minimizing stall time in single and parallel disk systems. J. ACM 47(6): 969-986 (2000) - [j9]Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie:
Multiprocessor Scheduling with Rejection. SIAM J. Discret. Math. 13(1): 64-78 (2000) - [c20]Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela:
On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000: 1-16 - [c19]Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti:
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000: 409-420 - [c18]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Scheduling to minimize average stretch without migration. SODA 2000: 548-557
1990 – 1999
- 1999
- [j8]Stefano Leonardi, Alberto Marchetti-Spaccamela:
On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24(1): 29-49 (1999) - [j7]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. Algorithmica 25(1): 22-36 (1999) - [j6]Susanne Albers, Stefano Leonardi:
On-line Algorithms. ACM Comput. Surv. 31(3es): 4 (1999) - [j5]Yair Bartal, Stefano Leonardi:
On-Line Routing in All-Optical Networks. Theor. Comput. Sci. 221(1-2): 19-39 (1999) - [c17]Monika Rauch Henzinger, Stefano Leonardi:
Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999: 438-447 - [c16]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - 1998
- [j4]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings. Inf. Process. Lett. 66(4): 175-180 (1998) - [c15]Stefano Leonardi, Andrea Vitaletti:
Randomized Lower Bounds for Online Path Coloring. RANDOM 1998: 232-247 - [c14]Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén:
On-line Randomized Call Control Revisited. SODA 1998: 323-332 - [c13]Susanne Albers, Naveen Garg, Stefano Leonardi:
Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998: 454-462 - 1997
- [j3]Maurizio A. Bonuccelli, Stefano Leonardi:
On scheduling variable length broadcasts in wireless networks. Telecommun. Syst. 8(2-4): 211-227 (1997) - [c12]Yair Bartal, Stefano Leonardi:
On-Line Routing in All-Optical Networks. ICALP 1997: 516-526 - [c11]Stefano Leonardi, Danny Raz:
Approximating Total Flow Time on Parallel Machines. STOC 1997: 110-119 - 1996
- [j2]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. RAIRO Theor. Informatics Appl. 30(4): 305-318 (1996) - [j1]Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer:
Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21(3): 520-541 (1996) - [c10]Stefano Leonardi:
On-line Network Routing. Online Algorithms 1996: 242-267 - [c9]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-line Competive Algorithms for Call Admission in Optical Networks. ESA 1996: 431-444 - [c8]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. ICALP 1996: 429-441 - [c7]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings (Abstract). PODC 1996: 154 - [c6]Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie:
Multiprocessor Scheduling with Rejection. SODA 1996: 95-103 - [c5]Yair Bartal, Amos Fiat, Stefano Leonardi:
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. STOC 1996: 531-540 - 1995
- [c4]Stefano Leonardi, Alberto Marchetti-Spaccamela:
On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995: 303-314 - [c3]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Competitive Algorithms for the On-line Traveling Salesman. WADS 1995: 206-217 - 1994
- [c2]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Serving Requests with On-line Routing. SWAT 1994: 37-48 - 1993
- [c1]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer:
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
