Computing the Smallest k-Enclosing Circle and Related Problems

Alon Efrat, Micha Sharir, Alon Ziv. Computing the Smallest k-Enclosing Circle and Related Problems. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 325-336, Springer, 1993.

@inproceedings{EfratSZ93,
  title = {Computing the Smallest k-Enclosing Circle and Related Problems},
  author = {Alon Efrat and Micha Sharir and Alon Ziv},
  year = {1993},
  researchr = {https://researchr.org/publication/EfratSZ93},
  cites = {0},
  citedby = {0},
  pages = {325-336},
  booktitle = {Algorithms and Data Structures, Third Workshop, WADS  93, Montréal, Canada, August 11-13, 1993, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro and Sue Whitesides},
  volume = {709},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57155-8},
}