| 2008 |
|---|
| 94 | EE | Fabrizio Grandoni,
Anupam Gupta,
Stefano Leonardi,
Pauli Miettinen,
Piotr Sankowski,
Mohit Singh:
Set Covering with our Eyes Closed.
FOCS 2008: 347-356 |
| 93 | EE | Ilaria Bordino,
Debora Donato,
Aristides Gionis,
Stefano Leonardi:
Mining Large Networks with Subgraph Counting.
ICDM 2008: 737-742 |
| 92 | EE | Naveen Garg,
Anupam Gupta,
Stefano Leonardi,
Piotr Sankowski:
Stochastic analyses for online combinatorial optimization problems.
SODA 2008: 942-951 |
| 91 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Flow Time Minimization.
Encyclopedia of Algorithms 2008 |
| 90 | EE | 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) |
| 89 | EE | Luca Becchetti,
Carlos Castillo,
Debora Donato,
Ricardo A. Baeza-Yates,
Stefano Leonardi:
Link analysis for Web spam detection.
TWEB 2(1): (2008) |
| 2007 |
|---|
| 88 | EE | Debora Donato,
Mario Paniccia,
Maddalena Selis,
Carlos Castillo,
Giovanni Cortese,
Stefano Leonardi:
New Metrics for Reputation Management in P2P Networks.
AIRWeb 2007 |
| 87 | EE | Vineet Goyal,
Anupam Gupta,
Stefano Leonardi,
R. Ravi:
Pricing Tree Access Networks with Connected Backbones.
ESA 2007: 498-509 |
| 86 | EE | Luciana S. Buriol,
Gereon Frahling,
Stefano Leonardi,
Christian Sohler:
Estimating Clustering Indexes in Data Streams.
ESA 2007: 618-632 |
| 85 | EE | Stefano Leonardi,
Piotr Sankowski:
Network formation games with local coalitions.
PODC 2007: 299-305 |
| 84 | EE | 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 |
| 83 | EE | Debora Donato,
Luigi Laura,
Stefano Leonardi,
Stefano Millozzi:
The Web as a graph: How far we are.
ACM Trans. Internet Techn. 7(1): (2007) |
| 82 | EE | Luca Becchetti,
Jochen Könemann,
Stefano Leonardi,
Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.
ACM Transactions on Algorithms 3(2): (2007) |
| 81 | EE | Stefano Leonardi,
Danny Raz:
Approximating total flow time on parallel machines.
J. Comput. Syst. Sci. 73(6): 875-891 (2007) |
| 80 | EE | 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) |
| 2006 |
|---|
| 79 | | Stefano Leonardi,
Friedhelm Meyer auf der Heide,
Dorothea Wagner:
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 78 | EE | Luca Becchetti,
Carlos Castillo,
Debora Donato,
Stefano Leonardi,
Ricardo A. Baeza-Yates:
Link-Based Characterization and Detection of Web Spam.
AIRWeb 2006: 1-8 |
| 77 | EE | Yair Bartal,
Stefano Leonardi,
Gil Shallom,
René Sitters:
On the Value of Preemption in Scheduling.
APPROX-RANDOM 2006: 39-48 |
| 76 | EE | Roee Engelberg,
Jochen Könemann,
Stefano Leonardi,
Joseph Naor:
Cut Problems in Graphs with a Budget Constraint.
LATIN 2006: 435-446 |
| 75 | EE | Luciana S. Buriol,
Gereon Frahling,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Christian Sohler:
Counting triangles in data streams.
PODS 2006: 253-262 |
| 74 | EE | 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 |
| 73 | EE | Luciana S. Buriol,
Carlos Castillo,
Debora Donato,
Stefano Leonardi,
Stefano Millozzi:
Temporal Analysis of the Wikigraph.
Web Intelligence 2006: 45-51 |
| 72 | EE | 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) |
| 71 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Online weighted flow time and deadline scheduling.
J. Discrete Algorithms 4(3): 339-352 (2006) |
| 70 | EE | 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) |
| 69 | EE | 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) |
| 68 | EE | 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) |
| 67 | EE | 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) |
| 2005 |
|---|
| 66 | | Ö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 |
| 65 | | Gerth Stølting Brodal,
Stefano Leonardi:
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
Springer 2005 |
| 64 | EE | 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 |
| 63 | EE | 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 |
| 62 | EE | Debora Donato,
Stefano Leonardi,
Panayiotis Tsaparas:
Stability and Similarity of Link Analysis Ranking Algorithms.
ICALP 2005: 717-729 |
| 61 | EE | 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 |
| 60 | EE | 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 |
| 59 | EE | Jochen Könemann,
Stefano Leonardi,
Guido Schäfer:
A group-strategyproof mechanism for Steiner forests.
SODA 2005: 612-619 |
| 58 | EE | Ö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 |
| 57 | EE | Alexander Kesselman,
Stefano Leonardi,
Vincenzo Bonifaci:
Game-Theoretic Analysis of Internet Switching with Selfish Users.
WINE 2005: 236-245 |
| 56 | | Debora Donato,
Stefano Leonardi,
Stefano Millozzi,
Panayiotis Tsaparas:
Mining the inner structure of the Web graph.
WebDB 2005: 145-150 |
| 55 | | Dimitris Achlioptas,
Stefano Leonardi:
Special Issue on Algorithms and Models for the Web-Graph.
Internet Mathematics 2(3): (2005) |
| 54 | EE | 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) |
| 2004 |
|---|
| 53 | | Stefano Leonardi:
Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings
Springer 2004 |
| 52 | EE | Stefano Leonardi,
Guido Schäfer:
Cross-monotonic cost-sharing methods for connected facility location games.
ACM Conference on Electronic Commerce 2004: 242-243 |
| 51 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Friedhelm Meyer auf der Heide:
Scheduling against an adversarial network.
SPAA 2004: 151-159 |
| 50 | EE | Stefano Leonardi:
Preface.
Algorithmica 40(4): 217 (2004) |
| 49 | EE | Luca Becchetti,
Stefano Leonardi:
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
J. ACM 51(4): 517-539 (2004) |
| 48 | EE | Luca Becchetti,
Stefano Leonardi,
S. Muthukrishnan:
Average stretch without migration.
J. Comput. Syst. Sci. 68(1): 80-95 (2004) |
| 47 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant scheduling.
Theor. Comput. Sci. 324(2-3): 325-335 (2004) |
| 46 | EE | Stefano Leonardi,
Guido Schäfer:
Cross-monotonic cost sharing methods for connected facility location games.
Theor. Comput. Sci. 326(1-3): 431-442 (2004) |
| 2003 |
|---|
| 45 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant Scheduling.
ESA 2003: 67-77 |
| 44 | EE | Luigi Laura,
Stefano Leonardi,
Stefano Millozzi,
Ulrich Meyer,
Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph.
ESA 2003: 703-714 |
| 43 | EE | 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 |
| 42 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Guido Schäfer:
Scheduling to Minimize Flow Time Metrics.
IPDPS 2003: 223 |
| 41 | EE | Monika Rauch Henzinger,
Stefano Leonardi:
Scheduling multicasts on unit-capacity trees and meshes.
J. Comput. Syst. Sci. 66(3): 567-611 (2003) |
| 2002 |
|---|
| 40 | | 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 |
| 39 | EE | Massimiliano Curcio,
Stefano Leonardi,
Andrea Vitaletti:
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.
ALENEX 2002: 71-85 |
| 38 | EE | 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 |
| 37 | EE | Baruch Awerbuch,
Yossi Azar,
Stefano Leonardi,
Oded Regev:
Minimizing the Flow Time Without Migration.
SIAM J. Comput. 31(5): 1370-1382 (2002) |
| 2001 |
|---|
| 36 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling.
RANDOM-APPROX 2001: 36-47 |
| 35 | EE | Luca Becchetti,
Stefano Leonardi:
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
STOC 2001: 94-103 |
| 34 | EE | Giorgio Ausiello,
Esteban Feuerstein,
Stefano Leonardi,
Leen Stougie,
Maurizio Talamo:
Algorithms for the On-Line Travelling Salesman.
Algorithmica 29(4): 560-581 (2001) |
| 33 | EE | 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) |
| 32 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Alessio Presciutti,
Adi Rosén:
On-line Randomized Call Control Revisited .
SIAM J. Comput. 31(1): 86-112 (2001) |
| 31 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela:
Preface.
Theor. Comput. Sci. 268(1): 1 (2001) |
| 2000 |
|---|
| 30 | EE | Giorgio Ausiello,
Stefano Leonardi,
Alberto Marchetti-Spaccamela:
On Salesmen, Repairmen, Spiders, and Other Traveling Agents.
CIAC 2000: 1-16 |
| 29 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Andrea Vitaletti:
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints.
FSTTCS 2000: 409-420 |
| 28 | EE | Luca Becchetti,
Stefano Leonardi,
S. Muthukrishnan:
Scheduling to minimize average stretch without migration.
SODA 2000: 548-557 |
| 27 | EE | Susanne Albers,
Naveen Garg,
Stefano Leonardi:
Minimizing stall time in single and parallel disk systems.
J. ACM 47(6): 969-986 (2000) |
| 26 | EE | Yair Bartal,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Jiri Sgall,
Leen Stougie:
Multiprocessor Scheduling with Rejection.
SIAM J. Discrete Math. 13(1): 64-78 (2000) |
| 1999 |
|---|
| 25 | EE | Monika Rauch Henzinger,
Stefano Leonardi:
Scheduling Multicasts on Unit-Capacity Trees and Meshes.
SODA 1999: 438-447 |
| 24 | EE | Baruch Awerbuch,
Yossi Azar,
Stefano Leonardi,
Oded Regev:
Minimizing the Flow Time Without Migration.
STOC 1999: 198-205 |
| 23 | EE | Susanne Albers,
Stefano Leonardi:
On-line Algorithms.
ACM Comput. Surv. 31(3es): 4 (1999) |
| 22 | EE | Stefano Leonardi,
Alberto Marchetti-Spaccamela:
On-Line Resource Management with Application to Routing and Scheduling.
Algorithmica 24(1): 29-49 (1999) |
| 21 | EE | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
Algorithmica 25(1): 22-36 (1999) |
| 20 | EE | Yair Bartal,
Stefano Leonardi:
On-Line Routing in All-Optical Networks.
Theor. Comput. Sci. 221(1-2): 19-39 (1999) |
| 1998 |
|---|
| 19 | EE | Stefano Leonardi,
Andrea Vitaletti:
Randomized Lower Bounds for Online Path Coloring.
RANDOM 1998: 232-247 |
| 18 | | Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Alessio Presciutti,
Adi Rosén:
On-line Randomized Call Control Revisited.
SODA 1998: 323-332 |
| 17 | EE | Susanne Albers,
Naveen Garg,
Stefano Leonardi:
Minimizing Stall Time in Single and Parallel Disk Systems.
STOC 1998: 454-462 |
| 16 | EE | Esteban Feuerstein,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Nicola Santoro:
Efficient Token-Based Control in Rings.
Inf. Process. Lett. 66(4): 175-180 (1998) |
| 1997 |
|---|
| 15 | | Yair Bartal,
Stefano Leonardi:
On-Line Routing in All-Optical Networks.
ICALP 1997: 516-526 |
| 14 | EE | Stefano Leonardi,
Danny Raz:
Approximating Total Flow Time on Parallel Machines.
STOC 1997: 110-119 |
| 13 | | Maurizio A. Bonuccelli,
Stefano Leonardi:
On scheduling variable length broadcasts in wireless networks.
Telecommunication Systems 8(2-4): 211-227 (1997) |
| 1996 |
|---|
| 12 | | 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 |
| 11 | | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
ICALP 1996: 429-441 |
| 10 | | Stefano Leonardi:
On-line Network Routing.
Online Algorithms 1996: 242-267 |
| 9 | | Esteban Feuerstein,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Nicola Santoro:
Efficient Token-Based Control in Rings (Abstract).
PODC 1996: 154 |
| 8 | | Yair Bartal,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Jiri Sgall,
Leen Stougie:
Multiprocessor Scheduling with Rejection.
SODA 1996: 95-103 |
| 7 | EE | 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 |
| 6 | | Paola Alimonti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela:
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.
ITA 30(4): 305-318 (1996) |
| 5 | | 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) |
| 1995 |
|---|
| 4 | | Stefano Leonardi,
Alberto Marchetti-Spaccamela:
On-line Resource Management with Applications to Routing and Scheduling.
ICALP 1995: 303-314 |
| 3 | | Giorgio Ausiello,
Esteban Feuerstein,
Stefano Leonardi,
Leen Stougie,
Maurizio Talamo:
Competitive Algorithms for the On-line Traveling Salesman.
WADS 1995: 206-217 |
| 1994 |
|---|
| 2 | | Giorgio Ausiello,
Esteban Feuerstein,
Stefano Leonardi,
Leen Stougie,
Maurizio Talamo:
Serving Requests with On-line Routing.
SWAT 1994: 37-48 |
| 1993 |
|---|
| 1 | | Paola Alimonti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Xavier Messeguer:
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.
WG 1993: 87-98 |
