( en | de | ru )

 

Disambiguation of "Trujic, Milos"

Author of the publication

copydeleteadd this publication to your clipboard
An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

, , , , , , and . ESA, volume 173 of LIPIcs, page 17:1-17:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Milos Horvath

Milos Jovanovic

Milos Puzovic

Alesia Miloslavina

Yuliya Miloslavina

 

Other publications of authors with the same name

Resilience of perfect matchings and Hamiltonicity in random graph processes., , and . Random Struct. Algorithms, 54 (4): 797-819 (2019)On the size-Ramsey number of grids., , and . Comb. Probab. Comput., 32 (6): 874-880 (November 2023)Sprinkling a Few Random Edges Doubles the Power., and . SIAM J. Discret. Math., 35 (2): 988-1004 (2021)Covering cycles in sparse graphs., , and . Random Struct. Algorithms, 60 (4): 716-748 (2022)Local resilience of an almost spanning k-cycle in random graphs., , and . Random Struct. Algorithms, 53 (4): 728-751 (2018)Triangle resilience of the square of a Hamilton cycle in random graphs., , , and . J. Comb. Theory, Ser. B, (2022)On Resilience of Connectivity in the Evolution of Random Graphs., and . Electron. J. Comb., 26 (2): 2 (2019)An Optimal Decentralized (Δ + 1)-Coloring Algorithm., , , , , , and . ESA, volume 173 of LIPIcs, page 17:1-17:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)