Sariel Har-Peled

If you made any changes in Pure these will be visible here soon.
Filter
Chapter

Search results

  • 2003

    Fast algorithms for computing the smallest k-enclosing disc

    Har-Peled, S. & Mazumdar, S., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). di Battista, G. & Zwick, U. (eds.). Springer, p. 278-288 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2832).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  • 2017

    Approximating the k-level in three-dimensional plane arrangements

    Har-Peled, S., Kaplan, H. & Sharir, M., Jan 1 2017, A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. Springer, p. 467-503 37 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter