| Fully dynamic 2-hop cover labeling G D'angelo, M D'emidio, D Frigioni Journal of Experimental Algorithmics (JEA) 24, 1-36, 2019 | 37 | 2019 |
| 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 | 32 | 2018 |
| 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 | 25 | 2018 |
| 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 | 23 | 2019 |
| 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 | 23 | 2017 |
| 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 | 23 | 2016 |
| 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 | 23 | 2016 |
| Fully dynamic maintenance of arc-flags in road networks G d’Angelo, M d’Emidio, D Frigioni, C Vitale Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012 | 23 | 2012 |
| On the Clustered Shortest-Path Tree Problem. M D'Emidio, L Forlizzi, D Frigioni, S Leucci, G Proietti ICTCS 1720, 263-268, 2016 | 22 | 2016 |
| 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 | 20 | 2014 |
| Fully dynamic update of arc‐flags G D'Angelo, M D'Emidio, D Frigioni Networks 63 (3), 243-259, 2014 | 19 | 2014 |
| Asynchronous silent programmable matter achieves leader election and compaction G D’Angelo, M D’Emidio, S Das, A Navarra, G Prencipe IEEE Access 8, 207619-207634, 2020 | 18 | 2020 |
| 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 | 18 | 2016 |
| Engineering graph-based models for dynamic timetable information systems A Cionini, G D'Angelo, M D'Emidio, D Frigioni, K Giannakopoulou, ... 14th Workshop on Algorithmic Approaches for Transportation Modelling …, 2014 | 18 | 2014 |
| A speed-up technique for distributed shortest paths computation G d’Angelo, M d’Emidio, D Frigioni, V Maurizio Computational Science and Its Applications-ICCSA 2011: International …, 2011 | 18 | 2011 |
| Collision-free allocation of temporally constrained tasks in multi-robot systems M D’Emidio, I Khan Robotics and Autonomous Systems 119, 151-172, 2019 | 17 | 2019 |
| 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 | 16 | 2020 |
| Automated selection of optimal model transformation chains via shortest-path algorithms F Basciani, M D'Emidio, D Di Ruscio, D Frigioni, L Iovino, A Pierantonio IEEE Transactions on Software Engineering 46 (3), 251-279, 2018 | 16 | 2018 |
| Dynamically maintaining shortest path trees under batches of updates A D’Andrea, M D’Emidio, D Frigioni, S Leucci, G Proietti Structural Information and Communication Complexity: 20th International …, 2013 | 16 | 2013 |
| Exploring and making safe dangerous networks using mobile entities M D’Emidio, D Frigioni, A Navarra Ad-hoc, Mobile, and Wireless Network: 12th International Conference, ADHOC …, 2013 | 16 | 2013 |
Daniele FrigioniProfessor of Information Engineering, University of L'Aquila, ItalyEmail verificata su univaq.it
