| 14 | |
| 13 |
Hila Ohana Thesis: Partial matching on grids using Manhattan distances pdf Date: May 4, 2022 Publication: Operations Research Letters Co-advisors: Nili Beck and Michal Stern |
| 12 | |
| 11 | |
| 10 | |
| 9 |
Yuval Beccovich Project: Maximum Matching on N-Dimensional Graphs Using Manhattan Distances Date: 2018
Co-advisors: Nili Beck and Michal Stern |
| 8 |
Yulia Kostina Project: Maximal Matching on Multilevel banks River Date: 2017 Publication: Operations Research Letters Co-advisors: Nili Beck and Michal Stern |
| 7 |
Roni Rozen Project: Node Deletion of Data For Intersecting clusters Date: 2016 Publication: Discrete Applied Mathematics Co-advisors: Nili Beck and Michal Stern |
| 6 |
Zeev Sorek Project: Clustered Spanning tree – Conditions for Feasibility pdf Date: 2015 Publication: Discrete Mathematics and Theoretical Computer Science Co-advisors: Nili Beck and Michal Stern |
| 5 |
Chen Cohen Project: Node deletion for constructing spanning tree with cluster constraints Date: 2014
Co-advisors: Nili Beck and Michal Stern |
| 4 |
Eitan Shvartz Project: Obnoxious Points Optimal Matching Date: 2014 Publication: Operations Research Letters Co-advisors: Nili Beck and Michal Stern |
| 3 |
Talya Stern Project: Graph changes by addition for intersecting clusters Date: 2011
Co-advisors: Nili Beck and Michal Stern |
| 2 |
Vered Hanuka Project: Graph changes by node deletion for intersecting clusters Date: 2010
Co-advisors: Nili Beck and Michal Stern |
| 1 |
Eyal Knaan Project: Approximation Algorithms for Not Necessarily Disjoint Clustered TSP Date: 2010 Publication: Journal of Graph Algorithms and Applications Co-advisors: Nili Beck and Michal Stern |