Completed Thesis

1. Eyal Ben-Hanoch
   M.Sc.: Feb. 1990. Covering Polygons by Squares.
2. Sergio Fogel
   M.Sc.: Sep. 1990. Ray Shooting: Searching and Counting Queries.
3. Raanan Grinwald
   M.Sc.: Apr. 1991. Merging Polygons with Applications.
4. Alon Efrat
   M.Sc.: Nov. 1993. (Co-supervisor Itai Alon) A Simple Algorithm for Maintaining the Center of a Planar Point Set.
5. Amir Eliaz
   M.Sc.: Mar. 1995. (Co-supervisor Dan Geiger) Word-level Recognition of Handwritten Words from Small Lexicons.
6. Dror Rawitz
   M.Sc.: Apr. 1998. Efficient Algorithms for Integer Programs with Two Variables per Constraint.
7. Zehavit Kehat
   M.Sc.: Feb. 1999. Using the Local-Ratio Principle for Approximating Dense Cases of Covering Problems.
8. Dror Rawitz
   PhD: October 2003. Applications for the Local Ratio Technique for Approximating Covering Problems.
9. Yohai Makbily
   M.Sc.: Sep. 1998. (Co-supervisor Craig Gotsman) Message Management in Distributed Visual Environment Systems.
10. Keren Bendel
    M.Sc.: Apr. 2002 Applications of the Local Ratio Technique: A survay
11. Tzachi Karni
    PhD: Sep. 2004. (Co-supervisor Craig Gotsman) Coding of Animated 3D Objects.
    
12. Jonathan Laserson
    M.Sc.: Sep. 2005. Approximation Algorithms for Sorting Buffers.
13. Ido Feldman
    M.Sc.: Nov. 2005. Improved Approximation Algorithm for Convex Recoloring of Trees.
14. Flysher Guy
    M.Sc.: 2008 Approximation Algorithms for Partial Capacitated Covering Problems.
15. Gleb Polevoy
    M.Sc.: 2012 Bandwidth Allocation in Cellular Networks with Multiple Interferences
16. Beder Michael
    M.Sc.: 2013 Approximation Algorithms for Resource Scheduling and Allocation Problems