PhD and MSc Theses
PhD and MSc Theses, since 1988
| Student's Name |
Graduation Year |
Degree |
Abstracts |
Research Name |
| Katzelnick Dor |
2024 |
PhD |
Abstracts |
Approximation Algorithms for Graph Clustering |
| Kutiel Gilad |
2019 |
PhD |
Abstracts |
Approximation Algorithms for Submodular Maximization and Network Design Problems |
| Adir Yarden |
2024 |
MSc |
Abstracts |
Approximating Hierarchical Clustering |
| Barel Emil |
2024 |
MSc |
Abstracts |
Correlation Clustering and Ratio Steiner Cuts in Hypergraphs |
| Zats Roded |
2023 |
MSc |
Abstracts |
Fair Correlation Clustering in General Graphs |
| Sharoni Yotam |
2022 |
MSc |
Abstracts |
Approximation Algorithm for Requirement Cut |
| Mizrachi Eyal |
2022 |
MSc |
Abstracts |
Submodular Maximization with Mixed Packing and Covering Constraints |
| Tur Nitzan |
2021 |
MSc |
Abstracts |
The Metric Relaxation for 0-Extension Admits an Omega(log (2/3)k) Gap |
| Kravi Ayelet |
2021 |
MSc |
Abstracts |
Correlation Clustering With Overlaps |
| Marelly Noa |
2021 |
MSc |
Abstracts |
Fault Tolerant Max-Cut |
| Yeheskel Ran |
2020 |
MSc |
Abstracts |
Graph Balancing with Orientation Costs |
