Welcome to D
SIGMOD 2005
PODS 2005
SIGMOD-RECOR
CIDR 2005
CIKM 2005
COMAD 2005
CVDB 2005
DaMoN 2005
Data Enginee
DEBS05
DMSN 2005
DOLAP 2005
GIR 2005
GIS 2005
Hypertext 20
ICDE 2005
ICDM 2005
IHIS 2005
IQIS 2005
JCDL 2005
KRAS 2005
MDM 2005
MIR 2005
MobiDE 2005
P2PIR 2005
RIDE 2005
SBBD 2005
SIGIR 2005
SIGIR-FORUM
SIGKDD 2005
SIGKDD-EXP
SSDBM 2005
TIME 2005
TKDE 2005
TODS 2005
VLDB 2005
VLDBJ 2005
WebDB 2005
WIDM 2005
About DiSC 2
Editorial Bo
Acknowledgem
DiSC'06 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Stefano Leonardi

Papers on DiSC'06


Mining the inner structure of the Web graph

Publications


Note: Links lead to the DBLP on the Web.

Stefano Leonardi

Stefano Leonardi, Friedhelm Meyer auf der Heide , Dorothea Wagner : Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005 Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany 2006

Roee Engelberg , Jochen Könemann , Stefano Leonardi, Joseph Naor : Cut Problems in Graphs with a Budget Constraint. LATIN 2006 : 435-446

Ö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] Springer 2005

Gerth Stølting Brodal , Stefano Leonardi: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings Springer 2005

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

Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Guidouca Schaefer , Tjark Vredeveld : Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information 2005

Debora Donato , Stefano Leonardi, Panayiotis Tsaparas : Stability and Similarity of Link Analysis Ranking Algorithms. ICALP 2005 : 717-729

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. ICALP 2005 : 930-942

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

Jochen Könemann , Stefano Leonardi, Guido Schäfer : A group-strategyproof mechanism for Steiner forests. SODA 2005 : 612-619

Ö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

Alexander Kesselman , Stefano Leonardi, Vincenzo Bonifaci : Game-Theoretic Analysis of Internet Switching with Selfish Users. WINE 2005 : 236-245

Debora Donato , Stefano Leonardi, Stefano Millozzi , Panayiotis Tsaparas : Mining the inner structure of the Web graph. WebDB 2005 : 145-150

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)

Stefano Leonardi: Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings Springer 2004

Stefano Leonardi, Guido Schäfer : Cross-monotonic cost-sharing methods for connected facility location games. ACM Conference on Electronic Commerce 2004 : 242-243

Stefano Leonardi, Alberto Marchetti-Spaccamela , Friedhelm Meyer auf der Heide : Scheduling against an adversarial network. SPAA 2004 : 151-159

Stefano Leonardi: Preface. Algorithmica 40 (4): 217 (2004)

Luca Becchetti , Stefano Leonardi: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51 (4): 517-539 (2004)

Luca Becchetti , Stefano Leonardi, S. Muthukrishnan : Average stretch without migration. J. Comput. Syst. Sci. 68 (1): 80-95 (2004)

Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Kirk Pruhs : Semi-clairvoyant scheduling. Theor. Comput. Sci. 324 (2-3): 325-335 (2004)

Stefano Leonardi, Guido Schäfer : Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326 (1-3): 431-442 (2004)

Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Kirk Pruhs : Semi-clairvoyant Scheduling. ESA 2003 : 67-77

Luigi Laura , Stefano Leonardi, Stefano Millozzi , Ulrich Meyer , Jop F. Sibeyn : Algorithms and Experiments for the Webgraph. ESA 2003 : 703-714

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

Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Guido Schäfer : Scheduling to Minimize Flow Time Metrics. IPDPS 2003 : 223

Monika Rauch Henzinger , Stefano Leonardi: Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66 (3): 567-611 (2003)

Klaus Jansen , Stefano Leonardi, Vijay V. Vazirani : Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings Springer 2002

Massimiliano Curcio , Stefano Leonardi, Andrea Vitaletti : An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. ALENEX 2002 : 71-85

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

