( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum independent and disjoint coverage.

, , , и . J. Comb. Optim., 39 (4): 1017-1037 (2020)

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.

Edamakanti Chandrakanth Reddy

Michael Raghunath

Martin Raghunath

Raghunath Acharya

Michael Raghunath

 

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

On the Geometric Red-Blue Set Cover Problem., , и . WALCOM, том 12635 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2021)A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks., и . WAOA, том 12806 из Lecture Notes in Computer Science, стр. 204-219. Springer, (2020)Maximum Independent and Disjoint Coverage., , , и . TAMC, том 11436 из Lecture Notes in Computer Science, стр. 134-153. Springer, (2019)Maximum independent and disjoint coverage., , , и . J. Comb. Optim., 39 (4): 1017-1037 (2020)Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems., , и . COCOA, том 11346 из Lecture Notes in Computer Science, стр. 421-435. Springer, (2018)Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem., , и . FAW, том 13461 из Lecture Notes in Computer Science, стр. 176-191. Springer, (2022)Stabbing Line Segments with Disks and Related Problems., и . CCCG, стр. 201-207. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)