( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum flow and minimum-cost flow in multi-interface networks.

, , и . ICUIMC, стр. 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.

Andrea Di Stefano

Stefano Di Renzo

Pietro Di Stefano

Pietro Di Stefano

Stefano Meini

 

Другие публикации лиц с тем же именем

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