Pooya Hatami

Department of Mathematical Sciences

Sharif University of Technology

I am a third year undergraduate student of Computer Science.

E-mail:  p_hatami  at  ce  dot sharif  dot  edu

 

Research Interests

    Combinatorics, Theoretical Computer Science, Graph Theory, Algorithms and Approximation Algorithms.

Honors & Awards

 

 

Publications

  1. P. Hatami, An Approximation Algorithm for the Total Covering Problem, Discussiones Mathematicae Graph Theory, Vol. 27 No.3 (2007) pp. 553-560.

  2. H. Hatami, P. Hatami, Perfect dominating sets in the Cartesian products of prime cycles, Electronic Journal of Combinatorics, 14(1), 2007, N8.

  3. P. Shor, P. Hatami, A lower Bound for the Length of a Partial Transversal in a Latin Square, Journal of Combinatorial Theory, Series A. (In press).

  4. B. Behsaz, P. Hatami, E. S. Mahmoodian, On minimum vertex covers in generalized Petersen graphs, Australasian Journal of Combinatorics, Vol. 40 (2007) pp. 253-264.

  5. B. Behsaz, P. Hatami, Measure preserving homomorphisms and independent sets in tensor graph powers, Discrete Mathematics  (In press).

  6. M. Behzad, P. Hatami, E. S. Mahmoodian, Minimum vertex cover of generalized Petersen graphs, Bulletin of the ICA.

  7. S. Akbari, S. Bolouki, P. Hatami, M. Siami, Some bounds for signed edge domination number of
    graphs, Discrete Mathematics (Accepted)

Personals