Most recent edit on 2010-03-15 13:43:04 by StefanoLeonardi
Deletions:
Paper Writing∞
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-12 20:03:57 by MarcosSp
Additions:
Paper Writing∞
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-12 16:29:20 by StefanoLeonardi
Deletions:
Paper Writing∞
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
tv ads design∞
outdoor media design∞
outdoor media banners design∞
outdoor media banner design∞
tv ad design∞
Edited on 2010-03-11 15:34:34 by Smithwilson1987
Additions:
tv ads design∞
outdoor media design∞
outdoor media banners design∞
outdoor media banner design∞
tv ad design∞
Edited on 2010-03-11 12:45:44 by MarcosSp
Additions:
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-11 10:01:30 by RafaelPicoli
Deletions:
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-11 04:05:31 by MarcosSp
Additions:
Relogio de ponto∞
Deletions:
de ponto∞
Edited on 2010-03-11 04:05:16 by MarcosSp
Additions:
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-11 02:17:18 by RafaelPicoli
Deletions:
Fuel∞ Energy∞
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
Relogio de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-03-08 20:12:20 by MarcosSp
Additions:
Relogio de ponto∞
Deletions:
de ponto∞
Edited on 2010-03-08 20:12:02 by MarcosSp
Additions:
otimização de sites∞
Acompanahntes Sao paulo∞
Desentupidora∞
de ponto∞
Transportadora∞
Folders∞
Dentista∞
Edited on 2010-02-12 10:43:36 by DavidSims
Additions:
Fuel∞ Energy∞
Edited on 2009-10-22 08:09:33 by RafaelPicoli
Additions:
Paper Writing∞
Deletions:
Custom Templates∞
Edited on 2009-08-10 11:54:58 by JennySo
Additions:
Custom Templates∞
Edited on 2008-05-13 07:54:09 by StefanoLeonardi
Deletions:
Conference Publications
Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses for online combinatorial optimization problems. In Shang-Teng Huang, editor, SODA, pages 942–951. SIAM, 2008.
Vineet Goyal, Anupam Gupta, Stefano Leonardi, and R. Ravi. Pricing tree access networks with connected backbones. In Proceedings of the 15th Annual European Symposium on Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 498–509. Springer, 2007.
Anupam Gupta, Jochen K ̈onemann, Stefano Leonardi, R. Ravi, and Guido Sch ̈afer. An efficient cost-sharing mechanism for the prize-collecting steiner forest problem. In Nikhil Bansal, Kirk Pruhs, and Clifford Stein, editors, SODA, pages 1153–1162. SIAM, 2007.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, and Christian Sohler. Estimating clustering indexes in data streams. In Proceedings of the 15th Annual European Symposium on Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 618–632. Springer, 2007.
Stefano Leonardi and Piotr Sankowski. Network formation games with local coalitions. In Indranil Gupta and Roger Wattenhofer, editors, PODC, pages 299–305. ACM, 2007.
Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, and Stefano Leonardi. New metrics for reputation management in p2p networks. In AIRWeb, 2007.
Roee Engelberg, Jochen K ̈onemann, Stefano Leonardi, and Joseph Naor. Cut problems in graphs with a budget constraint. In Jos ́e R. Correa, Alejandro Hevia, and Marcos A. Kiwi, editors, LATIN, volume 3887 of Lecture Notes in Computer Science, pages 435–446. Springer,
2006.
Lisa Fleischer, Jochen Koenemann, Stefano Leonardi, and Guido Schaefer. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree. In Jon M. Kleinberg, editor, STOC, pages 663–670. ACM, 2006.
Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, and Stefano Millozzi. Temporal analysis of the wikigraph. In Web Intel ligence, pages 45–51. IEEE Computer Society, 2006.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler. Counting triangles in data streams. In Stijn Vansummeren, editor, PODS, pages 253–262. ACM, 2006.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo Baeza-Yates. Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD), Pennsylvania, USA, August 2006. ACM Press.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo A. Baeza-Yates. Link-based characterization and detection of web spam. In AIRWeb, pages 1–8, 2006.
Yair Bartal, Stefano Leonardi, Gil Shallom, and Rene Sitters. On the value of preemption in scheduling. In Josep D́ıaz, Klaus Jansen, Jose D. P. Rolim, and Uri Zwick, editors, APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, pages 39–48. Springer, 2006.
Luca Becchetti, Jochen Konemann, Stefano Leonardi, and Martin Pal. Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. In SODA, pages 375–384. SIAM, 2005.
Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. Mining the inner structure of the web graph. In AnHai Doan, Frank Neven, Robert McCann, and Geert Jan Bex, editors, WebDB, pages 145–150, 2005.
Jochen Koenemann, Stefano Leonardi and Guido Schaefer. A group-strategyproof mechanism for Steiner forests. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 612-619, 2005
Alexander Kesselman, Stefano Leonardi, and Vincenzo Bonifaci. Game-theoretic analysis of internet switching with selfish users. In Xiaotie Deng and Yinyu Ye, editors, WINE, volume 3828 of Lecture Notes in Computer Science, pages 236–245. Springer, 2005.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan van Zwam. From primal-dual to cost shares and back: A stronger lp relaxation for the steiner forest problem. In Luis Caires, Giuseppe F. Italiano, Lui Monteiro, Catuscia Palamidessi, and Moti Yung, editors, ICALP, volume 3580 of Lecture Notes in Computer Science, pages 930–942. Springer, 2005.
Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling against an adversarial network. In Proceedings of the 16th Annual ACM symposium on Parallel Algorithms (SPAA 2004), pp. 151 - 159.
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility location games. In Proc. of the ACM Conference on Electronic Commerce 2004, pp. 242-243.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer and T. Vredeveld. Smoothening helps: A Probabilistic Analysis of the Multi-Level Feedback Algorithm. Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge (MA), October 2003.
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer and Jop Sibeyin. Algorithms and Experiments for the Webgraph. To appear in Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, September 2003.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Scheduling. Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, September 2003.
[65] L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal and A. Vitaletti. Parallel Scheduling Problems in Next Generation Wireless Networks In Fourteenth Annual ACM Symposium on Paral lel Algorithms and Architectures (SPAA 02), pp. 238-247, 2002.
G.F. Italiano, S. Leonardi, G. Oriolo. Design of Networks in the Hose Model. Proc. of the 2nd International Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 65-76, Carleton Scientific Press, 2002.
L. Laura, S. Leonardi, G. Caldarelli and P. De Los Rios. A Multi-Layer Model of the WebGraph. 2nd International Workshop on Web Dynamics, Honolulu, Hawaii, May 2002.
M. Curcio, S. Leonardi and A. Vitaletti. An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. To appear in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX’02), San Francisco (CA), January 2002.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time on single and Parallel Machines. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 01), pp. 94-103, 2001.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Online Weighted Flow Time and Deadline Scheduling. Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX01), pp. 36-47, LNCS 2129, Springer-Verlag, 2001.
S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti. Approximation algorithms for bandwith and storage allocation problems under real-time constraints. Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000), LNCS 1974, pp 409-420, Springer-Verlag, 2000.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’00), pp. 448-557, 2000.
On Salesmen, Repairmen, Spieders and other Traveling Agents. In collaborazione con G. Ausiello e A. Marchetti-Spaccamela. Invited paper to the 4th Italian
Conference on Algorithms and Complexity (CIAC ’00), LNCS 1767, pp. 1-16, Springer-Verlag, 2000.
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migration. Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC 99), pp. 198-205, 1999.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes. To appear in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’99), pp. 438-447, 1999.
S. Leonardi and A. Vitaletti. Randomized lower bounds for online path coloring. Proceedings of the 2nd International Workshops on on Randomization and Approximation Techniques in Computer Science (RANDOM ’98), Lecture Notes in Computer Science 1518, Springer-Verlag, pp. 232-247, 1998.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), pp. 454-462, 1998.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call-Control Revisited. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA ’98), pp. 323-332, 1998.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proceedings of the 29th ACM Symposium on Theory of Computing (STOC 97), pp. 110-119, 1997. Invited paper to the special issue of Journal of Computer and System Sciences for STOC 97.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Proceedings of the 24th International Col loquium on Automata, Languages, and Programming (ICALP 97), pp. 516-526, Lecture Notes in Computer Science 1256, pp. 516-526, Springer-Verlang, 1997.
Y. Bartal, A. Fiat and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. Proc. of the 28th ACM Symposium on Theory of Computing (STOC 96), pp. 531-540, May 1996.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor scheduling with rejection. Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 96), pp. 95-103, 1996.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment. Proc. of the 23rd International Col loquium on Automata, Languages, and Programming (ICALP 96), Lecture Notes in Computer Science 1099, pp. 429-441, July 1996.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Proc. of the 15th ACM Symposium on Principles of
Distributed Computing (PODC 96), p. 154, May 1996. ù
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms for call control in optical networks. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA 96), Lecture Notes in Computer Science 1136, Springer-Verlag, pp. 431-444, 1996.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications to routing and scheduling. Proceedings of the 22nd International Col loquium on Automata, Languages and Programming (ICALP 95), Lecture Notes in Computer Science 944, Springer-Verlag, 1995, pp. 303-314.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Competitive algorithms for the on-line traveling-salesman. Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS 95), Lecture Notes in Computer Science 955, Springer-Verlag, 1995, pp. 206-217.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo. Serving requests with on-line routing. Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 94), Lecture Notes in Computer Science 824, Springer-Verlag, 1994, pp. 37-48.
P. Alimonti, S. Leonardi, A. Marchetti Spaccamela and X. Messeguer. Average case analysis of fully dynamic connectivity for directed graphs. Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 93), Lecture Notes in Computer Science 790, Springer Verlag, 1994, pp. 87-98.
Journal Publications
Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, and Stefano Leonardi. Link analysis for web spam detection. ACM Transactions on the Web (TWEB), 2(1), 2008.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan H. M. van Zwam. A group-strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing, 37(5):1319–1341, 2008.
Roee Engelberg, Jochen Koenemann, Stefano Leonardi, and Joseph Naor. Cut problems in graphs with a budget constraint. J. Discrete Algorithms, 5(2):262–279, 2007.
Luca Becchetti, Jochen Koenemann, Stefano Leonardi, and Martin Pal. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms, 3(2), 2007.
Debora Donato, Luigi Laura, Stefano Leonardi, and Stefano Millozzi. The web as a graph: How far we are. ACM Trans. Internet Techn., 7(1), 2007.
Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. J. Comput. Syst. Sci., 73(6):875–891, 2007.
Yair Bartal, Amos Fiat, and 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.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schaefer, and Tjark Vredeveld. Average-case and smoothed competitive analysis of the multilevel feedback algorithm. Math. Oper. Res., 31(1):85–108, 2006.
A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Caldarelli. Preferential attachment in the growth of social networks: The internet encyclopedia wikipedia. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 74(3), 2006.
Giuseppe F. Italiano, Stefano Leonardi, and Gianpaolo Oriolo. Design of trees in the hose model: The balanced case. Oper. Res. Lett., 34(6):601–606, 2006.
Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, and Sebastiano Vigna. A reference collection for web spam. SIGIR Forum, 40(2):11–24, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339–352, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, and Thyagara jan Nandagopal. Parallel scheduling problems in next generation wireless networks. Networks, 45(1):9–22, 2005.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time on single and Parallel Machines. Journal of the ACM,(51)4, pp. 517-539, 2004.
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility location games. Theoretical Computer Science, 326 (2004) 431-442.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Schedul ing. Theoretical Computer Science, special issue in honour of Steve Seiden, 324(2-3): 325-335 (2004).
D. Donato, L. Laura, S. Leonardi, S. Millozzi. Large Scale properties of the Webgraph. European Journal of Physics B, Vol 38, n. 2, pp. 239-243, 2004.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Journal of Computer and System Sciences 68(2004) pp. 80-95.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes. Journal of Computer and System Sciences 66(2003) pp. 567-611.
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migration. SIAM Journal on computing, 31(5), pp. 1370 - 1382, 2001.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Algorithms for the on-line traveling-salesman. Algorithmica, Vol 9, n. 4, pp. 560-581, 2001.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems. Journal of the ACM, Vol. 47, n. 6, 2000.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call- Control Revisited. SIAM Journal on Computing 31(1), pp. 86-112, 2001.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, Vol 13, n. 1, pp. 64-71, 2000.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Science - invited paper to the special issue for ICALP ’97, 221 (1999) 19-39.
Susanne Albers and Stefano Leonardi. Online Algorithms. ACM Computing Surveys - Symposium on Theoretical Computer Science: A Perspective, Volume 31 , No. 3, 1999.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with application to routing and scheduling. Algorithmica 24: 29-49, 1999.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms for call control in optical networks. Algorithmica 31(1), pp. 29-43, 2001.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment. Algorithmica - special issue on Computational Finance , 25:22-36, 1999.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Information Processing Letter 66 (1998), pp. 175-180.
M.A. Bonuccelli and S. Leonardi. Scheduling broadcasts in wireless networks. Telecommunication Systems, special issue on Satel lite Communication Systems and Networks, Vol. 8, Nos. 2-4 (1997), pp. 211-227.
B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler and P.Widmayer. Enclosing a set of ob jects by two minimum area rectangles. Journal of Algorithms, Vol 21, n.2, 1996, pp. 520-541.
P. Alimonti, S. Leonardi and A. Marchetti Spaccamela. Average case analysis of fully dynamic reachability for directed graphs. RAIRO Journal on Theoretical Informatics and Applications, vol 30, n. 4, 1996, pp. 305-318.
Book Chapters
D. Donato, L. Laura, S. Leonardi and S. Millozzi: Modeling the Webgraph: how far we are. In G. Caldarelli and A. Vespignani (eds) "Large structure and Dynamics of Complex Networks", World Scientific pp. 133-161. 2007.
S. Leonardi. A simpler proof of preemptive total flow time approximation on parallel machines. In Efficient Approximation and On-line Algorithms, Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire (Eds.), Lecture Notes in Computer Science, pp. 203 - 212, Springer, 2006.
S. Leonardi. On-line network routing. In Online Algorithms: the state of the art, A. Fiat and G. Woeginger eds., Lecture Notes in Computer Science 1442, pp. 242-267, Springer-Verlag, 1998.
Editorial Activity
Gianna Del Corso and Stefano Leonardi. Algorithmic and Numerical aspects in Web search. Internet Mathematics, To appear, 2008.
Dimitris Achlioptas and Stefano Leonardi. Special issue on algorithms and models for the web-graph. Internet Mathematics, 2(3), 2005.
Ozalp Babaoglu, Mark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel, and Maarten van Steen, editors. Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004], volume 3460 of Lecture Notes in Computer Science, Springer, 2005.
Gerth Stølting Brodal and Stefano Leonardi, editors. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mal lorca, Spain, October 3-6, 2005, Proceedings, volume 3669 of Lecture Notes in Computer Science. Springer, 2005.
Klaus Jansen, Stefano Leonardi and Vijay V. Vazirani. Approximation Algorithms for Combinatorial Optimization. 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, Springer 2002.
On-line Algorithms, S. Leonardi and A. Marchetti-Spaccamela eds. Theoretical Computer Science - special issue for OLA 98 268(1), 2001.
Patents
S.N. Diggavi, L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandaghopol and A. Vitaletti. Method for wireless dowling scheduling, United States provisional patent application.
Edited on 2008-05-13 07:53:42 by StefanoLeonardi
Additions:
Conference Publications
Journal Publications
Book Chapters
Editorial Activity
Patents
Edited on 2008-05-13 07:48:07 by StefanoLeonardi
Additions:
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Proc. of the 15th ACM Symposium on Principles of
Distributed Computing (PODC 96), p. 154, May 1996. ù
Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, and Stefano Leonardi. Link analysis for web spam detection. ACM Transactions on the Web (TWEB), 2(1), 2008.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan H. M. van Zwam. A group-strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing, 37(5):1319–1341, 2008.
Roee Engelberg, Jochen Koenemann, Stefano Leonardi, and Joseph Naor. Cut problems in graphs with a budget constraint. J. Discrete Algorithms, 5(2):262–279, 2007.
Luca Becchetti, Jochen Koenemann, Stefano Leonardi, and Martin Pal. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms, 3(2), 2007.
Debora Donato, Luigi Laura, Stefano Leonardi, and Stefano Millozzi. The web as a graph: How far we are. ACM Trans. Internet Techn., 7(1), 2007.
Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. J. Comput. Syst. Sci., 73(6):875–891, 2007.
Yair Bartal, Amos Fiat, and 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.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schaefer, and Tjark Vredeveld. Average-case and smoothed competitive analysis of the multilevel feedback algorithm. Math. Oper. Res., 31(1):85–108, 2006.
A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Caldarelli. Preferential attachment in the growth of social networks: The internet encyclopedia wikipedia. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 74(3), 2006.
Giuseppe F. Italiano, Stefano Leonardi, and Gianpaolo Oriolo. Design of trees in the hose model: The balanced case. Oper. Res. Lett., 34(6):601–606, 2006.
Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, and Sebastiano Vigna. A reference collection for web spam. SIGIR Forum, 40(2):11–24, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339–352, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, and Thyagara jan Nandagopal. Parallel scheduling problems in next generation wireless networks. Networks, 45(1):9–22, 2005.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time on single and Parallel Machines. Journal of the ACM,(51)4, pp. 517-539, 2004.
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility location games. Theoretical Computer Science, 326 (2004) 431-442.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Schedul ing. Theoretical Computer Science, special issue in honour of Steve Seiden, 324(2-3): 325-335 (2004).
D. Donato, L. Laura, S. Leonardi, S. Millozzi. Large Scale properties of the Webgraph. European Journal of Physics B, Vol 38, n. 2, pp. 239-243, 2004.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Journal of Computer and System Sciences 68(2004) pp. 80-95.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes. Journal of Computer and System Sciences 66(2003) pp. 567-611.
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migration. SIAM Journal on computing, 31(5), pp. 1370 - 1382, 2001.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Algorithms for the on-line traveling-salesman. Algorithmica, Vol 9, n. 4, pp. 560-581, 2001.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems. Journal of the ACM, Vol. 47, n. 6, 2000.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call- Control Revisited. SIAM Journal on Computing 31(1), pp. 86-112, 2001.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, Vol 13, n. 1, pp. 64-71, 2000.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Science - invited paper to the special issue for ICALP ’97, 221 (1999) 19-39.
Susanne Albers and Stefano Leonardi. Online Algorithms. ACM Computing Surveys - Symposium on Theoretical Computer Science: A Perspective, Volume 31 , No. 3, 1999.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with application to routing and scheduling. Algorithmica 24: 29-49, 1999.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms for call control in optical networks. Algorithmica 31(1), pp. 29-43, 2001.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment. Algorithmica - special issue on Computational Finance , 25:22-36, 1999.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Information Processing Letter 66 (1998), pp. 175-180.
M.A. Bonuccelli and S. Leonardi. Scheduling broadcasts in wireless networks. Telecommunication Systems, special issue on Satel lite Communication Systems and Networks, Vol. 8, Nos. 2-4 (1997), pp. 211-227.
B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler and P.Widmayer. Enclosing a set of ob jects by two minimum area rectangles. Journal of Algorithms, Vol 21, n.2, 1996, pp. 520-541.
P. Alimonti, S. Leonardi and A. Marchetti Spaccamela. Average case analysis of fully dynamic reachability for directed graphs. RAIRO Journal on Theoretical Informatics and Applications, vol 30, n. 4, 1996, pp. 305-318.
D. Donato, L. Laura, S. Leonardi and S. Millozzi: Modeling the Webgraph: how far we are. In G. Caldarelli and A. Vespignani (eds) "Large structure and Dynamics of Complex Networks", World Scientific pp. 133-161. 2007.
S. Leonardi. A simpler proof of preemptive total flow time approximation on parallel machines. In Efficient Approximation and On-line Algorithms, Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire (Eds.), Lecture Notes in Computer Science, pp. 203 - 212, Springer, 2006.
S. Leonardi. On-line network routing. In Online Algorithms: the state of the art, A. Fiat and G. Woeginger eds., Lecture Notes in Computer Science 1442, pp. 242-267, Springer-Verlag, 1998.
Gianna Del Corso and Stefano Leonardi. Algorithmic and Numerical aspects in Web search. Internet Mathematics, To appear, 2008.
Dimitris Achlioptas and Stefano Leonardi. Special issue on algorithms and models for the web-graph. Internet Mathematics, 2(3), 2005.
Ozalp Babaoglu, Mark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad P. A. van Moorsel, and Maarten van Steen, editors. Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004], volume 3460 of Lecture Notes in Computer Science, Springer, 2005.
Gerth Stølting Brodal and Stefano Leonardi, editors. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mal lorca, Spain, October 3-6, 2005, Proceedings, volume 3669 of Lecture Notes in Computer Science. Springer, 2005.
Klaus Jansen, Stefano Leonardi and Vijay V. Vazirani. Approximation Algorithms for Combinatorial Optimization. 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, Springer 2002.
On-line Algorithms, S. Leonardi and A. Marchetti-Spaccamela eds. Theoretical Computer Science - special issue for OLA 98 268(1), 2001.
S.N. Diggavi, L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandaghopol and A. Vitaletti. Method for wireless dowling scheduling, United States provisional patent application.
Deletions:
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Proc. of the 15th ACM Symposium on Principles of Distributed Computing (PODC 96), p. 154, May 1996.
Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, and Stefano
Leonardi. Link analysis for web spam detection. ACM Transactions on the Web (TWEB),
2(1), 2008.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan H. M. van Zwam. A group-
strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing,
37(5):1319–1341, 2008.
Roee Engelberg, Jochen Koenemann, Stefano Leonardi, and Joseph Naor. Cut problems in
graphs with a budget constraint. J. Discrete Algorithms, 5(2):262–279, 2007.
Luca Becchetti, Jochen Koenemann, Stefano Leonardi, and Martin Pal. Sharing the cost more
efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on
Algorithms, 3(2), 2007.
Debora Donato, Luigi Laura, Stefano Leonardi, and Stefano Millozzi. The web as a graph:
How far we are. ACM Trans. Internet Techn., 7(1), 2007.
Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. J.
Comput. Syst. Sci., 73(6):875–891, 2007.
Yair Bartal, Amos Fiat, and 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.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schaefer, and Tjark
Vredeveld. Average-case and smoothed competitive analysis of the multilevel feedback algo-
rithm. Math. Oper. Res., 31(1):85–108, 2006.
A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Cal-
darelli. Preferential attachment in the growth of social networks: The internet encyclopedia
wikipedia. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 74(3), 2006.
Giuseppe F. Italiano, Stefano Leonardi, and Gianpaolo Oriolo. Design of trees in the hose
model: The balanced case. Oper. Res. Lett., 34(6):601–606, 2006.
Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo San-
tini, and Sebastiano Vigna. A reference collection for web spam. SIGIR Forum, 40(2):11–24,
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online
weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339–352, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N.
Diggavi, S. Muthukrishnan, and Thyagara jan Nandagopal. Parallel scheduling problems in
next generation wireless networks. Networks, 45(1):9–22, 2005.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time
on single and Parallel Machines. Journal of the ACM,(51)4, pp. 517-539, 2004. A preliminary
version in [69].
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility lo-
cation games. Theoretical Computer Science, 326 (2004) 431-442.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Schedul-
ing. Theoretical Computer Science, special issue in honour of Steve Seiden, 324(2-3): 325-335
(2004).
D. Donato, L. Laura, S. Leonardi, S. Millozzi. Large Scale properties of the Webgraph. European
Journal of Physics B, Vol 38, n. 2, pp. 239-243, 2004.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch
without Migration. Journal of Computer and System Sciences 68(2004) pp. 80-95.
[27] M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes.
Journal of Computer and System Sciences 66(2003) pp. 567-611.
[28] B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migra-
tion. SIAM Journal on computing, 31(5), pp. 1370 - 1382, 2001.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Algorithms for the on-line
traveling-salesman. Algorithmica, Vol 9, n. 4, pp. 560-581, 2001.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems.
Journal of the ACM, Vol. 47, n. 6, 2000.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Ros ́en. On-line Randomized Call-
Control Revisited. SIAM Journal on Computing 31(1), pp. 86-112, 2001.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor
scheduling with rejection. SIAM Journal on Discrete Mathematics, Vol 13, n. 1, pp. 64-71,
2000.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Sci-
ence - invited paper to the special issue for ICALP ’97, 221 (1999) 19-39.
Susanne Albers and Stefano Leonardi. Online Algorithms. To appear in ACM Computing Sur-
veys - Symposium on Theoretical Computer Science: A Perspective, Volume 31 , No. 3, 1999.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with application to
routing and scheduling. Algorithmica 24: 29-49, 1999.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms
for call control in optical networks. Algorithmica 31(1), pp. 29-43, 2001.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment.
Algorithmica - special issue on Computational Finance , 25:22-36, 1999.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based
control in rings. Information Processing Letter 66 (1998), pp. 175-180.
M.A. Bonuccelli and S. Leonardi. Scheduling broadcasts in wireless networks. Telecommunica-
tion Systems, special issue on Satel lite Communication Systems and Networks, Vol. 8, Nos. 2-4
(1997), pp. 211-227.
B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler and P.Widmayer. Enclosing a
set of ob jects by two minimum area rectangles. Journal of Algorithms, Vol 21, n.2, 1996, pp.
520-541.
P. Alimonti, S. Leonardi and A. Marchetti Spaccamela. Average case analysis of fully dynamic
reachability for directed graphs. RAIRO Journal on Theoretical Informatics and Applications,
vol 30, n. 4, 1996, pp. 305-318.
D. Donato, L. Laura, S. Leonardi and S. Millozzi: Modeling the Webgraph: how far we are. In G.
Caldarelli and A. Vespignani (eds) "Large structure and Dynamics of Complex Networks", World
Scientific pp. 133-161. 2007.
S. Leonardi. A simpler proof of preemptive total flow time approximation on parallel machines.
In Efficient Approximation and On-line Algorithms, Bampis, Evripidis; Jansen, Klaus; Kenyon,
Claire (Eds.), Lecture Notes in Computer Science, pp. 203 - 212, Springer, 2006.
S. Leonardi. On-line network routing. In Online Algorithms: the state of the art, A. Fiat and G.
Woeginger eds., Lecture Notes in Computer Science 1442, pp. 242-267, Springer-Verlag, 1998.
Gianna Del Corso and Stefano Leonardi. Algorithmic and Numerical aspects in Web search.
Internet Mathematics, To appear, 2008.
Dimitris Achlioptas and Stefano Leonardi. Special issue on algorithms and models for the
web-graph. Internet Mathematics, 2(3), 2005.
Ozalp Babaoglu, Mark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad
P. A. van Moorsel, and Maarten van Steen, editors. Self-star Properties in Complex Informa-
tion Systems, Conceptual and Practical Foundations [the book is a result from a workshop at
Bertinoro, Italy, Summer 2004], volume 3460 of Lecture Notes in Computer Science, Springer,
2005.
Gerth Stølting Brodal and Stefano Leonardi, editors. Algorithms - ESA 2005, 13th Annual
European Symposium, Palma de Mal lorca, Spain, October 3-6, 2005, Proceedings, volume 3669
of Lecture Notes in Computer Science. Springer, 2005.
Klaus Jansen, Stefano Leonardi and Vijay V. Vazirani. Approximation Algorithms for Combi-
natorial Optimization. 5th International Workshop, APPROX 2002, Rome, Italy, September
17-21, 2002, Proceedings, Springer 2002.
On-line Algorithms, S. Leonardi and A. Marchetti-Spaccamela eds. Theoretical Computer Sci-
ence - special issue for OLA 98 268(1), 2001.
S.N. Diggavi, L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T.
Nandaghopol and A. Vitaletti. Method for wireless dowling scheduling, United States pro-
visional patent application.
Edited on 2008-05-13 07:42:30 by StefanoLeonardi
Additions:
Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses for online combinatorial optimization problems. In Shang-Teng Huang, editor, SODA, pages 942–951. SIAM, 2008.
Vineet Goyal, Anupam Gupta, Stefano Leonardi, and R. Ravi. Pricing tree access networks with connected backbones. In Proceedings of the 15th Annual European Symposium on Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 498–509. Springer, 2007.
Anupam Gupta, Jochen K ̈onemann, Stefano Leonardi, R. Ravi, and Guido Sch ̈afer. An efficient cost-sharing mechanism for the prize-collecting steiner forest problem. In Nikhil Bansal, Kirk Pruhs, and Clifford Stein, editors, SODA, pages 1153–1162. SIAM, 2007.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, and Christian Sohler. Estimating clustering indexes in data streams. In Proceedings of the 15th Annual European Symposium on Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 618–632. Springer, 2007.
Stefano Leonardi and Piotr Sankowski. Network formation games with local coalitions. In Indranil Gupta and Roger Wattenhofer, editors, PODC, pages 299–305. ACM, 2007.
Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, and Stefano Leonardi. New metrics for reputation management in p2p networks. In AIRWeb, 2007.
Roee Engelberg, Jochen K ̈onemann, Stefano Leonardi, and Joseph Naor. Cut problems in graphs with a budget constraint. In Jos ́e R. Correa, Alejandro Hevia, and Marcos A. Kiwi, editors, LATIN, volume 3887 of Lecture Notes in Computer Science, pages 435–446. Springer,
Lisa Fleischer, Jochen Koenemann, Stefano Leonardi, and Guido Schaefer. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree. In Jon M. Kleinberg, editor, STOC, pages 663–670. ACM, 2006.
Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, and Stefano Millozzi. Temporal analysis of the wikigraph. In Web Intel ligence, pages 45–51. IEEE Computer Society, 2006.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler. Counting triangles in data streams. In Stijn Vansummeren, editor, PODS, pages 253–262. ACM, 2006.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo Baeza-Yates. Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD), Pennsylvania, USA, August 2006. ACM Press.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo A. Baeza-Yates. Link-based characterization and detection of web spam. In AIRWeb, pages 1–8, 2006.
Yair Bartal, Stefano Leonardi, Gil Shallom, and Rene Sitters. On the value of preemption in scheduling. In Josep D́ıaz, Klaus Jansen, Jose D. P. Rolim, and Uri Zwick, editors, APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, pages 39–48. Springer, 2006.
Luca Becchetti, Jochen Konemann, Stefano Leonardi, and Martin Pal. Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. In SODA, pages 375–384. SIAM, 2005.
Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. Mining the inner structure of the web graph. In AnHai Doan, Frank Neven, Robert McCann, and Geert Jan Bex, editors, WebDB, pages 145–150, 2005.
Jochen Koenemann, Stefano Leonardi and Guido Schaefer. A group-strategyproof mechanism for Steiner forests. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 612-619, 2005
Alexander Kesselman, Stefano Leonardi, and Vincenzo Bonifaci. Game-theoretic analysis of internet switching with selfish users. In Xiaotie Deng and Yinyu Ye, editors, WINE, volume 3828 of Lecture Notes in Computer Science, pages 236–245. Springer, 2005.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan van Zwam. From primal-dual to cost shares and back: A stronger lp relaxation for the steiner forest problem. In Luis Caires, Giuseppe F. Italiano, Lui Monteiro, Catuscia Palamidessi, and Moti Yung, editors, ICALP, volume 3580 of Lecture Notes in Computer Science, pages 930–942. Springer, 2005.
Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling against an adversarial network. In Proceedings of the 16th Annual ACM symposium on Parallel Algorithms (SPAA 2004), pp. 151 - 159.
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility location games. In Proc. of the ACM Conference on Electronic Commerce 2004, pp. 242-243.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer and T. Vredeveld. Smoothening helps: A Probabilistic Analysis of the Multi-Level Feedback Algorithm. Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge (MA), October 2003.
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer and Jop Sibeyin. Algorithms and Experiments for the Webgraph. To appear in Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, September 2003.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Scheduling. Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, September 2003.
[65] L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal and A. Vitaletti. Parallel Scheduling Problems in Next Generation Wireless Networks In Fourteenth Annual ACM Symposium on Paral lel Algorithms and Architectures (SPAA 02), pp. 238-247, 2002.
G.F. Italiano, S. Leonardi, G. Oriolo. Design of Networks in the Hose Model. Proc. of the 2nd International Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 65-76, Carleton Scientific Press, 2002.
L. Laura, S. Leonardi, G. Caldarelli and P. De Los Rios. A Multi-Layer Model of the WebGraph. 2nd International Workshop on Web Dynamics, Honolulu, Hawaii, May 2002.
M. Curcio, S. Leonardi and A. Vitaletti. An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. To appear in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX’02), San Francisco (CA), January 2002.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time on single and Parallel Machines. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 01), pp. 94-103, 2001.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Online Weighted Flow Time and Deadline Scheduling. Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX01), pp. 36-47, LNCS 2129, Springer-Verlag, 2001.
S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti. Approximation algorithms for bandwith and storage allocation problems under real-time constraints. Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000), LNCS 1974, pp 409-420, Springer-Verlag, 2000.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’00), pp. 448-557, 2000.
On Salesmen, Repairmen, Spieders and other Traveling Agents. In collaborazione con G. Ausiello e A. Marchetti-Spaccamela. Invited paper to the 4th Italian
Conference on Algorithms and Complexity (CIAC ’00), LNCS 1767, pp. 1-16, Springer-Verlag, 2000.
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migration. Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC 99), pp. 198-205, 1999.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes. To appear in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’99), pp. 438-447, 1999.
S. Leonardi and A. Vitaletti. Randomized lower bounds for online path coloring. Proceedings of the 2nd International Workshops on on Randomization and Approximation Techniques in Computer Science (RANDOM ’98), Lecture Notes in Computer Science 1518, Springer-Verlag, pp. 232-247, 1998.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), pp. 454-462, 1998.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call-Control Revisited. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA ’98), pp. 323-332, 1998.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proceedings of the 29th ACM Symposium on Theory of Computing (STOC 97), pp. 110-119, 1997. Invited paper to the special issue of Journal of Computer and System Sciences for STOC 97.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Proceedings of the 24th International Col loquium on Automata, Languages, and Programming (ICALP 97), pp. 516-526, Lecture Notes in Computer Science 1256, pp. 516-526, Springer-Verlang, 1997.
Y. Bartal, A. Fiat and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. Proc. of the 28th ACM Symposium on Theory of Computing (STOC 96), pp. 531-540, May 1996.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor scheduling with rejection. Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 96), pp. 95-103, 1996.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment. Proc. of the 23rd International Col loquium on Automata, Languages, and Programming (ICALP 96), Lecture Notes in Computer Science 1099, pp. 429-441, July 1996.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based control in rings. Proc. of the 15th ACM Symposium on Principles of Distributed Computing (PODC 96), p. 154, May 1996.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms for call control in optical networks. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA 96), Lecture Notes in Computer Science 1136, Springer-Verlag, pp. 431-444, 1996.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications to routing and scheduling. Proceedings of the 22nd International Col loquium on Automata, Languages and Programming (ICALP 95), Lecture Notes in Computer Science 944, Springer-Verlag, 1995, pp. 303-314.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Competitive algorithms for the on-line traveling-salesman. Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS 95), Lecture Notes in Computer Science 955, Springer-Verlag, 1995, pp. 206-217.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo. Serving requests with on-line routing. Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 94), Lecture Notes in Computer Science 824, Springer-Verlag, 1994, pp. 37-48.
P. Alimonti, S. Leonardi, A. Marchetti Spaccamela and X. Messeguer. Average case analysis of fully dynamic connectivity for directed graphs. Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 93), Lecture Notes in Computer Science 790, Springer Verlag, 1994, pp. 87-98.
Deletions:
Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses
for online combinatorial optimization problems. In Shang-Teng Huang, editor, SODA, pages
942–951. SIAM, 2008.
Vineet Goyal, Anupam Gupta, Stefano Leonardi, and R. Ravi. Pricing tree access networks with
connected backbones. In Proceedings of the 15th Annual European Symposium on Algorithms,
volume 4698 of Lecture Notes in Computer Science, pages 498–509. Springer, 2007.
Anupam Gupta, Jochen K ̈onemann, Stefano Leonardi, R. Ravi, and Guido Sch ̈afer. An efficient
cost-sharing mechanism for the prize-collecting steiner forest problem. In Nikhil Bansal, Kirk
Pruhs, and Clifford Stein, editors, SODA, pages 1153–1162. SIAM, 2007.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, and Christian Sohler. Estimating clus-
tering indexes in data streams. In Proceedings of the 15th Annual European Symposium on
Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 618–632. Springer, 2007.
Stefano Leonardi and Piotr Sankowski. Network formation games with local coalitions. In
Indranil Gupta and Roger Wattenhofer, editors, PODC, pages 299–305. ACM, 2007.
Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, and Ste-
fano Leonardi. New metrics for reputation management in p2p networks. In AIRWeb, 2007.
Roee Engelberg, Jochen K ̈onemann, Stefano Leonardi, and Joseph Naor. Cut problems in
graphs with a budget constraint. In Jos ́e R. Correa, Alejandro Hevia, and Marcos A. Kiwi,
editors, LATIN, volume 3887 of Lecture Notes in Computer Science, pages 435–446. Springer,
Lisa Fleischer, Jochen K ̈onemann, Stefano Leonardi, and Guido Sch ̈afer. Simple cost sharing
schemes for multicommodity rent-or-buy and stochastic steiner tree. In Jon M. Kleinberg,
editor, STOC, pages 663–670. ACM, 2006.
Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, and Stefano Millozzi.
Temporal analysis of the wikigraph. In Web Intel ligence, pages 45–51. IEEE Computer Society,
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and
Christian Sohler. Counting triangles in data streams. In Stijn Vansummeren, editor, PODS,
pages 253–262. ACM, 2006.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo Baeza-Yates.
Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings
of the Workshop on Web Mining and Web Usage Analysis (WebKDD), Pennsylvania, USA,
August 2006. ACM Press.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo A. Baeza-
Yates. Link-based characterization and detection of web spam. In AIRWeb, pages 1–8, 2006.
Yair Bartal, Stefano Leonardi, Gil Shallom, and Rene Sitters. On the value of preemption in
scheduling. In Josep D́ıaz, Klaus Jansen, Jose D. P. Rolim, and Uri Zwick, editors, APPROX-
RANDOM, volume 4110 of Lecture Notes in Computer Science, pages 39–48. Springer, 2006.
Luca Becchetti, Jochen Konemann, Stefano Leonardi, and Martin Pal. Sharing the cost more
efficiently: improved approximation for multicommodity rent-or-buy. In SODA, pages 375–384.
SIAM, 2005.
Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. Mining the inner
structure of the web graph. In AnHai Doan, Frank Neven, Robert McCann, and Geert Jan
Bex, editors, WebDB, pages 145–150, 2005.
[57] Jochen Koenemann, Stefano Leonardi and Guido Schaefer. A group-strategyproof mechanism
for Steiner forests. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA 2005, pp. 612-619, 2005
Alexander Kesselman, Stefano Leonardi, and Vincenzo Bonifaci. Game-theoretic analysis of
internet switching with selfish users. In Xiaotie Deng and Yinyu Ye, editors, WINE, volume
3828 of Lecture Notes in Computer Science, pages 236–245. Springer, 2005.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan van Zwam. From primal-dual
to cost shares and back: A stronger lp relaxation for the steiner forest problem. In Lúıs Caires,
Giuseppe F. Italiano, Lúıs Monteiro, Catuscia Palamidessi, and Moti Yung, editors, ICALP,
volume 3580 of Lecture Notes in Computer Science, pages 930–942. Springer, 2005.
Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling
against an adversarial network. In Proceedings of the 16th Annual ACM symposium on Paral lel
Algorithms (SPAA 2004), pp. 151 - 159.
cation games. In Proc. of the ACM Conference on Electronic Commerce 2004, pp. 242-243.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer and T. Vredeveld. Smoothening
helps: A Probabilistic Analysis of the Multi-Level Feedback Algorithm. Proc. of the 44th An-
nual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge (MA),
October 2003.
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer and Jop Sibeyin. Algorithms and
Experiments for the Webgraph. To appear in Proc. of the 11th Annual European Symposium
on Algorithms (ESA03), Budapest, September 2003.
ing. Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, Septem-
ber 2003.
[65] L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T.
Nandagopal and A. Vitaletti. Parallel Scheduling Problems in Next Generation Wireless Net-
works In Fourteenth Annual ACM Symposium on Paral lel Algorithms and Architectures (SPAA
02), pp. 238-247, 2002.
G.F. Italiano, S. Leonardi, G. Oriolo. Design of Networks in the Hose Model. To appear in
Proc. of the 2nd International Workshop on Approximation and Randomization Algorithms in
Communication Networks, pp. 65-76, Carleton Scientific Press, 2002.
L. Laura, S. Leonardi, G. Caldarelli and P. De Los Rios. A Multi-Layer Model of the WebGraph.
2nd International Workshop on Web Dynamics, Honolulu, Hawaii, May 2002.
M. Curcio, S. Leonardi and A. Vitaletti. An Experimental Study of Prefetching and Caching
Algorithms for the World Wide Web. To appear in Proceedings of the 4th Workshop on Algo-
rithm Engineering and Experiments (ALENEX’02), San Francisco (CA), January 2002.
on single and Parallel Machines. Proceedings of the 33rd Annual ACM Symposium on Theory
of Computing (STOC 01), pp. 94-103, 2001.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Online Weighted Flow Time
and Deadline Scheduling. Proceedings of the 4th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX01), pp. 36-47, LNCS 2129,
Springer-Verlag, 2001.
S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti. Approximation algorithms for bandwith
and storage allocation problems under real-time constraints. Proceedings of the 20th Conference
on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000),
LNCS 1974, pp 409-420, Springer-Verlag, 2000.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch with-
out Migration. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA ’00), pp. 448-557, 2000.
On Salesmen, Repairmen, Spieders and other Traveling Agents.
In collaborazione con G. Ausiello e A. Marchetti-Spaccamela. Invited paper to the 4th Italian
Conference on Algorithms and Complexity (CIAC ’00), LNCS 1767, pp. 1-16, Springer-Verlag,
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migra-
tion. Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC 99),
pp. 198-205, 1999.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes.
To appear in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA ’99), pp. 438-447, 1999.
S. Leonardi and A. Vitaletti. Randomized lower bounds for online path coloring. Proceedings
of the 2nd International Workshops on on Randomization and Approximation Techniques in
Computer Science (RANDOM ’98), Lecture Notes in Computer Science 1518, Springer-Verlag,
pp. 232-247, 1998.
Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), pp.
454-462, 1998.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call-
Control Revisited. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms
(SODA ’98), pp. 323-332, 1998.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proceedings of
the 29th ACM Symposium on Theory of Computing (STOC 97), pp. 110-119, 1997. Invited
paper to the special issue of Journal of Computer and System Sciences for STOC 97.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Proceedings of the 24th
International Col loquium on Automata, Languages, and Programming (ICALP 97), pp. 516-
526, Lecture Notes in Computer Science 1256, pp. 516-526, Springer-Verlang, 1997.
Y. Bartal, A. Fiat and S. Leonardi. Lower bounds for on-line graph problems with application to
on-line circuit and optical routing. Proc. of the 28th ACM Symposium on Theory of Computing
(STOC 96), pp. 531-540, May 1996.
scheduling with rejection. Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Al-
gorithms (SODA 96), pp. 95-103, 1996.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital invest-
ment. Proc. of the 23rd International Col loquium on Automata, Languages, and Programming
(ICALP 96), Lecture Notes in Computer Science 1099, pp. 429-441, July 1996.
control in rings. Proc. of the 15th ACM Symposium on Principles of Distributed Computing
(PODC 96), p. 154, May 1996.
for call control in optical networks. In Proceedings of the 4th Annual European Symposium on
Algorithms (ESA 96), Lecture Notes in Computer Science 1136, Springer-Verlag, pp. 431-444,
1996.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications
to routing and scheduling. Proceedings of the 22nd International Col loquium on Automata,
Languages and Programming (ICALP 95), Lecture Notes in Computer Science 944, Springer-
Verlag, 1995, pp. 303-314.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Competitive algorithms
for the on-line traveling-salesman. Proceedings of the 4th Workshop on Algorithms and Data
Structures (WADS 95), Lecture Notes in Computer Science 955, Springer-Verlag, 1995, pp.
206-217.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo. Serving requests with on-
line routing. Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 94),
Lecture Notes in Computer Science 824, Springer-Verlag, 1994, pp. 37-48.
P. Alimonti, S. Leonardi, A. Marchetti Spaccamela and X. Messeguer. Average case analysis
of fully dynamic connectivity for directed graphs. Proceedings of the 19th International Work-
shop on Graph-Theoretic Concepts in Computer Science (WG 93), Lecture Notes in Computer
Science 790, Springer Verlag, 1994, pp. 87-98.
Edited on 2008-05-13 07:35:22 by StefanoLeonardi
Additions:
Conference Publications
Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses
for online combinatorial optimization problems. In Shang-Teng Huang, editor, SODA, pages
942–951. SIAM, 2008.
Vineet Goyal, Anupam Gupta, Stefano Leonardi, and R. Ravi. Pricing tree access networks with
connected backbones. In Proceedings of the 15th Annual European Symposium on Algorithms,
volume 4698 of Lecture Notes in Computer Science, pages 498–509. Springer, 2007.
Anupam Gupta, Jochen K ̈onemann, Stefano Leonardi, R. Ravi, and Guido Sch ̈afer. An efficient
cost-sharing mechanism for the prize-collecting steiner forest problem. In Nikhil Bansal, Kirk
Pruhs, and Clifford Stein, editors, SODA, pages 1153–1162. SIAM, 2007.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, and Christian Sohler. Estimating clus-
tering indexes in data streams. In Proceedings of the 15th Annual European Symposium on
Algorithms, volume 4698 of Lecture Notes in Computer Science, pages 618–632. Springer, 2007.
Stefano Leonardi and Piotr Sankowski. Network formation games with local coalitions. In
Indranil Gupta and Roger Wattenhofer, editors, PODC, pages 299–305. ACM, 2007.
Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, and Ste-
fano Leonardi. New metrics for reputation management in p2p networks. In AIRWeb, 2007.
Roee Engelberg, Jochen K ̈onemann, Stefano Leonardi, and Joseph Naor. Cut problems in
graphs with a budget constraint. In Jos ́e R. Correa, Alejandro Hevia, and Marcos A. Kiwi,
editors, LATIN, volume 3887 of Lecture Notes in Computer Science, pages 435–446. Springer,
2006.
Lisa Fleischer, Jochen K ̈onemann, Stefano Leonardi, and Guido Sch ̈afer. Simple cost sharing
schemes for multicommodity rent-or-buy and stochastic steiner tree. In Jon M. Kleinberg,
editor, STOC, pages 663–670. ACM, 2006.
Luciana S. Buriol, Carlos Castillo, Debora Donato, Stefano Leonardi, and Stefano Millozzi.
Temporal analysis of the wikigraph. In Web Intel ligence, pages 45–51. IEEE Computer Society,
2006.
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and
Christian Sohler. Counting triangles in data streams. In Stijn Vansummeren, editor, PODS,
pages 253–262. ACM, 2006.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo Baeza-Yates.
Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings
of the Workshop on Web Mining and Web Usage Analysis (WebKDD), Pennsylvania, USA,
August 2006. ACM Press.
Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, and Ricardo A. Baeza-
Yates. Link-based characterization and detection of web spam. In AIRWeb, pages 1–8, 2006.
Yair Bartal, Stefano Leonardi, Gil Shallom, and Rene Sitters. On the value of preemption in
scheduling. In Josep D́ıaz, Klaus Jansen, Jose D. P. Rolim, and Uri Zwick, editors, APPROX-
RANDOM, volume 4110 of Lecture Notes in Computer Science, pages 39–48. Springer, 2006.
Luca Becchetti, Jochen Konemann, Stefano Leonardi, and Martin Pal. Sharing the cost more
efficiently: improved approximation for multicommodity rent-or-buy. In SODA, pages 375–384.
SIAM, 2005.
Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. Mining the inner
structure of the web graph. In AnHai Doan, Frank Neven, Robert McCann, and Geert Jan
Bex, editors, WebDB, pages 145–150, 2005.
[57] Jochen Koenemann, Stefano Leonardi and Guido Schaefer. A group-strategyproof mechanism
for Steiner forests. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA 2005, pp. 612-619, 2005
Alexander Kesselman, Stefano Leonardi, and Vincenzo Bonifaci. Game-theoretic analysis of
internet switching with selfish users. In Xiaotie Deng and Yinyu Ye, editors, WINE, volume
3828 of Lecture Notes in Computer Science, pages 236–245. Springer, 2005.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan van Zwam. From primal-dual
to cost shares and back: A stronger lp relaxation for the steiner forest problem. In Lúıs Caires,
Giuseppe F. Italiano, Lúıs Monteiro, Catuscia Palamidessi, and Moti Yung, editors, ICALP,
volume 3580 of Lecture Notes in Computer Science, pages 930–942. Springer, 2005.
Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide: Scheduling
against an adversarial network. In Proceedings of the 16th Annual ACM symposium on Paral lel
Algorithms (SPAA 2004), pp. 151 - 159.
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility lo-
cation games. In Proc. of the ACM Conference on Electronic Commerce 2004, pp. 242-243.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer and T. Vredeveld. Smoothening
helps: A Probabilistic Analysis of the Multi-Level Feedback Algorithm. Proc. of the 44th An-
nual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge (MA),
October 2003.
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer and Jop Sibeyin. Algorithms and
Experiments for the Webgraph. To appear in Proc. of the 11th Annual European Symposium
on Algorithms (ESA03), Budapest, September 2003.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Schedul-
ing. Proc. of the 11th Annual European Symposium on Algorithms (ESA03), Budapest, Septem-
ber 2003.
[65] L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T.
Nandagopal and A. Vitaletti. Parallel Scheduling Problems in Next Generation Wireless Net-
works In Fourteenth Annual ACM Symposium on Paral lel Algorithms and Architectures (SPAA
02), pp. 238-247, 2002.
G.F. Italiano, S. Leonardi, G. Oriolo. Design of Networks in the Hose Model. To appear in
Proc. of the 2nd International Workshop on Approximation and Randomization Algorithms in
Communication Networks, pp. 65-76, Carleton Scientific Press, 2002.
L. Laura, S. Leonardi, G. Caldarelli and P. De Los Rios. A Multi-Layer Model of the WebGraph.
2nd International Workshop on Web Dynamics, Honolulu, Hawaii, May 2002.
M. Curcio, S. Leonardi and A. Vitaletti. An Experimental Study of Prefetching and Caching
Algorithms for the World Wide Web. To appear in Proceedings of the 4th Workshop on Algo-
rithm Engineering and Experiments (ALENEX’02), San Francisco (CA), January 2002.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time
on single and Parallel Machines. Proceedings of the 33rd Annual ACM Symposium on Theory
of Computing (STOC 01), pp. 94-103, 2001.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Online Weighted Flow Time
and Deadline Scheduling. Proceedings of the 4th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX01), pp. 36-47, LNCS 2129,
Springer-Verlag, 2001.
S. Leonardi, A. Marchetti-Spaccamela and A. Vitaletti. Approximation algorithms for bandwith
and storage allocation problems under real-time constraints. Proceedings of the 20th Conference
on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000),
LNCS 1974, pp 409-420, Springer-Verlag, 2000.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch with-
out Migration. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA ’00), pp. 448-557, 2000.
On Salesmen, Repairmen, Spieders and other Traveling Agents.
In collaborazione con G. Ausiello e A. Marchetti-Spaccamela. Invited paper to the 4th Italian
Conference on Algorithms and Complexity (CIAC ’00), LNCS 1767, pp. 1-16, Springer-Verlag,
2000.
B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migra-
tion. Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC 99),
pp. 198-205, 1999.
M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes.
To appear in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA ’99), pp. 438-447, 1999.
S. Leonardi and A. Vitaletti. Randomized lower bounds for online path coloring. Proceedings
of the 2nd International Workshops on on Randomization and Approximation Techniques in
Computer Science (RANDOM ’98), Lecture Notes in Computer Science 1518, Springer-Verlag,
pp. 232-247, 1998.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems.
Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 98), pp.
454-462, 1998.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line Randomized Call-
Control Revisited. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms
(SODA ’98), pp. 323-332, 1998.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proceedings of
the 29th ACM Symposium on Theory of Computing (STOC 97), pp. 110-119, 1997. Invited
paper to the special issue of Journal of Computer and System Sciences for STOC 97.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Proceedings of the 24th
International Col loquium on Automata, Languages, and Programming (ICALP 97), pp. 516-
526, Lecture Notes in Computer Science 1256, pp. 516-526, Springer-Verlang, 1997.
Y. Bartal, A. Fiat and S. Leonardi. Lower bounds for on-line graph problems with application to
on-line circuit and optical routing. Proc. of the 28th ACM Symposium on Theory of Computing
(STOC 96), pp. 531-540, May 1996.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor
scheduling with rejection. Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Al-
gorithms (SODA 96), pp. 95-103, 1996.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital invest-
ment. Proc. of the 23rd International Col loquium on Automata, Languages, and Programming
(ICALP 96), Lecture Notes in Computer Science 1099, pp. 429-441, July 1996.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based
control in rings. Proc. of the 15th ACM Symposium on Principles of Distributed Computing
(PODC 96), p. 154, May 1996.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms
for call control in optical networks. In Proceedings of the 4th Annual European Symposium on
Algorithms (ESA 96), Lecture Notes in Computer Science 1136, Springer-Verlag, pp. 431-444,
1996.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications
to routing and scheduling. Proceedings of the 22nd International Col loquium on Automata,
Languages and Programming (ICALP 95), Lecture Notes in Computer Science 944, Springer-
Verlag, 1995, pp. 303-314.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Competitive algorithms
for the on-line traveling-salesman. Proceedings of the 4th Workshop on Algorithms and Data
Structures (WADS 95), Lecture Notes in Computer Science 955, Springer-Verlag, 1995, pp.
206-217.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo. Serving requests with on-
line routing. Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 94),
Lecture Notes in Computer Science 824, Springer-Verlag, 1994, pp. 37-48.
P. Alimonti, S. Leonardi, A. Marchetti Spaccamela and X. Messeguer. Average case analysis
of fully dynamic connectivity for directed graphs. Proceedings of the 19th International Work-
shop on Graph-Theoretic Concepts in Computer Science (WG 93), Lecture Notes in Computer
Science 790, Springer Verlag, 1994, pp. 87-98.
Debora Donato, Luigi Laura, Stefano Leonardi, and Stefano Millozzi. The web as a graph:
How far we are. ACM Trans. Internet Techn., 7(1), 2007.
Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. J.
Comput. Syst. Sci., 73(6):875–891, 2007.
Yair Bartal, Amos Fiat, and 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.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schaefer, and Tjark
Vredeveld. Average-case and smoothed competitive analysis of the multilevel feedback algo-
rithm. Math. Oper. Res., 31(1):85–108, 2006.
A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Cal-
darelli. Preferential attachment in the growth of social networks: The internet encyclopedia
wikipedia. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 74(3), 2006.
Giuseppe F. Italiano, Stefano Leonardi, and Gianpaolo Oriolo. Design of trees in the hose
model: The balanced case. Oper. Res. Lett., 34(6):601–606, 2006.
Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo San-
tini, and Sebastiano Vigna. A reference collection for web spam. SIGIR Forum, 40(2):11–24,
2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online
weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339–352, 2006.
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N.
Diggavi, S. Muthukrishnan, and Thyagara jan Nandagopal. Parallel scheduling problems in
next generation wireless networks. Networks, 45(1):9–22, 2005.
L. Becchetti, Stefano Leonardi. Non-Clairvoyant Scheduling to Minimize the Average flow time
on single and Parallel Machines. Journal of the ACM,(51)4, pp. 517-539, 2004. A preliminary
version in [69].
S. Leonardi, Guido Schaefer. Cross-monotonic cost-sharing methods for connected facility lo-
cation games. Theoretical Computer Science, 326 (2004) 431-442.
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Semi-Clairvoyant Schedul-
ing. Theoretical Computer Science, special issue in honour of Steve Seiden, 324(2-3): 325-335
(2004).
D. Donato, L. Laura, S. Leonardi, S. Millozzi. Large Scale properties of the Webgraph. European
Journal of Physics B, Vol 38, n. 2, pp. 239-243, 2004.
L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch
without Migration. Journal of Computer and System Sciences 68(2004) pp. 80-95.
[27] M.R. Henzinger and S. Leonardi. Scheduling multicasts on unit capacity trees and meshes.
Journal of Computer and System Sciences 66(2003) pp. 567-611.
[28] B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the Flow Time without Migra-
tion. SIAM Journal on computing, 31(5), pp. 1370 - 1382, 2001.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Algorithms for the on-line
traveling-salesman. Algorithmica, Vol 9, n. 4, pp. 560-581, 2001.
S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems.
Journal of the ACM, Vol. 47, n. 6, 2000.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Ros ́en. On-line Randomized Call-
Control Revisited. SIAM Journal on Computing 31(1), pp. 86-112, 2001.
Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, L. Stougie and J. Sgall. Multiprocessor
scheduling with rejection. SIAM Journal on Discrete Mathematics, Vol 13, n. 1, pp. 64-71,
2000.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Sci-
ence - invited paper to the special issue for ICALP ’97, 221 (1999) 19-39.
Susanne Albers and Stefano Leonardi. Online Algorithms. To appear in ACM Computing Sur-
veys - Symposium on Theoretical Computer Science: A Perspective, Volume 31 , No. 3, 1999.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with application to
routing and scheduling. Algorithmica 24: 29-49, 1999.
B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosen. On-line competititive algorithms
for call control in optical networks. Algorithmica 31(1), pp. 29-43, 2001.
Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment.
Algorithmica - special issue on Computational Finance , 25:22-36, 1999.
E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela and N. Santoro. Efficient token-based
control in rings. Information Processing Letter 66 (1998), pp. 175-180.
M.A. Bonuccelli and S. Leonardi. Scheduling broadcasts in wireless networks. Telecommunica-
tion Systems, special issue on Satel lite Communication Systems and Networks, Vol. 8, Nos. 2-4
(1997), pp. 211-227.
B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler and P.Widmayer. Enclosing a
set of ob jects by two minimum area rectangles. Journal of Algorithms, Vol 21, n.2, 1996, pp.
520-541.
P. Alimonti, S. Leonardi and A. Marchetti Spaccamela. Average case analysis of fully dynamic
reachability for directed graphs. RAIRO Journal on Theoretical Informatics and Applications,
vol 30, n. 4, 1996, pp. 305-318.
Ozalp Babaoglu, Mark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad
Patents
S.N. Diggavi, L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T.
Nandaghopol and A. Vitaletti. Method for wireless dowling scheduling, United States pro-
visional patent application.
Deletions:
Ozalp Babaoglu, M ́ark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad
Oldest known version of this page was edited on 2008-05-13 07:20:38 by StefanoLeonardi []
Page view:
Publications
Editorial Activity
Gianna Del Corso and Stefano Leonardi. Algorithmic and Numerical aspects in Web search.
Internet Mathematics, To appear, 2008.
Dimitris Achlioptas and Stefano Leonardi. Special issue on algorithms and models for the
web-graph. Internet Mathematics, 2(3), 2005.
Ozalp Babaoglu, M ́ark Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad
P. A. van Moorsel, and Maarten van Steen, editors. Self-star Properties in Complex Informa-
tion Systems, Conceptual and Practical Foundations [the book is a result from a workshop at
Bertinoro, Italy, Summer 2004], volume 3460 of Lecture Notes in Computer Science, Springer,
2005.
Gerth Stølting Brodal and Stefano Leonardi, editors. Algorithms - ESA 2005, 13th Annual
European Symposium, Palma de Mal lorca, Spain, October 3-6, 2005, Proceedings, volume 3669
of Lecture Notes in Computer Science. Springer, 2005.
Klaus Jansen, Stefano Leonardi and Vijay V. Vazirani. Approximation Algorithms for Combi-
natorial Optimization. 5th International Workshop, APPROX 2002, Rome, Italy, September
17-21, 2002, Proceedings, Springer 2002.
On-line Algorithms, S. Leonardi and A. Marchetti-Spaccamela eds. Theoretical Computer Sci-
ence - special issue for OLA 98 268(1), 2001.
Book Chapters
D. Donato, L. Laura, S. Leonardi and S. Millozzi: Modeling the Webgraph: how far we are. In G.
Caldarelli and A. Vespignani (eds) "Large structure and Dynamics of Complex Networks", World
Scientific pp. 133-161. 2007.
S. Leonardi. A simpler proof of preemptive total flow time approximation on parallel machines.
In Efficient Approximation and On-line Algorithms, Bampis, Evripidis; Jansen, Klaus; Kenyon,
Claire (Eds.), Lecture Notes in Computer Science, pp. 203 - 212, Springer, 2006.
S. Leonardi. On-line network routing. In Online Algorithms: the state of the art, A. Fiat and G.
Woeginger eds., Lecture Notes in Computer Science 1442, pp. 242-267, Springer-Verlag, 1998.
Journal Publications
Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo A. Baeza-Yates, and Stefano
Leonardi. Link analysis for web spam detection. ACM Transactions on the Web (TWEB),
2(1), 2008.
Jochen Koenemann, Stefano Leonardi, Guido Schaefer, and Stefan H. M. van Zwam. A group-
strategyproof cost sharing mechanism for the steiner forest game. SIAM Journal on Computing,
37(5):1319–1341, 2008.
Roee Engelberg, Jochen Koenemann, Stefano Leonardi, and Joseph Naor. Cut problems in
graphs with a budget constraint. J. Discrete Algorithms, 5(2):262–279, 2007.
Luca Becchetti, Jochen Koenemann, Stefano Leonardi, and Martin Pal. Sharing the cost more
efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on
Algorithms, 3(2), 2007.