NP-Completeness of Spreading Colored Points

Ovidiu Daescu, Wenqi Ju, Jun Luo. NP-Completeness of Spreading Colored Points. In Weili Wu, Ovidiu Daescu, editors, Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Volume 6508 of Lecture Notes in Computer Science, pages 41-50, Springer, 2010. [doi]

@inproceedings{DaescuJL10,
  title = {NP-Completeness of Spreading Colored Points},
  author = {Ovidiu Daescu and Wenqi Ju and Jun Luo},
  year = {2010},
  doi = {10.1007/978-3-642-17458-2_5},
  url = {http://dx.doi.org/10.1007/978-3-642-17458-2_5},
  tags = {completeness},
  researchr = {https://researchr.org/publication/DaescuJL10},
  cites = {0},
  citedby = {0},
  pages = {41-50},
  booktitle = {Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I},
  editor = {Weili Wu and Ovidiu Daescu},
  volume = {6508},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-17457-5},
}