Author of the publication

Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.

, , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 421-435. Springer, (2018)

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

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