On the Embedding of Refinements of 2-dimensional Grids. - Fabrizio d'Amore; Luca Becchetti; Sergei L. Bezrukov; Alberto Marchetti-Spaccamela; M. Ottaviani; Robert Preis; Markus Röttger; Ulf-Peter Schroeder (Euro-Par, 1997)

Lower Bounds for the Virtual Path Layout Problem in ATM Networks. - Luca Becchetti; Carlo Gaibisso (SOFSEM, 1997)

Scheduling to minimize average stretch without migration. - Luca Becchetti; Stefano Leonardi 001; S. Muthukrishnan 001 (SODA, 2000)

A Java Implementation of a Reliable Multicast File Transfer Protocol: Design and Evaluation. - Luca Becchetti; Mauro Draoli; Carlo Gaibisso; Flavio Lombardi (IMSA, 2001)

Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. - Luca Becchetti; Stefano Leonardi 001 (STOC, 2001)

Enhancing IP service provision over heterogeneous wireless networks: a path toward 4G. - Luca Becchetti; Francesco Delli Priscoli; Tiziano Inzerilli; Petri Mähönen; Luis Muñoz (IEEE Commun. Mag., 2001)

On the design of efficient ATM routing schemes. - Luca Becchetti; Paola Bertolazzi; Carlo Gaibisso; Giorgio Gambosi (Theor. Comput. Sci., 2002)

Approximation algorithms for routing and call scheduling in all-optical chains and rings. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2002)

Scheduling to Minimize Flow Time Metrics. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer (IPDPS, 2003)

Modeling Locality: A Probabilistic Analysis of LRU and FWF. - Luca Becchetti (ESA, 2004)

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. - Luca Becchetti; Stefano Leonardi 001 (J. ACM, 2004)

Average stretch without migration. - Luca Becchetti; Stefano Leonardi 001; S. Muthukrishnan 001 (J. Comput. Syst. Sci., 2004)

Approximating call-scheduling makespan in all-optical networks. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (J. Discrete Algorithms, 2004)

Semi-clairvoyant scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Theor. Comput. Sci., 2004)

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer; Tjark Vredeveld (Algorithms for Optimization with Incomplete Information, 2005)

Parallel scheduling problems in next generation wireless networks. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Andrea Vitaletti; Suhas N. Diggavi; S. Muthukrishnan 001; Thyagarajan Nandagopal (Networks, 2005)

Link-Based Characterization and Detection of Web Spam. - Luca Becchetti; Carlos Castillo 001; Debora Donato; Stefano Leonardi 001; Ricardo A. Baeza-Yates (AIRWeb, 2006)

The distribution of pageRank follows a power-law only for particular values of the damping factor. - Luca Becchetti; Carlos Castillo 001 (WWW, 2006)

Online weighted flow time and deadline scheduling. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (J. Discrete Algorithms, 2006)

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Guido Schäfer; Tjark Vredeveld (Math. Oper. Res., 2006)

A reference collection for web spam. - Carlos Castillo 001; Debora Donato; Luca Becchetti; Paolo Boldi; Stefano Leonardi 001; Massimo Santini 001; Sebastiano Vigna (SIGIR Forum, 2006)

Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. - Luca Becchetti; Jochen Könemann; Stefano Leonardi 001; Martin Pál (ACM Trans. Algorithms, 2007)

Efficient semi-streaming algorithms for local triangle counting in massive graphs. - Luca Becchetti; Paolo Boldi; Carlos Castillo 001; Aristides Gionis (KDD, 2008)

Self-Adaptive Recommendation Systems: Models and Experimental Analysis. - Luca Becchetti; Ugo Maria Colesanti; Alberto Marchetti-Spaccamela; Andrea Vitaletti (SASO, 2008)

Link analysis for Web spam detection. - Luca Becchetti; Carlos Castillo 001; Debora Donato; Ricardo Baeza-Yates; Stefano Leonardi 001 (ACM Trans. Web, 2008)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2008)

Competitive Analysis of Aggregate Max in Windowed Streaming. - Luca Becchetti; Elias Koutsoupias (ICALP (1), 2009)

Latency-constrained aggregation in sensor networks. - Luca Becchetti; Alberto Marchetti-Spaccamela; Andrea Vitaletti; Peter Korteweg; Martin Skutella; Leen Stougie (ACM Trans. Algorithms, 2009)

Power in unity: forming teams in large-scale community systems. - Aris Anagnostopoulos; Luca Becchetti; Carlos Castillo 001; Aristides Gionis; Stefano Leonardi 001 (CIKM, 2010)

A lightweight privacy preserving SMS-based recommendation system for mobile users. - Elisa Baglioni; Luca Becchetti; Lorenzo Bergamini; Ugo Maria Colesanti; Luca Filipponi; Andrea Vitaletti; Giuseppe Persiano (RecSys, 2010)

An optimization framework for query recommendation. - Aris Anagnostopoulos; Luca Becchetti; Carlos Castillo 001; Aristides Gionis (WSDM, 2010)

Fully decentralized computation of aggregates over data streams. - Luca Becchetti; Ilaria Bordino; Stefano Leonardi 001; Adi Rosén (SIGKDD Explor., 2010)

Efficient algorithms for large-scale local triangle counting. - Luca Becchetti; Paolo Boldi; Carlos Castillo 001; Aristides Gionis (ACM Trans. Knowl. Discov. Data, 2010)

Privacy-Preserving Environment Monitoring in Networks of Mobile Devices. - Lorenzo Bergamini; Luca Becchetti; Andrea Vitaletti (Networking Workshops, 2011)

Stochastic query covering. - Aris Anagnostopoulos; Luca Becchetti; Stefano Leonardi 001; Ida Mele; Piotr Sankowski (WSDM, 2011)

Information Spreading in Opportunistic Networks is Fast - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (CoRR, 2011)

Streaming techniques and data aggregation in networks of tiny artefacts. - Luca Becchetti; Ioannis Chatzigiannakis; Yiannis Giannakopoulos (Comput. Sci. Rev., 2011)

Recommending items in pervasive scenarios: models and experimental analysis. - Luca Becchetti; Ugo Maria Colesanti; Alberto Marchetti-Spaccamela; Andrea Vitaletti (Knowl. Inf. Syst., 2011)

First Experiences with the Implementation and Evaluation of Population Protocols on Physical Devices. - Luca Becchetti; Lorenzo Bergamini; Francesco Ficarola; Francesco Salvatore; Andrea Vitaletti (GreenCom, 2012)

Population protocols on real social networks. - Luca Becchetti; Lorenzo Bergamini; Francesco Ficarola; Andrea Vitaletti (SNS, 2012)

Online team formation in social networks. - Aris Anagnostopoulos; Luca Becchetti; Carlos Castillo 001; Aristides Gionis; Stefano Leonardi 001 (WWW, 2012)

Privacy support in people-centric sensing. - Luca Becchetti; Luca Filipponi; Andrea Vitaletti (J. Commun., 2012)

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. - Luca Becchetti; Vincenzo Bonifaci; Michael Dirnberger; Andreas Karrenbauer; Kurt Mehlhorn (ICALP (2), 2013)

Simple Dynamics for Majority Consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (CoRR, 2013)

A lightweight privacy preserving SMS-based recommendation system for mobile users. - Luca Becchetti; Lorenzo Bergamini; Ugo Maria Colesanti; Luca Filipponi; Giuseppe Persiano; Andrea Vitaletti (Knowl. Inf. Syst., 2014)

Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2014)

P. polycephalum Can Compute Shortest Paths. - Luca Becchetti; Vincenzo Bonifaci; Michael Dirnberger; Andreas Karrenbauer; Kurt Mehlhorn; Girish Varma (BICT, 2015)

The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing. - Aris Anagnostopoulos; Luca Becchetti; Adriano Fazzone; Ida Mele; Matteo Riondato (SIGMOD Conference, 2015)

Plurality Consensus in the Gossip Model. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri (SODA, 2015)

Probabilistic Self-Stabilization. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale (CoRR, 2015)

Inefficiency of Games with Social Context. - Aris Anagnostopoulos; Luca Becchetti; Bart de Keijzer; Guido Schäfer (Theory Comput. Syst., 2015)

Stochastic Query Covering for Fast Approximate Document Retrieval. - Aris Anagnostopoulos; Luca Becchetti; Ilaria Bordino; Stefano Leonardi 001; Ida Mele; Piotr Sankowski (ACM Trans. Inf. Syst., 2015)

Stabilizing Consensus with Many Opinions. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SODA, 2016)

Flow Time Minimization. - Luca Becchetti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Kirk Pruhs (Encyclopedia of Algorithms, 2016)

Friend or Foe? Population Protocols can perform Community Detection. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (CoRR, 2017)

Tour recommendation for groups. - Aris Anagnostopoulos; Reem Atassi; Luca Becchetti; Adriano Fazzone; Fabrizio Silvestri (Data Min. Knowl. Discov., 2017)

