Publications

See also DBLP - Google Scholar - Arnetminer

Book Chapters and surveys

  1. G. D'Angelo. Approximation bounds for centrality maximization problems. In Bulletin of EATCS, 120, 2016.
  2. G. D'Angelo, G. Di Stefano, A. Navarra. Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model. In Search Theory: A Game Theoretic Perspective, Part III, Chapter 13, pages 197-222. Springer, 2013.
  3. G. D'Angelo, G. Di Stefano, A. Navarra. Multi-Interface Wireless Networks: Complexity and Algorithms. In Wireless Sensor Networks: From Theory to Applications, Part II, Chapter 5, pages 119-156. CRC Press, Taylor & Francis Group, USA, 2013.
  4. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, and A. Schöbel. Recoverable robustness in shunting and timetabling. In Robust and Online Large-Scale Optimization. Volume 5868 of State of the Art Lecture Notes in Computer Science, pages 28-60. Springer, 2009.

International Journals

  1. G. D'Angelo, A. Navarra, and N. Nisse. A unified approach for Gathering and Exclusive Searching on rings under weak assumptions. Distributed Computing. To Appear.
  2. P. Crescenzi, G. D'Angelo, L. Severini, and Y. Velaj. Greedily improving our own closeness centrality in a network. ACM Transactions on Knowledge Discovery from Data, 11(1):9, 2016.
  3. G. D'Angelo, D. Diodati, A. Navarra, and C. M. Pinotti. The minimum k-storage problem: theory and experimental results. IEEE Transactions on Mobile Computing, 15(7):1797-1811, 2016.
  4. G. D'Angelo, G. Di Stefano, R. Klasing, and A. Navarra. Gathering of Robots on Anonymous Grids and Trees without Multiplicity Detection. Theoretical Computer Science, 610:158-168, Elsevier, 2016.
  5. G. D'Angelo, D. Diodati, A. Navarra, and C. M. Pinotti. The Minimum k-Storage Problem on Directed Graphs. Theoretical Computer Science, 596:102-108, Elsevier, 2015.
  6. G. D'Angelo, M. D'Emidio, D. Frigioni, and D. Romano. Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios. Theory of Computing Systems, 57(2):444-477, 2015.
  7. J.-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Finding Disjoint Paths in Networks with Star Shared Risk Link Groups. Theoretical Computer Science, 579:74-87, Elsevier, 2015.
  8. S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, S. van der Ster, and L. Stougie. Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. Journal of the ACM, 62(2):14, 2015.
  9. G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, and K. Suchan. Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica, 72(4):1055-1096, Springer, 2015.
  10. G. D'Angelo, G. Di Stefano, and A. Navarra. Gathering on rings under the Look-Compute-Move model. Distributed Computing, 27(4):255-285, 2014.
  11. G. D'Angelo, M. D'Emidio, and D. Frigioni. Fully Dynamic Update of Arc-Flags. Networks, 63(3):243-259, Wiley, 2014.
  12. G. D'Angelo, G. Di Stefano, and A. Navarra. Gathering Six Oblivious Robots on Anonymous Symmetric Rings. Journal of Discrete Algorithms, 26:16-27, Elsevier, 2014.
  13. G. D'Angelo, G. Di Stefano, and A. Navarra. Flow problems in multi-interface networks. IEEE Transactions on Computers, 63(2):361-374, 2014.
  14. G. D'Angelo, M. D'Emidio, and D. Frigioni. A new loop-free shortest paths routing algorithm for dynamic networks. Theoretical Computer Science, 516:1-19, Elsevier, 2014.
  15. G. D'Angelo, M. D'Emidio, and D. Frigioni. Pruning the computation of distributed shortest paths in power-law networks. Informatica, 37(3):253-265, Slovenian Society Informatika, 2013.
  16. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and V. Maurizio. Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica, 66(1):51-86, Springer, 2013.
  17. R. Bauer, G. D'Angelo, D. Delling, A. Schumm, and D. Wagner. The Shortcut Problem - Complexity and Algorithms. Journal of Graph Algorithms and Applications, 16(2):447-481, 2012.
  18. S. K. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. Scheduling real-time mixed-criticality jobs. IEEE Transactions on Computers, 61(8):1140-1152, 2012.
  19. G. D'Angelo, G. Di Stefano, and A. Navarra. Minimize the Maximum Duty in Multi-Interface Networks. Algorithmica, 63(1-2): 274-295, Springer, 2012.
  20. G. D'Angelo, D. Frigioni, and V. Maurizio. Dynamic update of minimum cost paths in computer networks. International Journal of Management and Network Economics, 2(1):58-74, 2011.
  21. G. D'Angelo, G. Di Stefano, A. Navarra, and C. M. Pinotti. Recoverable Robust Timetables: an Algorithmic Approach on Trees. IEEE Transactions on Computers, 60(3):433-446, 2011.
  22. S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni. Partially Dynamic Efficient Algorithms for Distributed Shortest Paths. Theoretical Computer Science, 411:1013-1037, Elsevier, 2010.
  23. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research, 4(2):102-116, 2009.
  24. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Recoverable Robust Timetabling for Single Delay: Complexity and Polynomial Algorithms for Special Cases. Journal of Combinatorial Optimization, 18(3):229-257, Springer, 2009.
  25. F. Bruera, S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni. Dynamic multi-level overlay graphs for shortest paths. Mathematics in Computer Science, 1 (4):709-736, Birkhäuser/Springer, 2008.
  26. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Petricola. Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. Journal of Computers, 2 (9):16-26, 2007.

