Author of the publication

Distributed Approximation Algorithms for Planar Graphs.

, , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 296-307. Springer, (2006)

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

Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs.. J. Graph Theory, 83 (4): 317-333 (2016)A Note on Graph Pebbling., , , and . Graphs Comb., 18 (2): 219-225 (2002)Distributed Approximation Algorithms for Planar Graphs., , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 296-307. Springer, (2006)On the pebbling threshold of paths and the pebbling threshold spectrum., and . Discret. Math., 308 (15): 3297-3307 (2008)Distributed O(Delta log(n))-Edge-Coloring Algorithm., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 345-355. Springer, (2001)Distributed 2-Approximation Algorithm for the Semi-matching Problem., , , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 210-222. Springer, (2012)Fast Distributed Approximations in Planar Graphs., , and . DISC, volume 5218 of Lecture Notes in Computer Science, page 78-92. Springer, (2008)Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 668-678. Springer, (2009)The polling primitive for hypercube networks., , and . SPDP, page 138-144. IEEE, (1995)On odd rainbow cycles in edge-colored graphs., , , and . Eur. J. Comb., (2021)