Publications of G. D'Angelo

1. S. 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. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. 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. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. G. D'Angelo, G. Di Stefano, and A. Navarra. Minimize the Maximum Duty in Multi-interface Networks. Algorithmica, 63(1-2):274-295, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. G. D'Angelo, Gabriele Di Stefano, Alfredo Navarra, and Cristina Pinotti. Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Transactions on Computers, 60(3):433 - 446, March 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. G. D'Angelo, G. Di Stefano, and A. Navarra. Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model. In Steve Alpern, Robbert Fokkink, Leszek Gasieniec, Roy Lindelauf, and VS Subrahmanian, editors,Search Games and Rendezvous. Springer, .
   Note: Volume dedicated to the Workshop on Search and Rendezvous that took place in May 2012 in Lorentz Centre. To appear. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. 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, .
   Note: To appear. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. G. D'Angelo, G. Di Stefano, and A. Navarra. Flow problems in multi-interface networks. IEEE Transactions on Computers, .
   Note: To appear. [WWW ] [PDF ] [Abstract] [bibtex-entry]

1. 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), Pisa, Italy, pages 145-154, July 2012. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. 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) Student Workshop, Nice, France, pages 1-2, December 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. 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, Bordeaux, France, pages 123-134, June 2012. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. G. D'Angelo, M. D'Emidio, D. Frigioni, and D. Romano. Enhancing the computation of distributed shortest paths on real dynamic networks. In 1st Mediterranean Conference on Algorithms, volume 7659 of Lecture Notes in Computer Science, Ein-Gedi, Israel, pages 148-158, December 2012. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. 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, Bordeaux, France, pages 135-147, June 2012. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. 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, Reykjavìk, Iceland, pages 327-338, June 2012. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. 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, Salvador, Brazil, pages 330-344, October 2012. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. Sanjoy Baruah, K., Vincenzo Bonifaci, G. D'Angelo, Alberto Marchetti-Spaccamela, Suzanne Ster, Van Der, and Leen Stougie. Mixed-Criticality Scheduling of Sporadic Task Systems. In Camil Demetrescu and Magnús M. Halldórsson, editors, 19th Annual European Symposium on Algorithms (ESA 2011), volume 6942 of Lecture Notes in Computer Science, Saarbruecken, Germany, pages 555-566, August 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. G. D'Angelo, Mattia D'Emidio, Daniele Frigioni, and Vinicio Maurizio. A Speed-Up Technique for Distributed Shortest Paths Computation. In Beniamino Murgante, Osvaldo Gervasi, Andrés Iglesias, David Taniar, and Bernady O. Apduhan, editors, 11th International Conference on Computational Science and Its Applications (ICCSA 2011), volume 6783 of Lecture Notes in Computer Science, Santander, Spain, pages 578-593, June 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. G. D'Angelo, Gabriele Di Stefano, and Alfredo Navarra. Bandwidth Constrained Multi-interface Networks. In Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith Jefferey, Rastislav Královic, Marko Vukolic, and Stefan Wolf, editors, 37th Conference on Current Trends in Theory and Practice of Computer Science, volume 6543 of Lecture Notes in Computer Science, Novy Smokovec, Slovakia, pages 202-213, January 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. G. D'Angelo, Gabriele Di Stefano, and Alfredo Navarra. Gathering of Six Robots on Anonymous Symmetric Rings. In Adrian Kosowski and Masafumi Yamashita, editors, Structural Information and Communication Complexity, volume 6796 of Lecture Notes in Computer Science, Gdansk, Poland, pages 174-185, July 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. G. D'Angelo, Gabriele Di Stefano, and Alfredo Navarra. Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks. In 5th International Conference on Ubiquitous Information Management and Communication, Seoul, Korea, Republic Of, pages 19, February 2011. ACM. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. G. D'Angelo, Gabriele Di Stefano, and Alfredo Navarra. Min-Max Coverage in Multi-interface Networks. In Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith Jefferey, Rastislav Královic, Marko Vukolic, and Stefan Wolf, editors, 37th Conference on Current Trends in Theory and Practice of Computer Science, volume 6543 of Lecture Notes in Computer Science, Novy Smokovec, Slovakia, pages 190-201, January 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. G. D'Angelo, Daniele Frigioni, and Camillo Vitale. Dynamic Arc-Flags in Road Networks. In Panos M. Pardalos and Steffen Rebennack, editors, 10th International Symposium, SEA 2011, volume 6630 of Lecture Notes in Computer Science, Kolimpari, Chania, Crete, Greece, pages 88-99, April 2011. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


15. G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, and N. Suchan. A unified approach for different tasks on rings in robot-based computing systems. In 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), . IEEE.
    Note: To appear. [WWW ] [PDF ] [Abstract] [bibtex-entry]

1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Technical report RR-8071, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. G. D'Angelo, G. Di Stefano, and A. Navarra. How to gather asynchronous oblivious robots on anonymous rings. Technical report RR-7963, INRIA, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. 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. Technical report RR-8013, INRIA, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]

This document was translated from BibT_EX by bibtex2html