Publications of Gabriele Di Stefano
BACK TO COATI PUBLICATION INDEX
Publications of Gabriele Di Stefano
-
Gianlorenzo d'Angelo,
Gabriele Di Stefano,
Alfredo Navarra,
Nicolas Nisse,
and Karol Suchan.
Computing on rings by oblivious robots: a unified approach for different tasks.
Algorithmica,
72(4):1055-1096,
2015.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
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,
May 2013.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
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]
-
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]
-
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 Workshop on Advances in Parallel and Distributed Computational Models (IPDPS Workshop),
Boston, United States,
pages 667-676,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
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]
-
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]
-
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]
-
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]
-
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]
-
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]
-
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]
-
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]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:44 2022