International Conferences

  1. V. Bonifaci, G. D'Angelo, and A. Marchetti-Spaccamela. Algorithms for hierarchical and semi-partitioned parallel scheduling. In 31st IEEE International Parallel & Distributed Processing Symposium (IPDPS 2017). To appear.
  2. A. Balliu, G. D'Angelo, P. Fraigniaud, and D. Olivetti. What Can Be Verified Locally? In 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017). To appear.
  3. A. Balliu, G. D'Angelo, P. Fraigniaud, and D. Olivetti. Brief Announcement: Local Distributed Verification. In 30th International Symposium on Distributed Computing (DISC 2016). Volume 9888 of Lecture Notes in Computer Science, pages 461-464. Springer, 2016.
  4. G. D'Angelo, L. Severini, and Y. Velaj Influence Maximization in the Independent Cascade Model In 17th Italian Conference on Theoretical Computer Science (ICTCS 2016), pages 269-274, 2016.
  5. G. D'Angelo, M. D'Emidio, and D. Frigioni. Distance Queries in Large-Scale Fully Dynamic Complex Networks. In 27th International Workshop on Combinatorial Algorithms (IWOCA 2016). Volume 9843 of Lecture Notes in Computer Science, pages 109-121. Springer, 2016.
  6. V. Bonifaci, B. Brandenburg, G. D'Angelo, and A. Marchetti-Spaccamela. Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. In 28th Euromicro Conference on Real-Time Systems (ECRTS16)., pages 237-247, IEEE Computer Society, 2016.
  7. G. D'Angelo, L. Severini, and Y. Velaj. On the Maximum Betweenness Improvement Problem. In 16th Italian Conference on Theoretical Computer Science (ICTCS 2015). Volume 322 of Electronic Notes in Theoretical Computer Science, pages 153-168. Elsevier, 2016.
  8. P. Crescenzi, G. D'Angelo, L. Severini, and Y. Velaj. Greedily improving our own centrality in a network. In 14th International Symposium on Experimental Algorithms (SEA 2015). Volume 9125 of Lecture Notes in Computer Science, pages 43-55. Springer, 2015.
  9. S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, S. van der Ster and L. Stougie. Scheduling of mixed-criticality sporadic task systems with multiple levels. In 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015).
  10. G. D'Angelo, X. Defago, and N. Nisse. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environment In 2nd International Symposium on Computing and Networking (CANDAR'14).
  11. A. Cionini, G. D'Angelo, M. D'Emidio, D. Frigioni, K. Giannakopoulou, A. Paraskevopoulos, and C. Zaroliagis. Engineering Graph-Based Models for Dynamic Timetable Information Systems. In 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS14). Dagstuhl, 2014.
  12. G. D'Angelo, D. Diodati, A. Navarra and C. M. Pinotti. Optimal Placement of Storage Nodes in a Wireless Sensor Network. In 15th Italian Conference on Theoretical Computer Science (ICTCS 2014). 2014.
  13. G. D'Angelo, A. Navarra, N. Nisse. Robot Searching and Gathering on Rings under Minimal Assumptions. In 5th International Conference on Distributed Computing and Networks (ICDCN 2014). Volume 8314 of Lecture Notes in Computer Science, pages 149-164. Springer, 2014.
  14. G. D'Angelo, D. Diodati, A. Navarra, and C. M. Pinotti. Approximation Bounds for the Minimum k-Storage Problem. In 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013). Volume 8243 of Lecture Notes in Computer Science, pages 1-16. Springer, 2014.
  15. J.-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with Star SRLGs. In 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (Algotel), pages 56-59. 2013.
  16. G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, and K. Suchan. A unified approach for different tasks on rings in robot-based computing systems. In 15th IEEE IPDPS Workshop on Advances in Parallel and Distributed Computing Models (APDCM), pages 667-676. IEEE, 2013.
  17. J.-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. SRLG-Diverse Routing with the Star Property. In 9th International Conference on Design of Reliable Communication Networks (DRCN 2013), pages 163-170. IEEE, 2013.
  18. G. D'Angelo, M. D'Emidio, D. Frigioni, D. Romano. Enhancing the computation of distributed shortest paths on real dynamic networks. In 1st Mediterranean Conference on Algorithms (MEDALG2012). Volume 7659 of Lecture Notes in Computer Science, pages 148-158. Springer, 2012.
  19. J.-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in networks with star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT 2012). Student Workshop, ACM press, 2012.
  20. G. D'Angelo, G. Di Stefano, and A. Navarra. How to gather asynchronous oblivious robots on anonymous rings. In 26th International Symposium on Distributed Computing (DISC 2012). Volume 7611 of Lecture Notes in Computer Science, pages 330-344. Springer, 2012.
  21. G. D'Angelo, M. D'Emidio, D. Frigioni, and D. Romano. Efficient algorithms for distributed shortest paths on power-law networks. In 13th Italian Conference on Theoretical Computer Science (ICTCS 2012). 2012.
  22. G. D'Angelo, G. Di Stefano, R. Klasing, and A. Navarra. Gathering of Robots on Anonymous Grids without multiplicity detection In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012). Volume 7355 of Lecture Notes in Computer Science, pages 327-338. Springer, 2012.
  23. S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, S. van der Ster, and L. Stougie The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In 24th Euromicro Conference on Real-Time Systems (ECRTS12), pages 145-154. IEEE Computer Society, 2012.
  24. G. D'Angelo, M. D'Emidio, D. Frigioni, and V. Maurizio. Engineering a new loop-free shortest paths routing algorithm. In 11th International Symposium on Experimental Algorithms (SEA2012). Volume 7276 of Lecture Notes in Computer Science, pages 123-134. Springer, 2012.
  25. G. D'Angelo, M. D'Emidio, D. Frigioni, and C. Vitale. Fully Dynamic Maintenance of Arc-Flags in Road Networks. In 11th International Symposium on Experimental Algorithms (SEA2012). Volume 7276 of Lecture Notes in Computer Science, pages 135-147. Springer, 2012.
  26. S. Baruah, V. Bonifaci, G. D'Angelo, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. Mixed-Criticality Scheduling of Sporadic Task Systems. In 19th Annual European Symposium on Algorithms (ESA 2011). Volume 6942 of Lecture Notes in Computer Science, pages 555-566. Springer, 2011.
  27. G. D'Angelo, G. Di Stefano, and A. Navarra. Gathering of Six Robots on Anonymous Symmetric Rings. In 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2011). Volume 6796 of Lecture Notes in Computer Science, pages 174-185. Springer, 2011.
  28. G. D'Angelo, M. D'emidio, D. Frigioni, and V. Maurizio. A speed-up technique for distributed shortest paths computation. In 11th International Conference on Computational Science and Its Applications (ICCSA 2011). Volume 6783 of Lecture Notes in Computer Science, pages 578-593. Springer, 2011.
  29. V. Bonifaci, G. D'Angelo, A. Marchetti-Spaccamela, S. Van Der Ster and L. Stougie. Mixed-criticality scheduling of sporadic task systems. In 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011).
  30. S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. Mixed-criticality scheduling. In 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011).
  31. G. D'Angelo, D. Frigioni, and C. Vitale. Dynamic Arc-Flags in Road Networks. In 10th International Symposium on Experimental Algorithms (SEA2011). Volume 6630 of Lecture Notes in Computer Science, pages 88-99. Springer, 2011.
  32. G. D'Angelo, G. Di Stefano, and A. Navarra. Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks. In 5th ACM International Conference on Ubiquitous Information Management and Communication (ACM ICUIMC'11). Article 19, 9 pages. ACM Press, 2011.
  33. G. D'Angelo, G. Di Stefano, and A. Navarra. Min-Max Coverage in Multi-Interface Networks. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11). Volume 6543 of Lecture Notes in Computer Science, pages 190-201. Springer, 2011.
  34. G. D'Angelo, G. Di Stefano, and A. Navarra. Bandwidth constrained multi-interface networks. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11). Volume 6543 of Lecture Notes in Computer Science, pages 202-213. Springer, 2011.
  35. G. D'Angelo, G. Di Stefano, and A. Navarra. Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. In 4th International Conference on Combinatorial Optimization and Applications 2010 (COCOA'10). Volume 6509 of Lecture Notes in Computer Science, pages 254-267. Springer, 2010.
  36. G. D'Angelo, D. Frigioni, and V. Maurizio. An experimental study of distributed algorithms for shortest paths on real networks. In 12th Italian Conference on Theoretical Computer Science (ICTCS2010). 2010.
  37. S. K. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. Scheduling Real-Time Mixed-Criticality Jobs. In 35th International Symposium on Mathematical Foundations of Computer Science (MFCS2010). Volume 6281 of Lecture Notes in Computer Science. Springer, pages 90-101 2010.
  38. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and V. Maurizio. A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation. In 9th International Symposium on Experimental Algorithms (SEA2010). Volume 6049 of Lecture Notes in Computer Science, pages 59-70. Springer, 2010.
  39. E. Berrettini, G. D'Angelo, D. Delling. Arc-Flags in Dynamic Graphs. In Algorithmic Approaches for Transportation Modeling, Optimization, and Systems 2009 (ATMOS09), Dagstuhl, 2009.
  40. G. D'Angelo, G. Di Stefano, and A. Navarra. Evaluation of recoverable-robust timetables on tree networks. In 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Volume 5874 of Lecture Notes in Computer Science, pages 24-35. Springer, 2009.
  41. G. D'Angelo, G. Di Stefano, A. Navarra, and C. M. Pinotti. Recoverable robust timetables on trees. In 3rd International Conference on Combinatorial Optimization and Applications 2009 (COCOA'09). Volume 5573 of Lecture Notes in Computer Science, pages 451-462. Springer, 2009.
  42. G. D'Angelo, G. Di Stefano, and A. Navarra. Recoverable-Robust Timetables for Trains on Single-Line Corridors. In International Seminar on Railway Operations Modelling and Analysis - Engineering and Optimisation Approaches (RailZurich2009). 2009.
  43. R. Bauer, G. D'Angelo, D. Delling, and D. Wagner. The Shortcut Problem - Complexity and Approximation. In 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09). Volume 5404 of Lecture Notes in Computer Science, pages 105-116. Springer, 2009.
  44. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Delay Management Problem: Complexity Results and Robust Algorithms. In 2nd International Conference on Combinatorial Optimization and Applications 2008 (COCOA'08). Volume 5165 of Lecture Notes in Computer Science, pages 458-468. Springer, 2008.
  45. F. Bruera, S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni. Maintenance of multi-level overlay graphs for timetable queries. In Algorithmic Approaches for Transportation Modeling, Optimization, and Systems 2007 (ATMOS07), pages 226-242. Dagstuhl, 2007.
  46. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Robust algorithms and price of robustness in shunting problems. In Algorithmic Approaches for Transportation Modeling, Optimization, and Systems 2007 (ATMOS07), pages 175-190. Dagstuhl, 2007.
  47. G. D'Angelo, S. Cicerone, G. Di Stefano, and D. Frigioni. Partially dynamic concurrent update of distributed shortest paths. In International Conference on Computing: Theory and Applications (ICCTA'07), pages 32-38. IEEE Computer Society, 2007.