Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Xavier Messeguer (WG, 1993)

Serving Requests with On-line Routing. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (SWAT, 1994)

On-line Resource Management with Applications to Routing and Scheduling. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (ICALP, 1995)

Competitive Algorithms for the On-line Traveling Salesman. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (WADS, 1995)

On-line Network Routing. - Stefano Leonardi 001 (Online Algorithms, 1996)

On-line Competive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (ESA, 1996)

Efficient Token-Based Control in Rings (Abstract). - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (PODC, 1996)

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (RAIRO Theor. Informatics Appl., 1996)

Enclosing a Set of Objects by Two Minimum Area Rectangles. - Bruno Becker; Paolo Giulio Franciosa; Stephan Gschwind; Stefano Leonardi 001; Thomas Ohler; Peter Widmayer (J. Algorithms, 1996)

On scheduling variable length broadcasts in wireless networks. - Maurizio A. Bonuccelli; Stefano Leonardi 001 (Telecommun. Syst., 1997)

Randomized Lower Bounds for Online Path Coloring. - Stefano Leonardi 001; Andrea Vitaletti (RANDOM, 1998)

Efficient Token-Based Control in Rings. - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (Inf. Process. Lett., 1998)

On Capital Investment. - Yossi Azar; Yair Bartal; Esteban Feuerstein; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 1999)

On-Line Resource Management with Application to Routing and Scheduling. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Algorithmica, 1999)

On-line Algorithms. - Susanne Albers; Stefano Leonardi 001 (ACM Comput. Surv., 1999)

On-Line Routing in All-Optical Networks. - Yair Bartal; Stefano Leonardi 001 (Theor. Comput. Sci., 1999)

On Salesmen, Repairmen, Spiders, and Other Traveling Agents. - Giorgio Ausiello; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (CIAC, 2000)

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Andrea Vitaletti (FSTTCS, 2000)

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

Minimizing stall time in single and parallel disk systems. - Susanne Albers; Naveen Garg 001; Stefano Leonardi 001 (J. ACM, 2000)

Multiprocessor Scheduling with Rejection. - Yair Bartal; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Jirí Sgall; Leen Stougie (SIAM J. Discret. Math., 2000)

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

Algorithms for the On-Line Travelling Salesman. - Giorgio Ausiello; Esteban Feuerstein; Stefano Leonardi 001; Leen Stougie; Maurizio Talamo (Algorithmica, 2001)

On-Line Competitive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 2001)

On-line Randomized Call Control Revisited . - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Alessio Presciutti; Adi Rosén (SIAM J. Comput., 2001)

Preface. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2001)

An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. - Massimiliano Curcio; Stefano Leonardi 001; Andrea Vitaletti (ALENEX, 2002)

A Multi-Layer Model for the Web Graph. - Luigi Laura; Stefano Leonardi 001; Guido Caldarelli; Paolo De Los Rios (WebDyn@WWW, 2002)

Minimizing the Flow Time Without Migration. - Baruch Awerbuch; Yossi Azar; Stefano Leonardi 001; Oded Regev 001 (SIAM J. Comput., 2002)

Algorithms and Experiments for the Webgraph. - Luigi Laura; Stefano Leonardi 001; Stefano Millozzi; Ulrich Meyer 001; Jop F. Sibeyn (ESA, 2003)

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

Scheduling multicasts on unit-capacity trees and meshes. - Monika Rauch Henzinger; Stefano Leonardi 001 (J. Comput. Syst. Sci., 2003)

Scheduling against an adversarial network. - Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Friedhelm Meyer auf der Heide (SPAA, 2004)

Preface. - Stefano Leonardi 001 (Algorithmica, 2004)

Simulating the Webgraph: a comparative analysis of models. - Debora Donato; Luigi Laura; Stefano Leonardi 001; Stefano Millozzi (Comput. Sci. Eng., 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)

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

Cross-monotonic cost sharing methods for connected facility location games. - Stefano Leonardi 001; Guido Schäfer (Theor. Comput. Sci., 2004)

