Stefano Leucci

Associate Professor
University of L'Aquila

About me

I am an associate professor at the Department of Information Engineering, Computer Science and Mathematics of the University of L'Aquila.

My research interests include the design and analysis of exact and approximation algorithms on graphs, of fault-tolerant algorithms and data structures, and the study of problems in the field of Algorithmic Game Theory.
That includes, for example, the design of sparse single-source edge-fault-tolerant spanners and oracles, the design of algorithms that are able to withstand memory corruptions or erroneous operation results (e.g., comparison faults), and the study of distributed network formation dynamics.
I am also interested in pinpointing the computational complexity of combinatorial puzzle games.

A list of my published papers can be found here.

Work & Education

• From December 2022: Associate professor at the Information Engineering, Computer Science and Mathematics department of University of L'Aquila.
• December 2019 - November 2022: Assistant professor at the Information Engineering, Computer Science and Mathematics department of University of L'Aquila.
• January 2019 - November 2019: Temporary research fellow at Max Planck Institut für Informatik in the Algorithms and Complexity (D1) Department of Prof. Kurt Mehlhorn.
• November 2016 - December 2018: Temporary research fellow at the Department of Computer Science of ETH Zürich in the Algorithms, Data Structures, and Applications group of Prof. Peter Widmayer.
• November 2015 - October 2016: Temporary research fellow at the Department of Computer Science of Sapienza University of Rome in the Algorithms, Randomisation, Computation group of Prof. Alessandro Panconesi.
• November 2012 - October 2015: Ph.D. student at University of L'Aquila. Advisor: Prof. Guido Proietti. Thesis title: "On the Size-Stretch Tradeoff in Fault-Tolerant Spanners and Autonomous Networks".
• Academic Year 2011/2012: Master's Degree cum laude in Computer Science at University of Rome "Tor Vergata". Thesis title: "Studio del prezzo dell'anarchia di un Network Creation Game generalizzato". Supervisor: Dr. Luciano Gualà.
• Academic Year 2009/2010: Bachelor's Degree cum laude in Computer Science at University of Rome "Tor Vergata". Thesis title: "Soluzioni algoritmiche per un gioco di Stackelberg su reti" Supervisor: Dr. Luciano Gualà.  

Teaching

• Spring Semester 2024/2025 Information Systems and Network Security (DS9003). See the course website.
• Spring Semester 2024/2025 Algorithm Design Laboratory with Applications (DT0835). See the course website.
• Fall Semester 2023/2024: Social Networks (DT0175).
• Spring Semester 2023/2024 Information Systems and Network Security (DS9003). See the course website.
• Spring Semester 2023/2024 Algorithm Design Laboratory with Applications (DT0835). See the course website.
• Fall Semester 2023/2024: Social Networks (DT0175).
• Spring Semester 2022/2023 Information Systems and Network Security (DS9003). See the Moodle page.
• Spring Semester 2022/2023: Advanced Algorithms Laboratory (DT0547), Information Systems and Network Security.
• Fall Semester 2022/2023: Informatica (D0041). See the Moodle page.
• Spring Semester 2021/2022: Advanced Algorithms Laboratory (DT0547). See the Moodle page.
• Fall Semester 2021/2022: Informatica (D0041).
• Spring Semester 2020/2021: Advanced Algorithms Laboratory (DT0547). See the Moodle page.
• Spring Semester 2019/2020: Advanced Algorithms Laboratory (DT0547). See the Moodle page.
• Fall Semester 2018/2019: Advanced Algorithms and Data Structures (252-4230-00L).
• Fall Semester 2018/2019: Teaching Assistant for Algorithms Lab (263-0006-00L).
• Spring Semester 2017/2018: Advanced Algorithms and Data Structures (252-4230-00L).
• Fall Semester 2017/2018: Teaching assistant for Data Structures and Algorithms (252-0002-AAL).
• Fall Semester 2017/2018: Teaching assistant for Algorithmic Game Theory (252-1407-00L).
• Spring Semester 2016/2017: Teaching assistant for Compiler Design (252-0210-00L).

Projects

I am one of the founders and maintainers of the Complexity of Games (CoG) project: a collaborative compendium of computational complexity results on games and puzzles.

I am the main developer of Motivo: a collection of tools for counting and sampling motifs in large graphs.

Publications

Below is a list of my published papers. You can also check DBLP or Google Scholar.

• Retrieving list...

Service

I am/was in the program committee of WSDM 2025, LSGDA 2024, IJCAI 2024, WSDM 2024, WWW 2023, AAMAS 2023, WSDM 2023, SEA 2022, WWW 2022, SEA 2021, WWW 2021, LSGDA 2020, MLG 2020, MLG 2019, and MLG 2018.

I was in the organizing committee of ADFOCS 2019.

I am/was a reviewer for the following conferences: SAND 2025, WADS 2025, CIAC 2025, STACS 2024, ISAAC 2024, ATMOS 2024, FUN 2024, ESA 2023, ATMOS 2023, ICALP 2023, WINE 2022, DISC 2022, MFCS 2022, WALCOM 2022, ISAAC 2021, ICTCS 2021, ICALP 2021, FSTTCS 2020, ALGOSENSORS 2020, ATMOS 2020, MFCS 2020, ESA 2020, ICTCS 2020, ALGOCLOUD 2019, ESA 2019, PODC 2019, ICALP 2019, SPAA 2019, STOC 2019, ESA 2018, FUN 2018, JCDCG^3 2018, SEA 2018, ICALP 2018, SWAT 2018, ISAAC 2018, ATMOS 2017, SAGT 2017, SODA 2017, ICTCS 2016, ESA 2016, MFCS 2016, ICDM 2016, SIROCCO 2015, ICALP 2013, IWOCA 2013;

...and for the following journals: ACM Transaction on Algorithms, Algorithmica, Discrete Mathematics, Journal of Discrete Algorithms, Theoretical Computer Science, Journal of Experimental Algorithmics, Mathematical Programming, Algorithms, Information Processing Letters, Operations Research Letters.