PhD and MSc Theses
PhD and MSc Theses, since 1988
Student's Name |
Graduation Year |
Degree |
Abstracts |
Research Name |
Talmon Ohad |
2022 |
PhD |
Abstracts |
Improved Bounds for Online Aggregation and Caching |
Fairstein Yaron |
2022 |
PhD |
Abstracts |
Dynamicity and Multi-Commodity in Networks |
Yaniv Jonathan |
2017 |
PhD |
Abstracts |
Job Scheduling Mechanisms for Cloud Computing |
Chen Shahar |
2015 |
PhD |
Abstracts |
Online Learning and Competitive Analysis: a Unified Approach |
Engelberg Roee |
2009 |
PhD |
Abstracts |
Stability in Multi-Agent Environments and Approximation Algorithms for NP-Hard Graph Problems |
Amzallag David |
2008 |
PhD |
Abstracts |
Approximation Algorithms For Optimization Problems in Future Cellular Networks |
Buchbinder Niv |
2008 |
PhD |
Abstracts |
Designing Competitive Online Algorithms via a Primal-Dual Approach |
Feldman Moran |
2013 |
PhD |
Abstracts |
Maximization Problems with Submodular Objective Functions |
Chuzhoy Julia |
2004 |
PhD |
Abstracts |
Hardness of Approximation and New Approximability Classes |
Schwartz Roy |
2012 |
PhD |
Abstracts |
Labelings and Partitions of Graphs |
Moss Anna |
2001 |
PhD |
|
High Profit for Low Cost: Approximation Algorithms in Mode-Weighted Graphs |
Zosin Leonid |
1998 |
PhD |
|
Relaxed Multi-Commodity Flow and Its Application to the Design of Approximation Algorithms |
Scalosub Gabriel |
2007 |
PhD |
Abstracts |
Routing and Scheduling Problems in Data Networks |
Freund Ari |
2003 |
PhD |
Abstracts |
On-Line and Off-Line Approximation Algorithms for Various Resource Allocation and Scheduling Problems and for the Multiway Cut Problem |
Lewin-Eytan Liane |
2008 |
PhD |
Abstracts |
Algorithmic Game Theoretic Perspectives of Network Routing and Cost Sharing |
Tsachor Tomer |
2024 |
MSc |
Abstracts |
Online Weighted Paging With Distributions |
Kravi Ayelet |
2021 |
MSc |
Abstracts |
Correlation Clustering With Overlaps |
Timnat Erez |
2016 |
MSc |
Abstracts |
The List Update Problem |
Elad Noa |
2015 |
MSc |
Abstracts |
Online Semidefinite Programming |
Wajc David |
2014 |
MSc |
Abstracts |
Parameterizing P: Proximity to Easy Variants |
Yaniv Jonathan |
2011 |
MSc |
Abstracts |
Truthful Mechanisms for Value-Based Scheduling in Cloud Computing |
Shalom Israel |
2011 |
MSc |
Abstracts |
Online Load-Distance Balancing |
Ron-Zewi Noga |
2010 |
MSc |
Abstracts |
Vector Representation of Graph Domination |
Landa Shimon |
2005 |
MSc |
Abstracts |
Combinatorial Approximation Algorithms for the Fractional Set-Cover Problem |
Schwartz Roy |
2004 |
MSc |
Abstracts |
Circular Arrangements |
Freund Ari |
1998 |
MSc |
|
On-Line Assignment with Load Balancing |
Tamir Boaz |
1995 |
MSc |
|
K-Connected Graphp Partitions and Approximation Algorithms For Covering Problems |
Abarbanel Yael |
1994 |
MSc |
|
Algorithms for Dynamic Graphs |
Lewin-Eytan Liane |
2002 |
MSc |
|
Routing and Admission Control in Networks with Advance Reservations |