The Self-Star Vision. - Özalp Babaoglu; Márk Jelasity; Alberto Montresor; Christof Fetzer; Stefano Leonardi 001; Aad P. A. van Moorsel (Self-star Properties in Complex Information Systems, 2005)

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)

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. - Stefano Leonardi 001; Friedhelm Meyer auf der Heide; Dorothea Wagner (Algorithmic Aspects of Large and Complex Networks, 2005)

From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. - Jochen Könemann; Stefano Leonardi 001; Guido Schäfer; Stefan H. M. van Zwam (ICALP, 2005)

A group-strategyproof mechanism for Steiner forests. - Jochen Könemann; Stefano Leonardi 001; Guido Schäfer (SODA, 2005)

Mining the inner structure of the Web graph. - Debora Donato; Stefano Leonardi 001; Stefano Millozzi; Panayiotis Tsaparas (WebDB, 2005)

Game-Theoretic Analysis of Internet Switching with Selfish Users. - Alexander Kesselman; Stefano Leonardi 001; Vincenzo Bonifaci (WINE, 2005)

Special Issue on Algorithms and Models for the Web-Graph. - Dimitris Achlioptas; Stefano Leonardi 001 (Internet Math., 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)

On the Value of Preemption in Scheduling. - Yair Bartal; Stefano Leonardi 001; Gil Shallom; René Sitters (APPROX-RANDOM, 2006)

Counting triangles in data streams. - Luciana S. Buriol; Gereon Frahling; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Christian Sohler (PODS, 2006)

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. - Lisa Fleischer; Jochen Könemann; Stefano Leonardi 001; Guido Schäfer (STOC, 2006)

Temporal Analysis of the Wikigraph. - Luciana S. Buriol; Carlos Castillo 001; Debora Donato; Stefano Leonardi 001; Stefano Millozzi (Web Intelligence, 2006)

Preferential attachment in the growth of social networks: the case of Wikipedia - Andrea Capocci; Vito Domenico Pietro Servedio; Francesca Colaiori; Luciana S. Buriol; Debora Donato; Stefano Leonardi 001; Guido Caldarelli (CoRR, 2006)

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

Algorithms and Experiments for the Webgraph. - Debora Donato; Luigi Laura; Stefano Leonardi 001; Ulrich Meyer 001; Stefano Millozzi; Jop F. Sibeyn (J. Graph Algorithms Appl., 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)

Design of trees in the hose model: The balanced case. - Giuseppe F. Italiano; Stefano Leonardi 001; Gianpaolo Oriolo (Oper. Res. Lett., 2006)

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. - Yair Bartal; Amos Fiat; Stefano Leonardi 001 (SIAM J. Comput., 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)

A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. - Stefano Leonardi 001 (Efficient Approximation and Online Algorithms, 2006)

New Metrics for Reputation Management in P2P Networks. - Debora Donato; Mario Paniccia; Maddalena Selis; Carlos Castillo 001; Giovanni Cortese; Stefano Leonardi 001 (AIRWeb, 2007)

Estimating Clustering Indexes in Data Streams. - Luciana S. Buriol; Gereon Frahling; Stefano Leonardi 001; Christian Sohler (ESA, 2007)

Pricing Tree Access Networks with Connected Backbones. - Vineet Goyal; Anupam Gupta 001; Stefano Leonardi 001; R. Ravi 001 (ESA, 2007)

Network formation games with local coalitions. - Stefano Leonardi 001; Piotr Sankowski (PODC, 2007)

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. - Anupam Gupta 001; Jochen Könemann; Stefano Leonardi 001; R. Ravi 001; Guido Schäfer (SODA, 2007)

Stability and Similarity of Link Analysis Ranking Algorithms. - Debora Donato; Stefano Leonardi 001; Panayiotis Tsaparas (Internet Math., 2007)

Approximating total flow time on parallel machines. - Stefano Leonardi 001; Danny Raz (J. Comput. Syst. Sci., 2007)

