Mattia D'Emidio
Mattia D'Emidio
Assistant Professor@University of L'Aquila, Lecturer@Gran Sasso Science Institute (GSSI)
Verified email at univaq.it - Homepage
Title
Cited by
Cited by
Year
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
242017
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
232012
Characterizing the computational power of anonymous mobile robots
M D'Emidio, D Frigioni, A Navarra
2016 IEEE 36th International Conference on Distributed Computing Systemsá…, 2016
202016
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
182011
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
M D’Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
Journal of Combinatorial Optimization 38 (1), 165-184, 2019
172019
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
172018
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
172016
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
172014
Fully dynamic update of arc‐flags
G D'Angelo, M D'Emidio, D Frigioni
Networks 63 (3), 243-259, 2014
162014
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
152016
On the Clustered Shortest-Path Tree Problem.
M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti
ICTCS, 263-268, 2016
142016
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
142013
Fully dynamic 2-hop cover labeling
G D'angelo, M D'emidio, D Frigioni
Journal of Experimental Algorithmics (JEA) 24, 1-36, 2019
132019
Explore and repair graphs with black holes using mobile entities
M D'Emidio, D Frigioni, A Navarra
Theoretical Computer Science 605, 129-145, 2015
122015
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
122013
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
112014
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
102016
Leader election and compaction for asynchronous silent programmable matter
G D'Angelo, M D'Emidio, S Das, A Navarra, G Prencipe
Proceedings of the 19th International Conference on Autonomous Agents andá…, 2020
92020
EASIER: an Evolutionary Approach for multi-objective Software archItecturE Refactoring
D Arcelli, V Cortellessa, M D'Emidio, D Di Pompeo
2018 IEEE International Conference on Software Architecture (ICSA), 105-10509, 2018
82018
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
The system can't perform the operation now. Try again later.
Articles 1–20