Author of the publication

Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study.

, and . ICCSA (2), volume 11620 of Lecture Notes in Computer Science, page 72-81. Springer, (2019)

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.

 

Other publications of authors with the same name

Digraph k-Coloring Games: From Theory to Practice., , , and . SEA, volume 233 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Bamboo Garden Trimming Problem: Priority Schedulings., , and . Algorithms, 12 (4): 74 (2019)Multi-robot Task Allocation Problem: Current Trends and New Ideas., and . ICTCS/CILC, volume 1949 of CEUR Workshop Proceedings, page 99-103. CEUR-WS.org, (2017)Priority Scheduling in the Bamboo Garden Trimming Problem., , and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 136-149. Springer, (2019)Dynamically Maintaining Shortest Path Trees under Batches of Updates., , , , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 286-297. Springer, (2013)Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study., and . ICCSA (2), volume 11620 of Lecture Notes in Computer Science, page 72-81. Springer, (2019)Dynamic Public Transit Labeling., and . ICCSA (1), volume 11619 of Lecture Notes in Computer Science, page 103-117. Springer, (2019)On the effectiveness of the genetic paradigm for polygonization., , , and . Inf. Process. Lett., (2021)A loop-free shortest-path routing algorithm for dynamic networks., , and . Theor. Comput. Sci., (2014)Explore and repair graphs with black holes using mobile entities., , and . Theor. Comput. Sci., (2015)