Cut problems in graphs with a budget constraint. - Roee Engelberg; Jochen Könemann; Stefano Leonardi 001; Joseph Naor (J. Discrete Algorithms, 2007)

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)

The Web as a graph: How far we are. - Debora Donato; Luigi Laura; Stefano Leonardi 001; Stefano Millozzi (ACM Trans. Internet Techn., 2007)

Prize-Collecting Traveling Salesman and Related Problems. - Alberto Marchetti-Spaccamela; Vincenzo Bonifaci; Stefano Leonardi 001; Giorgio Ausiello (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Mining Large Networks with Subgraph Counting. - Ilaria Bordino; Debora Donato; Aristides Gionis; Stefano Leonardi 001 (ICDM, 2008)

Stochastic analyses for online combinatorial optimization problems. - Naveen Garg 001; Anupam Gupta 001; Stefano Leonardi 001; Piotr Sankowski (SODA, 2008)

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. - Jochen Könemann; Stefano Leonardi 001; Guido Schäfer; Stefan H. M. van Zwam (SIAM J. Comput., 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)

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

10211 Abstracts Collection - Flexible Network Design. - Anupam Gupta 001; Stefano Leonardi 001; Berthold Vöcking; Roger Wattenhofer (Flexible Network Design, 2010)

Utilitarian Mechanism Design for Multi-Objective Optimization. - Fabrizio Grandoni 001; Piotr Krysta; Stefano Leonardi 001; Carmine Ventre (SODA, 2010)

Combinatorial Auctions with Budgets - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (CoRR, 2010)

Strict Cost Sharing Schemes for Steiner Forest. - Lisa Fleischer; Jochen Könemann; Stefano Leonardi 001; Guido Schäfer (SIAM J. Comput., 2010)

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

Approximation Algorithms for Union and Intersection Covering Problems. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (FSTTCS, 2011)

Single valued combinatorial auctions with budgets. - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (EC, 2011)

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

On Multiple Round Sponsored Search Auctions with Budgets - Riccardo Colini-Baldeschi; Monika Henzinger; Stefano Leonardi 001; Martin Starnberger (CoRR, 2011)

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Pilipczuk; Piotr Sankowski (ESA, 2012)

Revenue maximizing envy-free multi-unit auctions with budgets. - Michal Feldman; Amos Fiat; Stefano Leonardi 001; Piotr Sankowski (EC, 2012)

Prior-free auctions with ordered bidders. - Stefano Leonardi 001; Tim Roughgarden (STOC, 2012)

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

A Mazing 2+eps Approximation for Unsplittable Flow on a Path - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (CoRR, 2012)

Near-Optimal Multi-Unit Auctions with Ordered Bidders - Elias Koutsoupias; Stefano Leonardi 001; Tim Roughgarden (CoRR, 2012)

Game-theoretic analysis of Internet switching with selfish users. - Alexander Kesselman; Stefano Leonardi 001 (Theor. Comput. Sci., 2012)

Algorithms for Auctions and Games. - Vincenzo Bonifaci; Stefano Leonardi 001 (The Power of Algorithms, 2013)

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (IPCO, 2013)

Near-optimal multi-unit auctions with ordered bidders. - Sayan Bhattacharya; Elias Koutsoupias; Janardhan Kulkarni; Stefano Leonardi 001; Tim Roughgarden; Xiaoming Xu (EC, 2013)

Set Covering with Our Eyes Closed. - Fabrizio Grandoni 001; Anupam Gupta 001; Stefano Leonardi 001; Pauli Miettinen; Piotr Sankowski; Mohit Singh (SIAM J. Comput., 2013)

Preface. - Camil Demetrescu; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2013)

A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (SODA, 2014)

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Piotr Sankowski; Qiang Zhang (WINE, 2014)

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. - Alessandro Epasto; Jon Feldman; Silvio Lattanzi; Stefano Leonardi 001; Vahab S. Mirrokni (WWW, 2014)

Web and Social Graph Mining. - Paolo Boldi; Stefano Leonardi 001; Cecilia Mascolo; Michalis Vazirgiannis (IEEE Internet Comput., 2014)

