Follow
Gianlorenzo D'Angelo
Gianlorenzo D'Angelo
Gran Sasso Science Institute (GSSI)
Verified email at gssi.it - Homepage
Title
Cited by
Cited by
Year
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
3022012
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
2202011
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
1932011
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
1042015
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
862009
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
642010
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
592007
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
562016
Gathering on rings under the look–compute–move model
G D’Angelo, G Di Stefano, A Navarra
Distributed Computing 27, 255-285, 2014
562014
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
552009
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
502016
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
462018
Greedily improving our own centrality in a network
P Crescenzi, G d’Angelo, L Severini, Y Velaj
Experimental Algorithms: 14th International Symposium, SEA 2015, Paris …, 2015
392015
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
352017
Gathering of Robots on Anonymous Grids without Multiplicity Detection.
G d'Angelo, G Di Stefano, R Klasing, A Navarra
SIROCCO 12, 327-338, 2012
322012
Gathering of Six Robots on Anonymous Symmetric Rings.
G d'Angelo, G Di Stefano, A Navarra
SIROCCO, 174-185, 2011
302011
Recommending links through influence maximization
G D'Angelo, L Severini, Y Velaj
Theoretical Computer Science 764, 30-41, 2019
282019
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
282015
Recoverable robustness for train shunting problems
S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra
Algorithmic Operations Research 4 (2), 102-116, 2009
282009
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
G d’Angelo, GD Stefano, A Navarra
Search Theory: A Game Theoretic Perspective, 197-222, 2013
272013
The system can't perform the operation now. Try again later.
Articles 1–20