( en | de | ru )

 

Disambiguation of "Stefano, Gabriele Di"

Author of the publication

copydeleteadd this publication to your clipboard
Maximum flow and minimum-cost flow in multi-interface networks.

, , and . ICUIMC, page 19. ACM, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrea Di Stefano

Stefano Di Renzo

Pietro Di Stefano

Pietro Di Stefano

Stefano Meini

 

Other publications of authors with the same name

Graphs with Bounded Induced Distance., and . WG, volume 1517 of Lecture Notes in Computer Science, page 177-191. Springer, (1998)Optimal Gathering of Oblivious Robots in Anonymous Graphs., and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 213-224. Springer, (2013)How to Gather Asynchronous Oblivious Robots on Anonymous Rings., , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 326-340. Springer, (2012)Mutual visibility in graphs.. Appl. Math. Comput., (2022)Gathering robots in graphs: The central role of synchronicity., , and . Theor. Comput. Sci., (2021)Asynchronous Pattern Formation: the effects of a rigorous approach., , and . CoRR, (2017)Maximum flow and minimum-cost flow in multi-interface networks., , and . ICUIMC, page 19. ACM, (2011)Bamboo Garden Trimming Problem: Priority Schedulings., , and . Algorithms, 12 (4): 74 (2019)Asynchronous Robots on Graphs: Gathering., , and . Distributed Computing by Mobile Entities, volume 11340 of Lecture Notes in Computer Science, Springer, (2019)Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements., , , , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 174-186. Springer, (2019)