( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.

, , , , и . OPODIS, том 8878 из Lecture Notes in Computer Science, стр. 49-59. Springer, (2014)

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.

Christian Wawrzyniak

Kurt Wawrzyniak

Udo Wawrzyniak

Albert Wawrzyniak

Werner Wawrzyniak

 

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

Brief Announcement: Distributed Approximations for the Semi-matching Problem., , , , и . DISC, том 6950 из Lecture Notes in Computer Science, стр. 200-201. Springer, (2011)Distributed packing in planar graphs., , и . SPAA, стр. 55-61. ACM, (2008)Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs., , , , и . Theor. Comput. Sci., (2017)A local approximation algorithm for minimum dominating set problem in anonymous planar networks.. Distributed Comput., 28 (5): 321-331 (2015)Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs., , , , и . OPODIS, том 8878 из Lecture Notes in Computer Science, стр. 49-59. Springer, (2014)Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks.. PODC, стр. 406-408. ACM, (2013)A local constant-factor approximation algorithm for MDS problem in anonymous network. CoRR, (2013)On the distributed complexity of the semi-matching problem., , , и . J. Comput. Syst. Sci., 82 (8): 1251-1267 (2016)Review of DISC 2008., , и . SIGACT News, 39 (4): 60-65 (2008)A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs.. Inf. Process. Lett., 114 (3): 94-98 (2014)