Amir Jafari

Email: ajafari[at]
Tel: +98 (21) 6616 5604
P.O. Box 11155-9415, Tehran, Iran.


  1. آمادگی برای المپیادریاضی، کتاب، انتشارات دانشگاه صنعتی شریف ،۱۳۷۶، با همکاری یحیی تابش، رامین تکلوبیغش، کسری رفیع، پیمان کسایی، بهرنگ نوحی
  2. On no-regret learning, fictitious play and Nash equilibrium, 18th International conference on machine learning, 223-226, 2001.(Joint with Greenwald, Gondek and Ercal)
  3.  A general class of no regret algorithms and game theoretic equilibria, Proceedings of the 2003 Computational Learning Theory Conference. Pages 1-11, August, 2003. (Joint with Amy Greenwald)
  4.  On the notion of regret in infinitely played games, Masters Thesis, Brown University, 2003.
  5. Framed mixed Hodge structures associated to Iterated integrals and strong Suslin Reciprocity law on curves, PhD Thesis, Brown University, 2003.
  6. Regularization and generalized double shuffle relations for p-adic multiple zeta values. Compositio Math., Vol 143, 1089-1107, 2007. (Joint with H. Furusho)
  7. Algebraic cycles and motivic generic iterated integrals, Math. Research Letters, Vol 14, no 6, 923-942, 2007. (Joint with H. Furusho)
  8. No Phi regret: a connection between computational learning theory and game theory , Games, Norms and Reasons, Book Chapter, 2011. (Joint with Greenwald and Marks.)

  9. Fundamental Lemma: One of the top ten discoveries in 2009. IPM newsletter, 2010.

  10. Planar Visibility Counting Problem. Conference COCOA 2015, Houston, USA. (Joint with Alipour)

  11. An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. COCOON 2016, 209-221(Joint with Alipour and Ghodsi)

  12. On matching properties of groups and field extensions. Journal of Algebra and Its applications, 2016 .(Joint with Aliabadi and Hadian)
  13. On chromatic number of generalized Kneser graphs, Contributions to Disceret Math, Vol 12, no 2, 2017. (Joint with Alipour)
  14. Tannakian formalism for fiber functors over tensor categories, Periodica Mathematica Hungarica, 2017. (Joint with Einollahzadeh)
  15. Randomized approximation algorithms for planar visibility problem, Theoretical Computer Science, TCS, Vol 2, 2017 (Joint with Alipour and Ghodsi)
  16. Improvements for k-center problem for uncertain data, Conference Proceedings, PODS 2018, Houston, USA. 425-433 (joint with Alipour)
  17. Upper bounds for k-tuple (total) domination numbers of regular graphs. Bulletin of Iranian Math. Society, 1-5 , 2019. (Joint with Alipour and Saghafian)
  18. Upper bounds for the domination numnber of graphs using Turan's theorem and Lovasz local lemma. Graphs and Combinatorics, 1-8, 2019. (joint with Alipour)
  19. On the chromatic number of generalized Kneser graphs and Hadamard matrices. Discrete Math., 2019. (Joint with Moghaddamzadeh)
  20. درباره ریاضیات کوچر بیرکار، خبرنامه انجمن ریاضی، شماره ۱۵۶، ص ۲۳-۲۴، ۱۳۹۷
  21. On some toplogical lower bounds on the chromatic number of Kneser type hypergraphs. Journal of Combinatorial Theory Series B, 146, 372-381 (2021)(Joint with Soheil Azarpendar)
  22. A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs. SPAA 2020501-502 (joint with Sharareh Alipour)
  23. A New Algorithm for Three-Variable Frobenius Coin Problem, SIAM CSE 2021 (joint with Amin Najafi Amin)
  24. Quasi Invariant polynomials of a matrix. 10th Seminar of Linear algebra and its applications. Kerman, Iran 2020. (joint with Amin Najafi Amin)
  25. On abelian and homomorphic secret sharing schemes. (accepted, Journal of Cryptology 2021) (Joint with Shahram Khazaei)
  26. Lower bounds on the chromatic number of certain Kneser type hypergraphs. Submitted (joint with Soheil Azarpendar)
  27. On chromatic number of almost stable general Kneser hypergraphs, (accepted, Journal of Combinatorics, 2021)
  28. Semi-invariant polynomials of a matrix. Submitted, (joint with Amin Najafi Amin)
  29. On (1,2)-domination in cubic graphs. (accepted, Discrete Mathematics, 2021) (joint with Fakharan, Gorzin, Henning, Touserkani)