| The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems S Baruah, V Bonifaci, G DAngelo, H Li, A Marchetti-Spaccamela, ... 2012 24th Euromicro Conference on Real-Time Systems, 145-154, 2012 | 347 | 2012 |
| Scheduling real-time mixed-criticality jobs S Baruah, V Bonifaci, G d'Angelo, H Li, A Marchetti-Spaccamela, ... IEEE Transactions on Computers 61 (8), 1140-1152, 2011 | 239 | 2011 |
| Mixed-criticality scheduling of sporadic task systems SK Baruah, V Bonifaci, G d’Angelo, A Marchetti-Spaccamela, ... Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011 | 219 | 2011 |
| Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems S Baruah, V Bonifaci, G D'angelo, H Li, A Marchetti-Spaccamela, ... Journal of the ACM (JACM) 62 (2), 1-33, 2015 | 116 | 2015 |
| Recoverable robustness in shunting and timetabling S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ... Robust and Online Large-Scale Optimization: Models and Techniques for …, 2009 | 96 | 2009 |
| Greedily improving our own closeness centrality in a network P Crescenzi, G D'angelo, L Severini, Y Velaj ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (1), 1-32, 2016 | 86 | 2016 |
| Gathering of robots on anonymous grids and trees without multiplicity detection G d'Angelo, G Di Stefano, R Klasing, A Navarra Theoretical Computer Science 610, 158-168, 2016 | 70 | 2016 |
| Scheduling real-time mixed-criticality jobs SK Baruah, V Bonifaci, G D’Angelo, H Li, A Marchetti-Spaccamela, ... Mathematical Foundations of Computer Science 2010: 35th International …, 2010 | 69 | 2010 |
| Gathering on rings under the look–compute–move model G D’angelo, G Di Stefano, A Navarra Distributed Computing 27, 255-285, 2014 | 67 | 2014 |
| Improving the betweenness centrality of a node by adding links E Bergamini, P Crescenzi, G D'angelo, H Meyerhenke, L Severini, Y Velaj Journal of Experimental Algorithmics (JEA) 23, 1-32, 2018 | 63 | 2018 |
| Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra Journal of Combinatorial Optimization 18, 229-257, 2009 | 61 | 2009 |
| Robust Algorithms and Price of Robustness in Shunting Problems S Cicerone, G D'Angelo, G Di Stefano, D Frigioni, A Navarra 7th Workshop on Algorithmic Approaches for Transportation Modeling …, 2007 | 60 | 2007 |
| A unified approach for gathering and exclusive searching on rings under weak assumptions G D’angelo, A Navarra, N Nisse Distributed Computing 30, 17-48, 2017 | 52 | 2017 |
| Recommending links through influence maximization G D'Angelo, L Severini, Y Velaj Theoretical Computer Science 764, 30-41, 2019 | 45 | 2019 |
| Greedily improving our own centrality in a network P Crescenzi, G d’Angelo, L Severini, Y Velaj International symposium on experimental algorithms, 43-55, 2015 | 41 | 2015 |
| Fully dynamic 2-hop cover labeling G D'angelo, M D'emidio, D Frigioni Journal of Experimental Algorithmics (JEA) 24, 1-36, 2019 | 40 | 2019 |
| Exploiting social influence to control elections based on scoring rules F Corò, E Cruciani, G D'Angelo, S Ponziani arXiv preprint arXiv:1902.07454, 2019 | 37 | 2019 |
| Fairness in influence maximization through randomization R Becker, G D’angelo, S Ghobadi, H Gilbert Journal of Artificial Intelligence Research 73, 1251-1283, 2022 | 34 | 2022 |
| Computing on rings by oblivious robots: a unified approach for different tasks G d’Angelo, G Di Stefano, A Navarra, N Nisse, K Suchan Algorithmica 72, 1055-1096, 2015 | 34 | 2015 |
| Gathering of robots on anonymous grids without multiplicity detection G d’Angelo, G Di Stefano, R Klasing, A Navarra Structural Information and Communication Complexity: 19th International …, 2012 | 32 | 2012 |
Alfredo Navarra, PhDDipartimento di Matematica e Informatica, Università degli Studi di Perugiaunipg.it의 이메일 확인됨
