Stefano Leonardi

Publications :: PageIndex :: Login/Register

Conference Publications


  1. Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski. Revenue Maximizing Envy-free Multi-unit Auctions with Budgets. To appear in 13th ACM Conference on Electronic Commerce 2012, EC-2012, Valencia, June 2012.
  2. Stefano Leonardi and Tim Roughgarden. Prior-Free Auctions with Ordered Bidders. To appear in Proc. of the 44th ACM Symposium on Theory of Computing (STOC 2012), New York, May 2012.
  3. Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis and Stefano Leonardi. Online Team Formation in Social Networks. To appear in Proc. of the World Wide Web 2012 Conference, Lyon, April 2012.
  4. Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering. Foundations of Software Technology and theoretical Computer Science, December 2011, Mumbay, India.
  5. Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski: Combinatorial Auctions with Budgets. To appear in Proc. of ACM Conference on Electronic Commerce, EC 2011.
  6. Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski: Stochastic query covering. ACM Conference on Web Search and Data Mining, WSDM 2011: 725-734. Best poster award.
  7. Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis and Stefano Leonardi. Power in Unity: Forming Teams in Large-Scale Community Systems. Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, 2010.
  8. Luca Becchetti, Ilaria Bordino, Stefano Leonardi and Adi Rosen. Fully-Decentralized Computation of Aggregates over Data Streams (Best Paper Award). Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques (StreamKDD 2010), pages 1 - 9, 2010.
  9. Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski. Online Network Design with Outliers. Proc. of 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, pages 114 - 126, 2010.
  10. Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre. Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010.
  11. Ilaria Bordino, Debora Donato, Aristides Gionis, and Stefano Leonardi. Mining large networks with subgraph counting. To appear in Proceedings of the Eighth IEEE International Conference on Data Mining (ICDM 2008), Pisa, Italy, Dec. 2008,
  12. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh. Set Covering with Our Eyes Closed. To appear in 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008).
  13. Debora Donato, Stefano Leonardi and Mario Paniccia. Combining Transitive Trust and Negative Opinions for better Reputation Management in Social Networks. To appear in KDD workshop on Social Network Mining and Analysis (SNAKDD 2008).
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. Stefano Leonardi and Piotr Sankowski. Network formation games with local coalitions. In Indranil Gupta and Roger Wattenhofer, editors, PODC, pages 299–305. ACM, 2007.
  19. Debora Donato, Mario Paniccia, Maddalena Selis, Carlos Castillo, Giovanni Cortese, and Stefano Leonardi. New metrics for reputation management in p2p networks. In AIRWeb, 2007.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. 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.
  36. 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.
  37. 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.
  38. 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.
  39. 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.
  40. 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.
  41. 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 0 , pp. 94-103, 2001.
  42. 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 (APPROX0 , pp. 36-47, LNCS 2129, Springer-Verlag, 2001.
  43. 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.
  44. 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.
  45. 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.
  46. 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.
  47. 1) 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.
  48. 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.
  49. 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.
  50. 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.
  51. 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 to the special issue of Journal of Computer and System Sciences for STOC 97.
  52. 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.
  53. 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 and), pp. 531-540, May 1996.
  54. 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.
  55. 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.
  56. 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. ω
  57. 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 and), Lecture Notes in Computer Science 1136, Springer-Verlag, pp. 431-444, 1996.
  58. 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.
  59. 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.
  60. 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.
  61. 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.
Page History :: 2012-04-06 13:43:48 XML :: Owner: StefanoLeonardi :: Search:
Valid XHTML 1.0 Transitional∞ :: Valid CSS∞ :: Powered by Wikka Wakka Wiki 1.1.6.3∞
Page was generated in 0.0646 seconds