|
Search the dblp DataBase
Stefano Leonardi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Susanne Albers, Naveen Garg, Stefano Leonardi
Minimizing Stall Time in Single and Parallel Disk Systems. [Citation Graph (1, 0)][DBLP] STOC, 1998, pp:454-462 [Conf]
- Stefano Leonardi, Danny Raz
Approximating Total Flow Time on Parallel Machines. [Citation Graph (1, 0)][DBLP] STOC, 1997, pp:110-119 [Conf]
- Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer
Enclosing a Set of Objects by Two Minimum Area Rectangles. [Citation Graph (1, 0)][DBLP] J. Algorithms, 1996, v:21, n:3, pp:520-541 [Journal]
- Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. [Citation Graph (0, 0)][DBLP] ALENEX, 2002, pp:71-85 [Conf]
- Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters
On the Value of Preemption in Scheduling. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:39-48 [Conf]
- Özalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel
The Self-Star Vision. [Citation Graph (0, 0)][DBLP] Self-star Properties in Complex Information Systems, 2005, pp:1-20 [Conf]
- Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
On Salesmen, Repairmen, Spiders, and Other Traveling Agents. [Citation Graph (0, 0)][DBLP] CIAC, 2000, pp:1-16 [Conf]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
- Stefano Leonardi
On-line Network Routing. [Citation Graph (0, 0)][DBLP] Online Algorithms, 1996, pp:242-267 [Conf]
- Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. [Citation Graph (0, 0)][DBLP] Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
Semi-clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP] ESA, 2003, pp:67-77 [Conf]
- Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
On-line Competive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP] ESA, 1996, pp:431-444 [Conf]
- Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
Algorithms and Experiments for the Webgraph. [Citation Graph (0, 0)][DBLP] ESA, 2003, pp:703-714 [Conf]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:462-471 [Conf]
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. [Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:409-420 [Conf]
- Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
On Capital Investment. [Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:429-441 [Conf]
- Yair Bartal, Stefano Leonardi
On-Line Routing in All-Optical Networks. [Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:516-526 [Conf]
- Debora Donato, Stefano Leonardi, Panayiotis Tsaparas
Stability and Similarity of Link Analysis Ranking Algorithms. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:717-729 [Conf]
- Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan van Zwam
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:930-942 [Conf]
- Stefano Leonardi, Alberto Marchetti-Spaccamela
On-line Resource Management with Applications to Routing and Scheduling. [Citation Graph (0, 0)][DBLP] ICALP, 1995, pp:303-314 [Conf]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer
Scheduling to Minimize Flow Time Metrics. [Citation Graph (0, 0)][DBLP] IPDPS, 2003, pp:223- [Conf]
- Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
Cut Problems in Graphs with a Budget Constraint. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:435-446 [Conf]
- Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
Efficient Token-Based Control in Rings (Abstract). [Citation Graph (0, 0)][DBLP] PODC, 1996, pp:154- [Conf]
- Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler
Counting triangles in data streams. [Citation Graph (0, 0)][DBLP] PODS, 2006, pp:253-262 [Conf]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
Online Weighted Flow Time and Deadline Scheduling. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:36-47 [Conf]
- Stefano Leonardi, Andrea Vitaletti
Randomized Lower Bounds for Online Path Coloring. [Citation Graph (0, 0)][DBLP] RANDOM, 1998, pp:232-247 [Conf]
- Stefano Leonardi, Guido Schäfer
Cross-monotonic cost-sharing methods for connected facility location games. [Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2004, pp:242-243 [Conf]
- Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP] SODA, 1996, pp:95-103 [Conf]
- Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:375-384 [Conf]
- Luca Becchetti, Stefano Leonardi, S. Muthukrishnan
Scheduling to minimize average stretch without migration. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:548-557 [Conf]
- Monika Rauch Henzinger, Stefano Leonardi
Scheduling Multicasts on Unit-Capacity Trees and Meshes. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:438-447 [Conf]
- Jochen Könemann, Stefano Leonardi, Guido Schäfer
A group-strategyproof mechanism for Steiner forests. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:612-619 [Conf]
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
On-line Randomized Call Control Revisited. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:323-332 [Conf]
- Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti
Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP] SPAA, 2002, pp:238-247 [Conf]
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide
Scheduling against an adversarial network. [Citation Graph (0, 0)][DBLP] SPAA, 2004, pp:151-159 [Conf]
- Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP] STOC, 1999, pp:198-205 [Conf]
- Yair Bartal, Amos Fiat, Stefano Leonardi
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:531-540 [Conf]
- Luca Becchetti, Stefano Leonardi
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:94-103 [Conf]
- Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:663-670 [Conf]
- Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Serving Requests with On-line Routing. [Citation Graph (0, 0)][DBLP] SWAT, 1994, pp:37-48 [Conf]
- Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Competitive Algorithms for the On-line Traveling Salesman. [Citation Graph (0, 0)][DBLP] WADS, 1995, pp:206-217 [Conf]
- Debora Donato, Stefano Leonardi, Stefano Millozzi, Panayiotis Tsaparas
Mining the inner structure of the Web graph. [Citation Graph (0, 0)][DBLP] WebDB, 2005, pp:145-150 [Conf]
- Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, Stefano Millozzi
Temporal Analysis of the Wikigraph. [Citation Graph (0, 0)][DBLP] Web Intelligence, 2006, pp:45-51 [Conf]
- Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. [Citation Graph (0, 0)][DBLP] WG, 1993, pp:87-98 [Conf]
- Alexander Kesselman, Stefano Leonardi, Vincenzo Bonifaci
Game-Theoretic Analysis of Internet Switching with Selfish Users. [Citation Graph (0, 0)][DBLP] WINE, 2005, pp:236-245 [Conf]
- Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
Algorithms for the On-Line Travelling Salesman. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:29, n:4, pp:560-581 [Journal]
- Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
On-Line Competitive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:29-43 [Journal]
- Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
On Capital Investment. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:25, n:1, pp:22-36 [Journal]
- Stefano Leonardi
Preface. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:4, pp:217- [Journal]
- Stefano Leonardi, Alberto Marchetti-Spaccamela
On-Line Resource Management with Application to Routing and Scheduling. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:1, pp:29-49 [Journal]
- Susanne Albers, Stefano Leonardi
On-line Algorithms. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 1999, v:31, n:3es, pp:4- [Journal]
- Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
Efficient Token-Based Control in Rings. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:4, pp:175-180 [Journal]
- Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. [Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:4, pp:305-318 [Journal]
- Susanne Albers, Naveen Garg, Stefano Leonardi
Minimizing stall time in single and parallel disk systems. [Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:6, pp:969-986 [Journal]
- Luca Becchetti, Stefano Leonardi
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. [Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:4, pp:517-539 [Journal]
- Luca Becchetti, Stefano Leonardi, S. Muthukrishnan
Average stretch without migration. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:1, pp:80-95 [Journal]
- Monika Rauch Henzinger, Stefano Leonardi
Scheduling multicasts on unit-capacity trees and meshes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:66, n:3, pp:567-611 [Journal]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
Online weighted flow time and deadline scheduling. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:3, pp:339-352 [Journal]
- Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
Cut problems in graphs with a budget constraint. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2007, v:5, n:2, pp:262-279 [Journal]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal
Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP] Networks, 2005, v:45, n:1, pp:9-22 [Journal]
- Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
Design of trees in the hose model: The balanced case. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:6, pp:601-606 [Journal]
- Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:1370-1382 [Journal]
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
On-line Randomized Call Control Revisited . [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:1, pp:86-112 [Journal]
- Yair Bartal, Amos Fiat, Stefano Leonardi
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:2, pp:354-393 [Journal]
- Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:1, pp:64-78 [Journal]
- Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna
A reference collection for web spam. [Citation Graph (0, 0)][DBLP] SIGIR Forum, 2006, v:40, n:2, pp:11-24 [Journal]
- Yair Bartal, Stefano Leonardi
On-Line Routing in All-Optical Networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:19-39 [Journal]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
Semi-clairvoyant scheduling. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:324, n:2-3, pp:325-335 [Journal]
- Stefano Leonardi, Alberto Marchetti-Spaccamela
Preface. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:268, n:1, pp:1- [Journal]
- Stefano Leonardi, Guido Schäfer
Cross-monotonic cost sharing methods for connected facility location games. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:326, n:1-3, pp:431-442 [Journal]
- Maurizio A. Bonuccelli, Stefano Leonardi
On scheduling variable length broadcasts in wireless networks. [Citation Graph (0, 0)][DBLP] Telecommunication Systems, 1997, v:8, n:2-4, pp:211-227 [Journal]
- Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi
The Web as a graph: How far we are. [Citation Graph (0, 0)][DBLP] ACM Trans. Internet Techn., 2007, v:7, n:1, pp:- [Journal]
- Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler
Estimating Clustering Indexes in Data Streams. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:618-632 [Conf]
- Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
Pricing Tree Access Networks with Connected Backbones. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:498-509 [Conf]
- Stefano Leonardi, Piotr Sankowski
Network formation games with local coalitions. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:299-305 [Conf]
- Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1153-1162 [Conf]
- Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, Stefano Leonardi
New Metrics for Reputation Management in P2P Networks. [Citation Graph (0, 0)][DBLP] AIRWeb, 2007, pp:- [Conf]
- Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Ricardo A. Baeza-Yates
Link-Based Characterization and Detection of Web Spam. [Citation Graph (0, 0)][DBLP] AIRWeb, 2006, pp:1-8 [Conf]
- 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 [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Stefano Leonardi, Danny Raz
Approximating total flow time on parallel machines. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:6, pp:875-891 [Journal]
- Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
Set Covering with our Eyes Closed. [Citation Graph (, )][DBLP]
Online Network Design with Outliers. [Citation Graph (, )][DBLP]
Mining Large Networks with Subgraph Counting. [Citation Graph (, )][DBLP]
Stochastic analyses for online combinatorial optimization problems. [Citation Graph (, )][DBLP]
Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]
Combinatorial Auctions with Budgets [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.533secs
|