Author of the publication

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

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