( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Distributed O(Delta log(n))-Edge-Coloring Algorithm.

, , и . ESA, том 2161 из Lecture Notes in Computer Science, стр. 345-355. Springer, (2001)

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.

Michal Novotny

Michal Fic

Michal Olszewski

Michal Pejko

Michal Ratajski

 

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

Distributed Approximation Algorithms for Planar Graphs., , и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 296-307. Springer, (2006)A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically., , и . PODC, стр. 219-228. ACM, (1999)Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs., , , , и . OPODIS, том 8878 из Lecture Notes in Computer Science, стр. 49-59. Springer, (2014)Distributed packing in planar graphs., , и . SPAA, стр. 55-61. ACM, (2008)Distributed distance domination in graphs with no K2, t-minor., , и . Theor. Comput. Sci., (2022)Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion., , и . ISAAC, том 212 из LIPIcs, стр. 59:1-59:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Brief Announcement: Distributed Approximations for the Semi-matching Problem., , , , и . DISC, том 6950 из Lecture Notes in Computer Science, стр. 200-201. Springer, (2011)Distributed Approximation Algorithms in Unit-Disk Graphs., и . DISC, том 4167 из Lecture Notes in Computer Science, стр. 385-398. Springer, (2006)Distributed Algorithm for Better Approximation of the Maximum Matching., и . COCOON, том 2697 из Lecture Notes in Computer Science, стр. 242-251. Springer, (2003)Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families., и . COCOON, том 4598 из Lecture Notes in Computer Science, стр. 515-525. Springer, (2007)