Mattia D'Emidio
Mattia D'Emidio
Assistant Professor@University of L'Aquila, Lecturer@Gran Sasso Science Institute (GSSI)
Verified email at univaq.it - Homepage
TitleCited byYear
Engineering graph-based models for dynamic timetable information systems
A Cionini, G D'Angelo, M D'Emidio, D Frigioni, K Giannakopoulou, ...
Journal of Discrete Algorithms 46, 40-58, 2017
162017
A speed-up technique for distributed shortest paths computation
G d’Angelo, M d’Emidio, D Frigioni, V Maurizio
International Conference on Computational Science and Its Applications, 578-593, 2011
162011
Characterizing the computational power of anonymous mobile robots
M DEmidio, D Frigioni, A Navarra
2016 IEEE 36th International Conference on Distributed Computing Systems …, 2016
152016
A loop-free shortest-path routing algorithm for dynamic networks
G DʼAngelo, M DʼEmidio, D Frigioni
Theoretical Computer Science 516, 1-19, 2014
142014
Fully dynamic maintenance of arc-flags in road networks
G d’Angelo, M d’Emidio, D Frigioni, C Vitale
International Symposium on Experimental Algorithms, 135-147, 2012
142012
Dynamically maintaining shortest path trees under batches of updates
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2013
132013
Fully dynamic update of arc‐flags
G D'Angelo, M D'Emidio, D Frigioni
Networks 63 (3), 243-259, 2014
112014
Exploring and making safe dangerous networks using mobile entities
M D’Emidio, D Frigioni, A Navarra
International Conference on Ad-Hoc Networks and Wireless, 136-147, 2013
112013
Synchronous robots vs asynchronous lights-enhanced robots on graphs
M D'Emidio, D Frigioni, A Navarra
Electronic Notes in Theoretical Computer Science 322, 169-180, 2016
102016
Explore and repair graphs with black holes using mobile entities
M D'Emidio, D Frigioni, A Navarra
Theoretical Computer Science 605, 129-145, 2015
102015
Distance queries in large-scale fully dynamic complex networks
G D’Angelo, M D’Emidio, D Frigioni
International Workshop on Combinatorial Algorithms, 109-121, 2016
82016
Experimental evaluation of dynamic shortest path tree algorithms on homogeneous batches
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
International Symposium on Experimental Algorithms, 283-294, 2014
82014
Engineering a new loop-free shortest paths routing algorithm
G d’Angelo, M d’Emidio, D Frigioni, V Maurizio
International Symposium on Experimental Algorithms, 123-134, 2012
72012
On the Clustered Shortest-Path Tree Problem.
M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
ICTCS, 263-268, 2016
52016
Path-fault-tolerant approximate shortest-path trees
A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2015
52015
Priority Scheduling in the Bamboo Garden Trimming Problem
M D’Emidio, G Di Stefano, A Navarra
International Conference on Current Trends in Theory and Practice of …, 2019
42019
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
M D'Emidio, G Di Stefano, D Frigioni, A Navarra
Information and Computation 263, 57-74, 2018
42018
Rigorous dc solution of partial element equivalent circuit models
D Romano, G Antonini, M D'Emidio, D Frigioni, A Mori, M Bandinelli
IEEE Transactions on Circuits and Systems I: Regular Papers 63 (9), 1499-1510, 2016
42016
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
G D’Angelo, M D’Emidio, D Frigioni, D Romano
Theory of Computing Systems 57 (2), 444-477, 2015
42015
Enhancing the computation of distributed shortest paths on real dynamic networks
G d’Angelo, M d’Emidio, D Frigioni, D Romano
Mediterranean Conference on Algorithms, 148-158, 2012
32012
The system can't perform the operation now. Try again later.
Articles 1–20