Simple dynamics for plurality consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (Distributed Comput., 2017)

Performance improvements for search systems using an integrated cache of lists + intersections. - Gabriel Tolosa; Esteban Feuerstein; Luca Becchetti; Alberto Marchetti-Spaccamela (Inf. Retr. J., 2017)

Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation. - Luca Becchetti; Vincenzo Bonifaci; Emanuele Natale (AAMAS, 2018)

Average Whenever You Meet: Opportunistic Protocols for Community Detection. - Luca Becchetti; Andrea Clementi; Pasin Manurangsi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (ESA, 2018)

Biological Random Walks: Integrating heterogeneous data in disease gene prioritization. - Michele Gentili; Leonardo Martini; Manuela Petti; Lorenzo Farina; Luca Becchetti (CIBCB, 2019)

Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. - Luca Becchetti; Marc Bury; Vincent Cohen-Addad; Fabrizio Grandoni 001; Chris Schwiegelshohn (STOC, 2019)

Principal Fairness: Removing Bias via Projections. - Aris Anagnostopoulos; Luca Becchetti; Matteo Böhm; Adriano Fazzone; Stefano Leonardi 001; Cristina Menghini; Chris Schwiegelshohn (CoRR, 2019)

Self-stabilizing repeated balls-into-bins. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Gustavo Posta (Distributed Comput., 2019)

Spectral Relaxations and Fair Densest Subgraphs. - Aris Anagnostopoulos; Luca Becchetti; Adriano Fazzone; Cristina Menghini; Chris Schwiegelshohn (CIKM, 2020)

Finding a Bounded-Degree Expander Inside a Dense One. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SODA, 2020)

Find Your Place: Simple Distributed Algorithms for Community Detection. - Luca Becchetti; Andrea E. F. Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan 001 (SIAM J. Comput., 2020)

Consensus Dynamics: An Overview. - Luca Becchetti; Andrea Clementi; Emanuele Natale (SIGACT News, 2020)

Step-by-step community detection in volume-regular graphs. - Luca Becchetti; Emilio Cruciani; Francesco Pasquale; Sara Rizzo (Theor. Comput. Sci., 2020)

Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. - Luca Becchetti; Andrea Clementi; Riccardo Denni; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (CoRR, 2021)

Network and Sequence-Based Prediction of Protein-Protein Interactions. - Luca Becchetti; Adriano Fazzone; Leonardo Martini (CoRR, 2021)

Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). - Luca Becchetti; Andrea Clementi; Riccardo Denni; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (LATIN, 2022)

Biological Random Walks: multi-omics integration for disease gene prioritization. - Michele Gentili; Leonardo Martini; Marialuisa Sponziello; Luca Becchetti (Bioinform., 2022)

On the Multidimensional Random Subset Sum Problem. - Luca Becchetti; Arthur Carvalho Walraven da Cunha; Andrea Clementi; Francesco D'Amore 001; Hicham Lesfari; Emanuele Natale; Luca Trevisan 001 (CoRR, 2022)

Biased opinion dynamics: when the devil is in the details. - Aris Anagnostopoulos; Luca Becchetti; Emilio Cruciani; Francesco Pasquale; Sara Rizzo (Inf. Sci., 2022)

On a Voter Model with Context-Dependent Opinion Adoption. - Luca Becchetti; Vincenzo Bonifaci; Emilio Cruciani; Francesco Pasquale (IJCAI, 2023)

On the Role of Memory in Robust Opinion Dynamics. - Luca Becchetti; Andrea Clementi; Amos Korman; Francesco Pasquale; Luca Trevisan 001; Robin Vacus (IJCAI, 2023)

Expansion and flooding in dynamic random networks with node churn. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (Random Struct. Algorithms, 2023)

The Minority Dynamics and the Power of Synchronicity. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Robin Vacus; Isabella Ziccardi (SODA, 2024)

Bond percolation in small-world graphs with power-law distribution. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Luca Trevisan 001; Isabella Ziccardi (Theor. Comput. Sci., 2024)

Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach. - Luca Becchetti; Andrea Clementi; Luciano Gualà; Luca Pepè Sciarria; Alessandro Straziota; Matteo Stromieri (CoRR, 2025)

Fair Projections as a Means toward Balanced Recommendations. - Aris Anagnostopoulos; Luca Becchetti; Matteo Böhm; Adriano Fazzone; Stefano Leonardi 001; Cristina Menghini; Chris Schwiegelshohn (ACM Trans. Intell. Syst. Technol., 2025)