Baruch Awerbuch , Yossi Azar , Stefano Leonardi, Oded Regev : Minimizing the Flow Time Without Migration. SIAM J. Comput. 31 (5): 1370-1382 (2002)

Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Kirk Pruhs : Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001 : 36-47

Luca Becchetti , Stefano Leonardi: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001 : 94-103

Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Algorithms for the On-Line Travelling Salesman. Algorithmica 29 (4): 560-581 (2001)

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)

Stefano Leonardi, Alberto Marchetti-Spaccamela , Alessio Presciutti , Adi Rosén : On-line Randomized Call Control Revisited . SIAM J. Comput. 31 (1): 86-112 (2001)

Stefano Leonardi, Alberto Marchetti-Spaccamela : Preface. Theor. Comput. Sci. 268 (1): 1 (2001)

Giorgio Ausiello , Stefano Leonardi, Alberto Marchetti-Spaccamela : On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000 : 1-16

Stefano Leonardi, Alberto Marchetti-Spaccamela , Andrea Vitaletti : Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000 : 409-420

Luca Becchetti , Stefano Leonardi, S. Muthukrishnan : Scheduling to minimize average stretch without migration. SODA 2000 : 548-557

Susanne Albers , Naveen Garg , Stefano Leonardi: Minimizing stall time in single and parallel disk systems. J. ACM 47 (6): 969-986 (2000)

Yair Bartal , Stefano Leonardi, Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie : Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13 (1): 64-78 (2000)

Monika Rauch Henzinger , Stefano Leonardi: Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999 : 438-447

Baruch Awerbuch , Yossi Azar , Stefano Leonardi, Oded Regev : Minimizing the Flow Time Without Migration. STOC 1999 : 198-205

Susanne Albers , Stefano Leonardi: On-line Algorithms. ACM Comput. Surv. 31 (3es): 4 (1999)

Stefano Leonardi, Alberto Marchetti-Spaccamela : On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24 (1): 29-49 (1999)

Yossi Azar , Yair Bartal , Esteban Feuerstein , Amos Fiat , Stefano Leonardi, Adi Rosén : On Capital Investment. Algorithmica 25 (1): 22-36 (1999)

Yair Bartal , Stefano Leonardi: On-Line Routing in All-Optical Networks. Theor. Comput. Sci. 221 (1-2): 19-39 (1999)

Stefano Leonardi, Andrea Vitaletti : Randomized Lower Bounds for Online Path Coloring. RANDOM 1998 : 232-247

Stefano Leonardi, Alberto Marchetti-Spaccamela , Alessio Presciutti , Adi Rosén : On-line Randomized Call Control Revisited. SODA 1998 : 323-332

Susanne Albers , Naveen Garg , Stefano Leonardi: Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998 : 454-462

Esteban Feuerstein , Stefano Leonardi, Alberto Marchetti-Spaccamela , Nicola Santoro : Efficient Token-Based Control in Rings. Inf. Process. Lett. 66 (4): 175-180 (1998)

Yair Bartal , Stefano Leonardi: On-Line Routing in All-Optical Networks. ICALP 1997 : 516-526

Stefano Leonardi, Danny Raz : Approximating Total Flow Time on Parallel Machines. STOC 1997 : 110-119

Maurizio A. Bonuccelli , Stefano Leonardi: On scheduling variable length broadcasts in wireless networks. Telecommunication Systems 8 (2-4): 211-227 (1997)

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

Yossi Azar , Yair Bartal , Esteban Feuerstein , Amos Fiat , Stefano Leonardi, Adi Rosén : On Capital Investment. ICALP 1996 : 429-441

Stefano Leonardi: On-line Network Routing. Online Algorithms 1996 : 242-267

Esteban Feuerstein , Stefano Leonardi, Alberto Marchetti-Spaccamela , Nicola Santoro : Efficient Token-Based Control in Rings (Abstract). PODC 1996 : 154

