Stefano Leonardi

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
100Single valued combinatorial auctions with budgets. Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski. ACM Conference on Electronic Commerce 2011, 223-232. Web SearchBibTeXDownload
99Approximation Algorithms for Union and Intersection Covering Problems. Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski. CoRR (abs/1102.5105) (2011). Web SearchBibTeXDownload
98On Multiple Round Sponsored Search Auctions with Budgets. Riccardo Colini Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger. CoRR (abs/1112.6361) (2011). Web SearchBibTeXDownload
97Multi-Unit Auction with Diminishing Marginal Valuations and Capacities. Riccardo Colini Baldeschi, Stefano Leonardi, Guido Schäfer. CoRR (abs/1108.6033) (2011). Web SearchBibTeXDownload
96Stochastic query covering. Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski. WSDM 2011, 725-734. Web SearchBibTeXDownload
2010
95Power in unity: forming teams in large-scale community systems. Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi. CIKM 2010, 599-608. Web SearchBibTeXDownload
94Combinatorial Auctions with Budgets. Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski. CoRR (abs/1001.1686) (2010). Web SearchBibTeXDownload
93Online Network Design with Outliers. Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski. ICALP (1) 2010, 114-126. Web SearchBibTeXDownload
92Strict Cost Sharing Schemes for Steiner Forest. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer. SIAM J. Comput. (39): 3616-3632 (2010). Web SearchBibTeXDownload
91Fully decentralized computation of aggregates over data streams. Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén. SIGKDD Explorations (12): 83-91 (2010). Web SearchBibTeXDownload
90Utilitarian Mechanism Design for Multi-Objective Optimization. Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre. SODA 2010, 573-584. Web SearchBibTeXDownload
2008
89Flow Time Minimization. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
88Set Covering with our Eyes Closed. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh. FOCS 2008, 347-356. Web SearchBibTeXDownload
87Mining Large Networks with Subgraph Counting. Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi. ICDM 2008, 737-742. Cited by 3Web SearchBibTeXDownload
86A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam. SIAM J. Comput. (37): 1319-1341 (2008). Web SearchBibTeXDownload
85Stochastic analyses for online combinatorial optimization problems. Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski. SODA 2008, 942-951. Web SearchBibTeXDownload
84Link analysis for Web spam detection. Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, Stefano Leonardi. TWEB (2) (2008). Cited by 10Web SearchBibTeXDownload
2007
83Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
82The Web as a graph: How far we are. Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi. ACM Trans. Internet Techn. (7) (2007). Web SearchBibTeXDownload
81New Metrics for Reputation Management in P2P Networks. Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, Stefano Leonardi. AIRWeb 2007. Web SearchBibTeXDownload
80Estimating Clustering Indexes in Data Streams. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler. ESA 2007, 618-632. Web SearchBibTeXDownload
79Pricing Tree Access Networks with Connected Backbones. Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi. ESA 2007, 498-509. Web SearchBibTeXDownload
78Stability and Similarity of Link Analysis Ranking Algorithms. Debora Donato, Stefano Leonardi, Panayiotis Tsaparas. Internet Mathematics (3): 479-507 (2007). Web SearchBibTeX
77Approximating total flow time on parallel machines. Stefano Leonardi, Danny Raz. J. Comput. Syst. Sci. (73): 875-891 (2007). Web SearchBibTeXDownload
76Cut problems in graphs with a budget constraint. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor. J. Discrete Algorithms (5): 262-279 (2007). Web SearchBibTeXDownload
75Network formation games with local coalitions. Stefano Leonardi, Piotr Sankowski. PODC 2007, 299-305. Web SearchBibTeXDownload
74An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer. SODA 2007, 1153-1162. Web SearchBibTeXDownload
2006
73Link-Based Characterization and Detection of Web Spam. Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Ricardo A. Baeza-Yates. AIRWeb 2006, 1-8. Cited by 44Web SearchBibTeXDownload
72On the Value of Preemption in Scheduling. Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters. APPROX-RANDOM 2006, 39-48. Web SearchBibTeXDownload
71Preferential attachment in the growth of social networks: the case of Wikipedia. Andrea Capocci, Vito Domenico Pietro Servedio, Francesca Colaiori, Luciana S. Buriol, Debora Donato, Stefano Leonardi, Guido Caldarelli. CoRR (abs/physics/0602026) (2006). Web SearchBibTeXDownload
70Online weighted flow time and deadline scheduling. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. J. Discrete Algorithms (4): 339-352 (2006). Web SearchBibTeXDownload
69Algorithms and Experiments for the Webgraph. Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn. J. Graph Algorithms Appl. (10): 219-236 (2006). Web SearchBibTeXDownload
68Cut Problems in Graphs with a Budget Constraint. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor. LATIN 2006, 435-446. Web SearchBibTeXDownload
67Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. Math. Oper. Res. (31): 85-108 (2006). Web SearchBibTeXDownload
66Design of trees in the hose model: The balanced case. Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo. Oper. Res. Lett. (34): 601-606 (2006). Web SearchBibTeXDownload
65Counting triangles in data streams. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler. PODS 2006, 253-262. Web SearchBibTeXDownload
64Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. Yair Bartal, Amos Fiat, Stefano Leonardi. SIAM J. Comput. (36): 354-393 (2006). Web SearchBibTeXDownload
63A reference collection for web spam. Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna. SIGIR Forum (40): 11-24 (2006). Web SearchBibTeXDownload
62Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer. STOC 2006, 663-670. Web SearchBibTeXDownload
61Temporal Analysis of the Wikigraph. Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, Stefano Millozzi. Web Intelligence 2006, 45-51. Web SearchBibTeXDownload
2005
6005361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner. Algorithmic Aspects of Large and Complex Networks 2005. Web SearchBibTeXDownload
59Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. Algorithms for Optimization with Incomplete Information 2005. Web SearchBibTeXDownload
58Stability and Similarity of Link Analysis Ranking Algorithms. Debora Donato, Stefano Leonardi, Panayiotis Tsaparas. ICALP 2005, 717-729. Web SearchBibTeXDownload
57From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam. ICALP 2005, 930-942. Web SearchBibTeXDownload
56Special Issue on Algorithms and Models for the Web-Graph. Dimitris Achlioptas, Stefano Leonardi. Internet Mathematics (2) (2005). Web SearchBibTeX
55Parallel scheduling problems in next generation wireless networks. Luca Becchetti, Suhas N. Diggavi, Alberto Marchetti-Spaccamela, Alberto Marchetti-Spaccamela, Suhas N. Diggavi, Thyagarajan Nandagopal, Thyagarajan Nandagopal. Networks (45): 9-22 (2005). Cited by 7Web SearchBibTeXDownload
54The Self-Star Vision. Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel. Self-star Properties in Complex Information Systems 2005, 1-20. Web SearchBibTeXDownload
53Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál. SODA 2005, 375-384. Web SearchBibTeXDownload
52A group-strategyproof mechanism for Steiner forests. Jochen Könemann, Stefano Leonardi, Guido Schäfer. SODA 2005, 612-619. Web SearchBibTeXDownload
51Mining the inner structure of the Web graph. Debora Donato, Stefano Leonardi, Stefano Millozzi, Panayiotis Tsaparas. WebDB 2005, 145-150. Web SearchBibTeX
50Game-Theoretic Analysis of Internet Switching with Selfish Users. Alexander Kesselman, Stefano Leonardi, Vincenzo Bonifaci. WINE 2005, 236-245. Web SearchBibTeXDownload
2004
49Cross-monotonic cost-sharing methods for connected facility location games. Stefano Leonardi, Guido Schäfer. ACM Conference on Electronic Commerce 2004, 242-243. Web SearchBibTeXDownload
48Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. Luca Becchetti, Stefano Leonardi. J. ACM (51): 517-539 (2004). Web SearchBibTeXDownload
47Average stretch without migration. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan. J. Comput. Syst. Sci. (68): 80-95 (2004). Cited by 28Web SearchBibTeXDownload
46Scheduling against an adversarial network. Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide. SPAA 2004, 151-159. Web SearchBibTeXDownload
45Semi-clairvoyant scheduling. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. Theor. Comput. Sci. (324): 325-335 (2004). Web SearchBibTeXDownload
44Cross-monotonic cost sharing methods for connected facility location games. Stefano Leonardi, Guido Schäfer. Theor. Comput. Sci. (326): 431-442 (2004). Web SearchBibTeXDownload
2003
43Semi-clairvoyant Scheduling. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. ESA 2003, 67-77. Web SearchBibTeXDownload
42Algorithms and Experiments for the Webgraph. Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn. ESA 2003, 703-714. Web SearchBibTeXDownload
41Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld. FOCS 2003, 462-471. Web SearchBibTeXDownload
40Scheduling to Minimize Flow Time Metrics. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer. IPDPS 2003, 223. Web SearchBibTeXDownload
39Scheduling multicasts on unit-capacity trees and meshes. Monika Rauch Henzinger, Stefano Leonardi. J. Comput. Syst. Sci. (66): 567-611 (2003). Cited by 6Web SearchBibTeXDownload
2002
38An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti. ALENEX 2002, 71-85. Web SearchBibTeXDownload
37Minimizing the Flow Time Without Migration. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev. SIAM J. Comput. (31): 1370-1382 (2002). Web SearchBibTeXDownload
36Parallel scheduling problems in next generation wireless networks. Luca Becchetti, Suhas N. Diggavi, Alberto Marchetti-Spaccamela, Alberto Marchetti-Spaccamela, Suhas N. Diggavi, Thyagarajan Nandagopal, Thyagarajan Nandagopal. SPAA 2002, 238-247. Cited by 7Web SearchBibTeXDownload
2001
35On-Line Competitive Algorithms for Call Admission in Optical Networks. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. Algorithmica (31): 29-43 (2001). Web SearchBibTeXDownload
34Algorithms for the On-Line Travelling Salesman. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. Algorithmica (29): 560-581 (2001). Web SearchBibTeXDownload
33Online Weighted Flow Time and Deadline Scheduling. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. RANDOM-APPROX 2001, 36-47. Web SearchBibTeXDownload
32On-line Randomized Call Control Revisited . Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén. SIAM J. Comput. (31): 86-112 (2001). Web SearchBibTeXDownload
31Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. Luca Becchetti, Stefano Leonardi. STOC 2001, 94-103. Web SearchBibTeXDownload
2000
30On Salesmen, Repairmen, Spiders, and Other Traveling Agents. Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela. CIAC 2000, 1-16. Web SearchBibTeXDownload
29Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti. FSTTCS 2000, 409-420. Web SearchBibTeXDownload
28Minimizing stall time in single and parallel disk systems. Susanne Albers, Naveen Garg, Stefano Leonardi. J. ACM (47): 969-986 (2000). Web SearchBibTeXDownload
27Multiprocessor Scheduling with Rejection. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie. SIAM J. Discrete Math. (13): 64-78 (2000). Web SearchBibTeXDownload
26Scheduling to minimize average stretch without migration. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan. SODA 2000, 548-557. Web SearchBibTeXDownload
1999
25On-line Algorithms. Susanne Albers, Stefano Leonardi. ACM Comput. Surv. (31): 4 (1999). Web SearchBibTeXDownload
24On-Line Resource Management with Application to Routing and Scheduling. Stefano Leonardi, Alberto Marchetti-Spaccamela. Algorithmica (24): 29-49 (1999). Web SearchBibTeXDownload
23On Capital Investment. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén. Algorithmica (25): 22-36 (1999). Web SearchBibTeXDownload
22Scheduling Multicasts on Unit-Capacity Trees and Meshes. Monika Rauch Henzinger, Stefano Leonardi. SODA 1999, 438-447. Web SearchBibTeXDownload
21Minimizing the Flow Time Without Migration. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev. STOC 1999, 198-205. Web SearchBibTeXDownload
20On-Line Routing in All-Optical Networks. Yair Bartal, Stefano Leonardi. Theor. Comput. Sci. (221): 19-39 (1999). Web SearchBibTeXDownload
1998
19Efficient Token-Based Control in Rings. Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro. Inf. Process. Lett. (66): 175-180 (1998). Web SearchBibTeXDownload
18Randomized Lower Bounds for Online Path Coloring. Stefano Leonardi, Andrea Vitaletti. RANDOM 1998, 232-247. Web SearchBibTeXDownload
17On-line Randomized Call Control Revisited. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén. SODA 1998, 323-332. Web SearchBibTeXDownload
16Minimizing Stall Time in Single and Parallel Disk Systems. Susanne Albers, Naveen Garg, Stefano Leonardi. STOC 1998, 454-462. Web SearchBibTeXDownload
1997
15On-Line Routing in All-Optical Networks. Yair Bartal, Stefano Leonardi. ICALP 1997, 516-526. Web SearchBibTeXDownload
14Approximating Total Flow Time on Parallel Machines. Stefano Leonardi, Danny Raz. STOC 1997, 110-119. Web SearchBibTeXDownload
13On scheduling variable length broadcasts in wireless networks. Maurizio A. Bonuccelli, Stefano Leonardi. Telecommunication Systems (8): 211-227 (1997). Web SearchBibTeXDownload
1996
12On-line Competive Algorithms for Call Admission in Optical Networks. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. ESA 1996, 431-444. Web SearchBibTeXDownload
11On Capital Investment. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén. ICALP 1996, 429-441. Web SearchBibTeXDownload
10Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela. ITA (30): 305-318 (1996). Web SearchBibTeX
9Enclosing a Set of Objects by Two Minimum Area Rectangles. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer. J. Algorithms (21): 520-541 (1996). Web SearchBibTeXDownload
8On-line Network Routing. Stefano Leonardi. Online Algorithms 1996, 242-267. Web SearchBibTeXDownload
7Efficient Token-Based Control in Rings (Abstract). Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro. PODC 1996, 154. Web SearchBibTeX
6Multiprocessor Scheduling with Rejection. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie. SODA 1996, 95-103. Web SearchBibTeXDownload
5Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. Yair Bartal, Amos Fiat, Stefano Leonardi. STOC 1996, 531-540. Web SearchBibTeXDownload
1995
4On-line Resource Management with Applications to Routing and Scheduling. Stefano Leonardi, Alberto Marchetti-Spaccamela. ICALP 1995, 303-314. Web SearchBibTeXDownload
3Competitive Algorithms for the On-line Traveling Salesman. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. WADS 1995, 206-217. Web SearchBibTeXDownload
1994
2Serving Requests with On-line Routing. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. SWAT 1994, 37-48. Web SearchBibTeXDownload
1993
1Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer. WG 1993, 87-98. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ Untitled Document - Retrieved 2011-06-30 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research