( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Distributed Approximation Algorithms for Planar Graphs.

, , и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 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.

Andrzej Lingas

Andrzej Debski

Andrzej Piotrowski

Andrzej Tomczyk

Andrzej Szczerbakow

 

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

Distributed O(Delta log(n))-Edge-Coloring Algorithm., , и . ESA, том 2161 из Lecture Notes in Computer Science, стр. 345-355. Springer, (2001)Distributed 2-Approximation Algorithm for the Semi-matching Problem., , , и . DISC, том 7611 из Lecture Notes in Computer Science, стр. 210-222. Springer, (2012)Fast Distributed Approximations in Planar Graphs., , и . DISC, том 5218 из Lecture Notes in Computer Science, стр. 78-92. Springer, (2008)Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 668-678. Springer, (2009)The polling primitive for hypercube networks., , и . SPDP, стр. 138-144. IEEE, (1995)Distributed Approximation Algorithms for Planar Graphs., , и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 296-307. Springer, (2006)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., , , и . Graphs Comb., 18 (2): 219-225 (2002)On the pebbling threshold of paths and the pebbling threshold spectrum., и . Discret. Math., 308 (15): 3297-3307 (2008)Distributed approximation for f-matching., , , и . Theor. Comput. Sci., (2024)