Dara Moazzami (b. 10 December 1949) is an Iranian engineering scientist.
Dara Moazzami | |
|---|---|
| دارا معظمی | |
| Born | 10 December 1949 Tehran, Iran |
| Nationality | Iranian |
| Alma mater | Alborz High School , University of Quebec-Montreal in Canada, University of Northeastern, Boston, Massachusetts, University of Tehran, College of Engineering, Faculty of Engineering Science, Golpayegan University of Technology |
| Known for | Applied mathematics, graph Theory, discrete mathematics, advanced algorithms, approximation algorithms, network vulnerability, tenacity parameter |
| Scientific career | |
| Institutions | Faculty of Engineering Science, College of Engineering, University of Tehran; President of Golpayegan University of Technology, Kennesaw State University |
Early life
editMoazzami earned a BSc in Pure Mathematics in 1976 and an MSc in Applied Mathematics in 1978 from the University of Quebec-Montreal in Canada.[1]
Career
editAfter completing his studies at the University of Quebec-Montreal, Moazzami returned to Iran and worked at Bu-Ali Sina University in Hamedan. In 1992, he received his Ph.D. in applied mathematics from the University of Northeastern-Boston MA, under the supervision of Professors Margaret Cozzens and Samuel Keith Stueckle.[2]
Moazzami is credited with introducing the concept of graph tenacity, which measures network vulnerability and reliability, alongside his professors Cozzens and Stueckle.[3][4]
References
edit- ^ "Moazzami, D.: Application de la theorie de l'hyperstabilit_e _a quelques modeles _economiques (in English: Application of Hyperstability Theory in some Economics Systems), M.Sc. Universite du Quebec a Montreal 1979, National Library of Canada Publication, Ottawa, 1981" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
- ^ "Moazzami, D.: Tenacity and its Properties in Stability Calculation, Ph.D. Dissertation, Northeastern University, Boston, 1992" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
- ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of the Harary graphs, J. Combin. Math. Combin.Comput., 16 (1994), 33{56" (PDF).
- ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of a graph, Graph Theory, Combinatorics, and Algorithms (Yousef Alavi and Allen Schwenk eds.), Wiley, New York, (1995), 1111{1112" (PDF).