הטכניון מכון טכנולוגי לישראלXyz
הטכניון מכון טכנולוגי לישראל - בית הספר ללימודי מוסמכים 
Ph.D and MS.c Theses, since 1988.


Advisor Professor Joseph Naor
Advisor's Email naor@cs.technion.ac.il
Advisor's Home-Site www
No of theses 25
Department Computer Science
Department Web Site www.cs.technion.ac.il


No.   Student's Name Graduation
Year
Degree Abstracts Research Name
 1 Yaniv Jonathan 2017 PhD Abstracts Job Scheduling Mechanisms for Cloud Computing
 2 Timnat Erez 2016 MSc Abstracts The List Update Problem
 3 Elad Noa 2015 MSc Abstracts Online Semidefinite Programming
 4 Chen Shahar 2015 PhD Abstracts Online Learning and Competitive Analysis: a Unified Approach
 5 Wajc David 2014 MSc Abstracts Parameterizing P: Proximity to Easy Variants
 6 Feldman Moran 2013 PhD Abstracts Maximization Problems with Submodular Objective Functions
 7 Schwartz Roy 2012 PhD Abstracts Labelings and Partitions of Graphs
 8 Yaniv Jonathan 2011 MSc Abstracts Truthful Mechanisms for Value-Based Scheduling in Cloud Computing
 9 Shalom Israel 2011 MSc Abstracts Online Load-Distance Balancing
 10 Ron-Zewi Noga 2010 MSc Abstracts Vector Representation of Graph Domination
 11 Engelberg Roee 2009 PhD Abstracts Stability in Multi-Agent Environments and Approximation Algorithms for NP-Hard Graph Problems
 12 Amzallag David 2008 PhD Abstracts Approximation Algorithms For Optimization Problems in Future Cellular Networks
 13 Lewin-Eytan Liane 2008 PhD Abstracts Algorithmic Game Theoretic Perspectives of Network Routing and Cost Sharing
 14 Buchbinder Niv 2008 PhD Abstracts Designing Competitive Online Algorithms via a Primal-Dual Approach
 15 Scalosub Gabriel 2007 PhD Abstracts Routing and Scheduling Problems in Data Networks
 16 Landa Shimon 2005 MSc Abstracts Combinatorial Approximation Algorithms for the Fractional Set-Cover Problem
 17 Schwartz Roy 2004 MSc Abstracts Circular Arrangements
 18 Chuzhoy Julia 2004 PhD Abstracts Hardness of Approximation and New Approximability Classes
 19 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
 20 Lewin-Eytan Liane 2002 MSc
Routing and Admission Control in Networks with Advance Reservations
 21 Moss Anna 2001 PhD
High Profit for Low Cost: Approximation Algorithms in Mode-Weighted Graphs
 22 Zosin Leonid 1998 PhD
Relaxed Multi-Commodity Flow and Its Application to the Design of Approximation Algorithms
 23 Freund Ari 1998 MSc
On-Line Assignment with Load Balancing
 24 Tamir Boaz 1995 MSc
K-Connected Graphp Partitions and Approximation Algorithms For Covering Problems
 25 Abarbanel Yael 1994 MSc
Algorithms for Dynamic Graphs

Last updated on: Friday ,February 7, 2020