| 2008 |
|---|
| 31 | EE | Luca Becchetti,
Paolo Boldi,
Carlos Castillo,
Aristides Gionis:
Efficient semi-streaming algorithms for local triangle counting in massive graphs.
KDD 2008: 16-24 |
| 30 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Flow Time Minimization.
Encyclopedia of Algorithms 2008 |
| 29 | EE | Luca Becchetti,
Carlos Castillo,
Debora Donato,
Ricardo A. Baeza-Yates,
Stefano Leonardi:
Link analysis for Web spam detection.
TWEB 2(1): (2008) |
| 2007 |
|---|
| 28 | 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) |
| 2006 |
|---|
| 27 | 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 |
| 26 | EE | Luca Becchetti,
Peter Korteweg,
Alberto Marchetti-Spaccamela,
Martin Skutella,
Leen Stougie,
Andrea Vitaletti:
Latency Constrained Aggregation in Sensor Networks.
ESA 2006: 88-99 |
| 25 | EE | Luca Becchetti,
Carlos Castillo:
The distribution of pageRank follows a power-law only for particular values of the damping factor.
WWW 2006: 941-942 |
| 24 | 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) |
| 23 | 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 |
|---|
| 22 | 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 |
| 21 | 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 |
| 20 | 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 |
|---|
| 19 | EE | Luca Becchetti:
Modeling Locality: A Probabilistic Analysis of LRU and FWF.
ESA 2004: 98-109 |
| 18 | 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) |
| 17 | EE | Luca Becchetti,
Stefano Leonardi,
S. Muthukrishnan:
Average stretch without migration.
J. Comput. Syst. Sci. 68(1): 80-95 (2004) |
| 16 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximating call-scheduling makespan in all-optical networks.
J. Discrete Algorithms 2(4): 501-515 (2004) |
| 15 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant scheduling.
Theor. Comput. Sci. 324(2-3): 325-335 (2004) |
| 2003 |
|---|
| 14 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Semi-clairvoyant Scheduling.
ESA 2003: 67-77 |
| 13 | 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 |
| 12 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Guido Schäfer:
Scheduling to Minimize Flow Time Metrics.
IPDPS 2003: 223 |
| 2002 |
|---|
| 11 | 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 |
| 10 | EE | Luca Becchetti,
Paola Bertolazzi,
Carlo Gaibisso,
Giorgio Gambosi:
On the design of efficient ATM routing schemes.
Theor. Comput. Sci. 270(1-2): 341-359 (2002) |
| 9 | | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theor. Comput. Sci. 287(2): 429-448 (2002) |
| 2001 |
|---|
| 8 | | Luca Becchetti,
Mauro Draoli,
Carlo Gaibisso,
Flavio Lombardi:
A Java Implementation of a Reliable Multicast File Transfer Protocol: Design and Evaluation.
IMSA 2001: 163-168 |
| 7 | EE | Luca Becchetti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling.
RANDOM-APPROX 2001: 36-47 |
| 6 | EE | Luca Becchetti,
Stefano Leonardi:
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
STOC 2001: 94-103 |
| 2000 |
|---|
| 5 | EE | Luca Becchetti,
Stefano Leonardi,
S. Muthukrishnan:
Scheduling to minimize average stretch without migration.
SODA 2000: 548-557 |
| 4 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximating Call-Scheduling Makespan in All-Optical Networks.
WG 2000: 13-22 |
| 1999 |
|---|
| 3 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.
FSTTCS 1999: 201-212 |
| 1997 |
|---|
| 2 | | Fabrizio d'Amore,
Luca Becchetti,
Sergei L. Bezrukov,
Alberto Marchetti-Spaccamela,
M. Ottaviani,
Robert Preis,
Markus Röttger,
Ulf-Peter Schroeder:
On the Embedding of Refinements of 2-dimensional Grids.
Euro-Par 1997: 950-957 |
| 1 | | Luca Becchetti,
Carlo Gaibisso:
Lower Bounds for the Virtual Path Layout Problem in ATM Networks.
SOFSEM 1997: 375-382 |
