Home / Highlights



News

New Research Papers:
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).
A. D'Ascenzo and M. D'Emidio. On Mining Dynamic Graphs for k Shortest Paths. In Proceedings of 16th International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2024).
D. Coudert, A. D'Ascenzo and M. D'Emidio. Indexing Graphs for Shortest Beer Path Queries. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024).
G. D’Angelo, M. D’Emidio, E. Delfaraz and G. Di Stefano. Improved Algorithms for The Capacitated Team Orienteering Problem. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 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, and is (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.