Presentation Schedule

[Hamid Zarrabi-Zadeh]

Salaam,

The class presentations are scheduled as follows:

Sunday, 4 Dey:

1. [Mahdi Safarnejad] Quake heaps
2. [Marjan Adeli] Variations on union-find
3. [Yousef Alizadeh] Primality Testing
4. [Ehsan Shoja] Dynamic all-pairs shortest path
5. [Arash Vaezi] Randomized algorithms for geometric pattern matching
6. [Sharareh Alipour] Approximation algorithms for maximum independent set
7. [Hajar Naji] Faster exponential algorithms for graph coloring
8. [Hassan Nikaein] An efficient algorithm for maximum flow
   

Tuesday, 6 Dey:

1. [Hamid Homapour] Heaps Simplified
2. [Mahmood AliMohammadi] Dynamic connectivity
3. [Ali Narenji] A fast string matching algorithm
4. [Farnaz Tehranchi] Randomized algorithms for triangulating polygons
5. [Masood Seddighin] More news on SAT
6. [Mehran Mehr] Approximation algorithms for maximum metric TSP
7. [Zahra Barakchian] An on-line coloring problem
8. [Mahdieh Rostamian] Optimal Iterative Pricing over Social Networks
   

Good luck,
Zarrabi-Zadeh