Yair Bartal , Stefano Leonardi, Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie : Multiprocessor Scheduling with Rejection. SODA 1996 : 95-103

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

Paola Alimonti , Stefano Leonardi, Alberto Marchetti-Spaccamela : Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. ITA 30 (4): 305-318 (1996)

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)

Stefano Leonardi, Alberto Marchetti-Spaccamela : On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995 : 303-314

Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Competitive Algorithms for the On-line Traveling Salesman. WADS 1995 : 206-217

Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Serving Requests with On-line Routing. SWAT 1994 : 37-48

Paola Alimonti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Xavier Messeguer : Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993 : 87-98

1 [ 17 ] [ 23 ] [ 27 ]

2 [ 1 ] [ 6 ]

3 [ 2 ] [ 3 ] [ 30 ] [ 34 ]

4 [ 12 ] [ 24 ] [ 33 ] [ 37 ]

5 [ 11 ] [ 12 ] [ 21 ] [ 24 ] [ 33 ] [ 37 ]

6 [ 57 ] [ 65 ]

7 [ 7 ] [ 8 ] [ 11 ] [ 15 ] [ 20 ] [ 21 ] [ 26 ]

8 [ 28 ] [ 35 ] [ 36 ] [ 38 ] [ 42 ] [ 43 ] [ 45 ] [ 47 ] [ 48 ] [ 49 ] [ 54 ] [ 59 ] [ 62 ]

9 [ 5 ]

10 [ 56 ]

11 [ 13 ]

12 [ 64 ]

13 [ 39 ]

14 [ 38 ] [ 54 ]

15 [ 55 ] [ 61 ]

16 [ 66 ]

17 [ 57 ] [ 65 ]

18 [ 2 ] [ 3 ] [ 9 ] [ 11 ] [ 16 ] [ 21 ] [ 34 ]

19 [ 7 ] [ 11 ] [ 12 ] [ 21 ] [ 33 ]

20 [ 5 ]

21 [ 17 ] [ 27 ]

22 [ 5 ]

23 [ 51 ] [ 63 ] [ 67 ]

24 [ 25 ] [ 41 ]

25 [ 40 ]

26 [ 57 ] [ 65 ]

27 [ 56 ]

28 [ 58 ] [ 59 ] [ 60 ] [ 66 ]

29 [ 44 ]

30 [ 1 ] [ 4 ] [ 6 ] [ 8 ] [ 9 ] [ 16 ] [ 18 ] [ 22 ] [ 26 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 36 ] [ 38 ] [ 42 ] [ 43 ] [ 45 ] [ 47 ] [ 51 ] [ 54 ] [ 62 ]

31 [ 1 ]

32 [ 44 ]

33 [ 44 ] [ 55 ]

34 [ 57 ] [ 65 ]

35 [ 57 ] [ 65 ]

36 [ 28 ] [ 38 ] [ 48 ] [ 54 ]

37 [ 38 ] [ 54 ]

38 [ 66 ]

39 [ 5 ]

40 [ 59 ]

41 [ 18 ] [ 32 ]

42 [ 36 ] [ 45 ] [ 47 ]

43 [ 14 ]

44 [ 24 ] [ 37 ]

45 [ 11 ] [ 12 ] [ 18 ] [ 21 ] [ 32 ] [ 33 ]

46 [ 9 ] [ 16 ]

47 [ 62 ]

48 [ 42 ] [ 43 ] [ 46 ] [ 52 ] [ 58 ] [ 60 ]

49 [ 8 ] [ 26 ]

50 [ 44 ]

51 [ 65 ]

52 [ 2 ] [ 3 ] [ 8 ] [ 26 ] [ 34 ]

53 [ 2 ] [ 3 ] [ 34 ]

54 [ 55 ] [ 61 ]

55 [ 40 ]

56 [ 19 ] [ 29 ] [ 38 ] [ 39 ] [ 54 ]

57 [ 43 ] [ 62 ]

58 [ 63 ] [ 67 ]

59 [ 5 ]

60 [ 60 ]




©2006 Association for Computing Machinery