Home / Highlights



News

New Research Papers:
V. Bilò, A. D'Ascenzo, M. D'Emidio, G.F. Italiano. On the Performance of Mildly Greedy Players in k-Coloring Games. In Proc. of 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025).
A. D'Ascenzo, M. D'Emidio, M. Flammini, G. Monaco. Digraph k-Coloring Games: New Algorithms and Experiments. Journal of Artificial Intelligence Research, 81: 163-202 (2024).

Innovation

Co-Founder of start-up TEEMA, spin-off of the University of L'Aquila. We develop web-based tools to model complex systems and analyze their (geometrical and electromagnetic) properties through fast and scalable cloud-based algorithms for big-data

Research Interests

I am interested in the Design, Analysis and Efficient Implementation of Algorithms. My work follows an Algorithm Engineering approach, combining theory and experimentation. Currently, mostly focused on: algorithms for efficient processing of massive (possibly dynamic) graphs; study of distributed systems, networks, systems of autonomous entities (e.g. agents, robots or drones) from an algorithmic perspective (including game theoretic, strategic aspects).

Academia

Associate Professor of Computer Engineering (09/H1 - ING-INF/05) @ Dept. of Information Engineering, Computer Science and Mathematics (DISIM) of University of L'Aquila (Italy).

Holding the National Scientific Habilitation as Associate Professor in both Computer Engineering (ING-INF/05) and Computer Science (INF/01) scientific sectors.