Utilitarian Mechanism Design for Multiobjective Optimization. - Fabrizio Grandoni 001; Piotr Krysta; Stefano Leonardi 001; Carmine Ventre (SIAM J. Comput., 2014)

Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects. - Aris Anagnostopoulos; Diodato Ferraioli; Stefano Leonardi 001 (AAMAS, 2015)

Robust Hierarchical k-Center Clustering. - Silvio Lattanzi; Stefano Leonardi 001; Vahab S. Mirrokni; Ilya P. Razenshteyn (ITCS, 2015)

Efficient cost-sharing mechanisms for prize-collecting problems. - Anupam Gupta 001; Jochen Könemann; Stefano Leonardi 001; R. Ravi 001; Guido Schäfer (Math. Program., 2015)

On Multiple Keyword Sponsored Search Auctions with Budgets. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Monika Henzinger; Martin Starnberger (ACM Trans. Economics and Comput., 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)

Reservation Exchange Markets for Internet Advertising. - Gagan Goel; Stefano Leonardi 001; Vahab S. Mirrokni; Afshin Nikzad; Renato Paes Leme (ICALP, 2016)

Community Detection on Evolving Graphs. - Aris Anagnostopoulos; Jakub Lacki; Silvio Lattanzi; Stefano Leonardi 001; Mohammad Mahdian (NIPS, 2016)

Lottery Pricing Equilibria. - Shaddin Dughmi; Alon Eden; Michal Feldman; Amos Fiat; Stefano Leonardi 001 (EC, 2016)

Network-Aware Recommendations of Novel Tweets. - Noor Aldeen Alawad; Aris Anagnostopoulos; Stefano Leonardi 001; Ida Mele; Fabrizio Silvestri (SIGIR, 2016)

Approximately Efficient Double Auctions with Strong Budget Balance. - Riccardo Colini-Baldeschi; Bart de Keijzer; Stefano Leonardi 001; Stefano Turchetta (SODA, 2016)

Bidding Strategies for Fantasy-Sports Auctions. - Aris Anagnostopoulos; Ruggiero Cavallo; Stefano Leonardi 001; Maxim Sviridenko (WINE, 2016)

Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Qiang Zhang (WINE, 2016)

Online Network Design with Outliers. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Piotr Sankowski (Algorithmica, 2016)

Efficient computation of the Weighted Clustering Coefficient. - Silvio Lattanzi; Stefano Leonardi 001 (Internet Math., 2016)

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

When the Optimum is also Blind: a New Perspective on Universal Optimization. - Marek Adamczyk; Fabrizio Grandoni 001; Stefano Leonardi 001; Michal Wlodarczyk 001 (ICALP, 2017)

Fixed Price Approximability of the Optimal Gain from Trade. - Riccardo Colini-Baldeschi; Paul W. Goldberg; Bart de Keijzer; Stefano Leonardi 001; Stefano Turchetta (WINE, 2017)

Report on HALG 2016/2017. - Artur Czumaj; Stefano Leonardi 001 (Bull. EATCS, 2017)

HALG: Highlights of Algorithms. - Artur Czumaj; Stefano Leonardi 001 (SIGACT News, 2017)

Sequential Posted-Price Mechanisms with Correlated Valuations. - Marek Adamczyk; Allan Borodin; Diodato Ferraioli; Bart de Keijzer; Stefano Leonardi 001 (ACM Trans. Economics and Comput., 2017)

Prize Collecting Traveling Salesman and Related Problems. - Giorgio Ausiello; Vincenzo Bonifaci; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Algorithms for Hiring and Outsourcing in the Online Labor Market. - Aris Anagnostopoulos; Carlos Castillo 001; Adriano Fazzone; Stefano Leonardi 001; Evimaria Terzi (KDD, 2018)

A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (ACM Trans. Algorithms, 2018)

Stochastic Graph Exploration. - Aris Anagnostopoulos; Ilan Reuven Cohen; Stefano Leonardi 001; Jakub Lacki (ICALP, 2019)

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. - Fabrizio Grandoni 001; Stefano Leonardi 001; Piotr Sankowski; Chris Schwiegelshohn; Shay Solomon (SODA, 2019)

Algorithms for Fair Team Formation in Online Labour Marketplaces✱. - Giorgio Barnabò; Adriano Fazzone; Stefano Leonardi 001; Chris Schwiegelshohn (WWW (Companion Volume), 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)

Designing Cost-Sharing Methods for Bayesian Games. - George Christodoulou 001; Stefano Leonardi 001; Alkmini Sgouritsa (Theory Comput. Syst., 2019)

Envy, Regret, and Social Welfare Loss. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Okke Schrijvers; Eric Sodomka (WWW, 2020)

Fair Clustering with Multiple Colors. - Matteo Böhm; Adriano Fazzone; Stefano Leonardi 001; Chris Schwiegelshohn (CoRR, 2020)

Prior-free multi-unit auctions with ordered bidders. - Sayan Bhattacharya; Elias Koutsoupias; Janardhan Kulkarni; Stefano Leonardi 001; Tim Roughgarden; Xiaoming Xu (Theor. Comput. Sci., 2020)

FUN editorial. - Hiro Ito; Stefano Leonardi 001; Linda Pagli; Giuseppe Prencipe (Theor. Comput. Sci., 2020)

Approximately Efficient Two-Sided Combinatorial Auctions. - Riccardo Colini-Baldeschi; Paul W. Goldberg; Bart de Keijzer; Stefano Leonardi 001; Tim Roughgarden; Stefano Turchetta (ACM Trans. Economics and Comput., 2020)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. - Georgios Amanatidis; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Rebecca Reiffenhäuser (ICML, 2021)

A Regret Analysis of Bilateral Trade. - Nicolò Cesa-Bianchi; Tommaso Renato Cesari; Roberto Colomboni; Federico Fusco; Stefano Leonardi 001 (EC, 2021)

Flow time scheduling with uncertain processing time. - Yossi Azar; Stefano Leonardi 001; Noam Touitou (STOC, 2021)

Efficient two-sided markets with limited information. - Paul Dütting; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (STOC, 2021)

Stochastic bandits for multi-platform budget optimization in online advertising. - Vashist Avadhanula; Riccardo Colini-Baldeschi; Stefano Leonardi 001; Karthik Abinav Sankararaman; Okke Schrijvers (WWW, 2021)

Budget Feasible Mechanisms on Matroids. - Stefano Leonardi 001; Gianpiero Monaco; Piotr Sankowski; Qiang Zhang (Algorithmica, 2021)

Prophet Inequalities for Matching with a Single Sample. - Paul Dütting; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (CoRR, 2021)

Learning Fair Equilibria in Sponsored Search Auctions. - Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001 (CoRR, 2021)

Algorithms for fair k-clustering with multiple protected attributes. - Matteo Böhm; Adriano Fazzone; Stefano Leonardi 001; Cristina Menghini; Chris Schwiegelshohn (Oper. Res. Lett., 2021)

Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective. - Georgios Birmpas; Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001 (IJCAI, 2022)

FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection. - Giorgio Barnabò; Federico Siciliano; Carlos Castillo 001; Stefano Leonardi 001; Preslav Nakov; Giovanni Da San Martino; Fabrizio Silvestri (IJCNN, 2022)

Distortion-Oblivious Algorithms for Minimizing Flow Time. - Yossi Azar; Stefano Leonardi 001; Noam Touitou (SODA, 2022)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection. - Constantine Caramanis; Paul Dütting; Matthew Faw; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Orestis Papadigenopoulos; Emmanouil Pountourakis; Rebecca Reiffenhäuser (SODA, 2022)

Online revenue maximization for server pricing. - Shant Boodaghians; Federico Fusco; Stefano Leonardi 001; Yishay Mansour; Ruta Mehta (Auton. Agents Multi Agent Syst., 2022)

AI-based Data Preparation and Data Analytics in Healthcare: The Case of Diabetes. - Marianna Maranghi; Aris Anagnostopoulos; Irene Cannistraci; Ioannis Chatzigiannakis; Federico Croce; Giulia Di Teodoro; Michele Gentili; Giorgio Grani; Maurizio Lenzerini; Stefano Leonardi 001; Andrea Mastropietro; Laura Palagi; et al. (CoRR, 2022)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. - Georgios Amanatidis; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (J. Artif. Intell. Res., 2022)

Fully Dynamic Online Selection through Online Contention Resolution Schemes. - Vashist Avadhanula; Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001; Matteo Russo 002 (AAAI, 2023)

Repeated Bilateral Trade Against a Smoothed Adversary. - Nicolò Cesa-Bianchi; Tommaso Renato Cesari; Roberto Colomboni; Federico Fusco; Stefano Leonardi 001 (COLT, 2023)

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. - Georgios Amanatidis; Georgios Birmpas; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (EC, 2023)

Deep active learning for misinformation detection using geometric deep learning. - Giorgio Barnabò; Federico Siciliano; Carlos Castillo 001; Stefano Leonardi 001; Preslav Nakov; Giovanni Da San Martino; Fabrizio Silvestri (Online Soc. Networks Media, 2023)

Pandora's Box Problem with Order Constraints. - Shant Boodaghians; Federico Fusco; Philip Lazos; Stefano Leonardi 001 (Math. Oper. Res., 2023)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. - Tomer Ezra; Stefano Leonardi 001; Michal Pawlowski; Matteo Russo 002; Seeun William Umboh (APPROX/RANDOM, 2024)

Online Learning with Sublinear Best-Action Queries. - Matteo Russo 002; Andrea Celli; Riccardo Colini-Baldeschi; Federico Fusco; Daniel Haimovich; Dima Karamshuk; Stefano Leonardi 001; Niek Tax (NeurIPS, 2024)

Fair Division with Interdependent Values. - Georgios Birmpas; Tomer Ezra; Stefano Leonardi 001; Matteo Russo 002 (SAGT, 2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. - Nicolò Cesa-Bianchi; Tommaso Cesari; Roberto Colomboni; Federico Fusco; Stefano Leonardi 001 (STOC, 2024)

Contracts with Inspections. - Tomer Ezra; Stefano Leonardi 001; Matteo Russo 002 (CoRR, 2024)

Regret Analysis of Bilateral Trade with a Smoothed Adversary. - Nicolò Cesa-Bianchi; Tommaso Cesari; Roberto Colomboni; Federico Fusco; Stefano Leonardi 001 (J. Mach. Learn. Res., 2024)

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. - Georgios Amanatidis; Georgios Birmpas; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (Math. Oper. Res., 2024)

Bilateral Trade: A Regret Minimization Perspective. - Nicolò Cesa-Bianchi; Tommaso Cesari; Roberto Colomboni; Federico Fusco; Stefano Leonardi 001 (Math. Oper. Res., 2024)

Truthful Matching with Online Items and Offline Agents. - Michal Feldman; Federico Fusco; Stefano Leonardi 001; Simon Mauras; Rebecca Reiffenhäuser (Algorithmica, 2024)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions. - Georgios Amanatidis; Georgios Birmpas; Philip Lazos; Stefano Leonardi 001; Rebecca Reiffenhäuser (AAMAS, 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)

Smoothness Meets Autobidding: Tight Price of Anarchy Bounds for Simultaneous First-Price Auctions. - Riccardo Colini-Baldeschi; Sophie Klumper; Twan Kroll; Stefano Leonardi 001; Guido Schäfer; Artem Tsikiridis (CoRR, 2025)

Prophet Inequalities via the Expected Competitive Ratio. - Tomer Ezra; Stefano Leonardi 001; Rebecca Reiffenhäuser; Matteo Russo 002; Alexandros Tsigonias-Dimitriadis (ACM Trans. Economics and Comput., 2025)