Tel Aviv Univ., Dept. of Computer Science

http://www.math.tau.ac.il/~sharir/

sharir@math.tau.ac.il

Author, editor, or reviewer of:

- A near-linear algorithm for the planar 2-center problem
- A near-linear algorithm for the planar segment-center problem
- Algorithmic techniqes for geometric optimization
- Algorithms for center and Tverberg points
- Algorithms for weak epsilon-nets
- Almost tight upper bounds for the single cell and zone problems in three dimensions
- Arrangements and their applications
- Computational geometry
- Computing the smallest $k$-enclosing circle and related problems
- Davenport-Schinzel Sequences and their Geometric Applications
- Davenport-Schinzel sequences and their geometric applications{}
- Efficient algorithms for geometric optimization
- Efficient algorithms for maximum regression depth
- On levels in arrangements of lines, segments, planes, and triangles
- On the zone of a surface in a hyperplane arrangement
- On the zone theorem for hyperplane arrangements
- Selecting heavily covered points
- The 2-center problem with obstacles
- The common exterior of convex polygons in the plane
- The discrete 2-center problem
- The union of convex polyhedra in three dimensions
- Translating a planar object to maximize point containment
- Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications