Researcher Portfolio
Dr. Leonardi, Stefano
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44913
External references
WorldCat
Search for Leonardi, Stefano
Google Scholar
Search for Leonardi, Stefano
Publications
: Anagnostopoulos, A., Becchetti, L., Bordino, I., Leonardi, S., Mele, I., & Sankowski, P. (2015). Stochastic Query Covering for Fast Approximate Document Retrieval. ACM Transactions on Information Systems, 33(3): 11, pp. 1-35. doi:10.1145/2699671. [PubMan] : Anagnostopoulos, A., Grandoni, F., Leonardi, S., & Wiese, A. (2014). A Mazing 2+ε Approximation for Unsplittable Flow on a Path. In C. Chekuri (Ed. ), Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 26-41). Philadelphia, PA: SIAM. doi:10.1137/1.9781611973402.3. [PubMan] : Anagnostopoulos, A., Grandoni, F., Leonardi, S., & Wiese, A. (2013). Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. In M. Goemans, & J. Correa (Eds. ), Integer Programming and Combinatorial Optimization (pp. 25-36). Berlin: Springer. [PubMan] : Bhattacharya, S., Koutsoupias, E., Kulkarni, J., Leonardi, S., Roughgarden, T., & Xu, X. (2013). Near-optimal Multi-unit Auctions with Ordered Bidders. In M. Kearns, & P. McAfee (Eds. ), EC'13 (pp. 91-102). New York, NY: ACM. doi:10.1145/2482540.2482555. [PubMan] : Donato, D., Laura, L., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2006). Algorithms and Experiments for the Webgraph. Journal of Graph Algorithms and Applications, 10(2), 219-236. [PubMan] : Bartal, Y., Leonardi, S., Shallom, G., & Sitters, R. (2006). On the value of preemption in scheduling. In 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX (pp. 39-48). Berlin, Germany: Springer. [PubMan] : Dementiev, R., Kettner, L., & Sanders, P. (2005). STXXL: Standard Template Library for XXL Data Sets. In Algorithms - ESA 2005: 13th Annual European Symposium (ESA 2005) (pp. 640-651). Berlin, Germany: Springer. [PubMan] : Kovacs, A. (2005). Fast monotone 3-approximation algorithm for scheduling related machines. In Algorithms - ESA 2005: 13th Annual European Symposium (pp. 616-627). Berlin, Germany: Springer. [PubMan] : Berberich, K., Vazirgiannis, M., & Weikum, G. (2004). T-Rank: Time-aware Authority Ranking. In Algorithms and Models for the Web-graph: Third International Workshop, WAW 2004 (pp. 131-142). Berlin, Germany: Springer. [PubMan] : Leonardi, S., & Schäfer, G. (2004). Cross-monotonic cost sharing methods for connected facility location games. In EC'04: proceedings of the 5th ACM Conference on Electronic Commerce; New York, New York, USA, May 17-20, 2004 (pp. 242-243). New York, USA: ACM. [PubMan] : Leonardi, S., & Schäfer, G. (2004). Cross-monotonic cost sharing methods for connected facility location games. Theoretical Computer Science, 326, 431-442. [PubMan] : Laura, L., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2003). Algorithms and Experiments for the Webgraph. In Algorithms - ESA 2003: 11th Annual European Symposium (pp. 703-714). Berlin, Germany: Springer. [PubMan] : Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., & Schäfer, G. (2003). Scheduling to minimize flow time metrics. In International Parallel and Distributed Processing Symposium (IPDPS-03) (pp. 223b-CDROM). Los Alamitos, USA: IEEE. [PubMan] : Henzinger, M. R., & Leonardi, S. (2003). Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences, 66, 567-611. [PubMan] : Schäfer, G., & Leonardi, S.(2003). Cross-monotonic cost sharing methods for connected facility location games (MPI-I-2003-1-017). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Schäfer, G., Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., & Vredeveld, T.(2003). Average case and smoothed competitive analysis of the multi-level feedback algorithm (MPI-I-2003-1-014). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Schäfer, G., & Vredeveld, T. (2003). Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. In 44th Annual Symposium on Foundations of Computer Science (FOCS-03) (pp. 462-471). New York, USA: IEEE. [PubMan] : Albers, S., Garg, N., & Leonardi, S. (2000). Minimizing stall time in single and parallel disk systems. Journal of the ACM, 47(6), 969-986. [PubMan] : Albers, S., Garg, N., & Leonardi, S. (1998). Minimizing stall time in single and parallel disk systems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98) (pp. 454-462). New York, USA: ACM Press. [PubMan] : Henzinger, M. R., & Leonardi, S.(1998). Scheduling multicasts on unit-capacity trees and meshes (MPI-I-1998-1-015). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Fiat, A., & Leonardi, S.(1997). On-line network routing - a survey (MPI-I-97-1-026). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Garg, N., Albers, S., & Leonardi, S.(1997). Minimizing stall time in single and parallel disk systems (MPI-I-1997-1-024). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Leonardi, S., & Marchetti-Spaccamela, A. P.(1997). Randomized on-line call control revisited (MPI-I-97-1-023). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan]