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
2552012
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
1882011
Mixed-criticality scheduling of sporadic task systems
SK Baruah, V Bonifaci, G d’Angelo, A Marchetti-Spaccamela, ...
European Symposium on Algorithms, 555-566, 2011
1732011
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
822015
Recoverable robustness in shunting and timetabling
S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ...
Robust and online large-scale optimization, 28-60, 2009
792009
Scheduling real-time mixed-criticality jobs
SK Baruah, V Bonifaci, G D’Angelo, H Li, A Marchetti-Spaccamela, ...
International Symposium on Mathematical Foundations of Computer Science, 90-101, 2010
582010
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
572007
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 (3), 229, 2009
532009
Gathering on rings under the look–compute–move model
G D’Angelo, G Di Stefano, A Navarra
Distributed Computing 27 (4), 255-285, 2014
512014
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
392016
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
372016
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
352015
A unified approach for gathering and exclusive searching on rings under weak assumptions
G D’Angelo, A Navarra, N Nisse
Distributed Computing 30 (1), 17-48, 2017
332017
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
322018
Gathering of six robots on anonymous symmetric rings
G d’Angelo, G Di Stefano, A Navarra
International Colloquium on Structural Information and Communication …, 2011
302011
Gathering of robots on anonymous grids without multiplicity detection
G d’Angelo, G Di Stefano, R Klasing, A Navarra
International Colloquium on Structural Information and Communication …, 2012
292012
How to gather asynchronous oblivious robots on anonymous rings
G d’Angelo, G Di Stefano, A Navarra
International Symposium on Distributed Computing, 326-340, 2012
262012
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 (4), 1055-1096, 2015
252015
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
252009
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
G d’Angelo, G Di Stefano, A Navarra
Search Theory, 197-222, 2013
242013
The system can't perform the operation now. Try again later.
Articles 1–20