Related Research Articles
Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.
Sharif University of Technology is a public research university in Tehran, Iran. It is widely considered as the nation's most prestigious and leading institution for science, technology, engineering, and mathematics (STEM) fields and is considered Iran's MIT among academics, scholars, and industry.
Nima Arkani-Hamed is an American-Canadian theoretical physicist of Iranian descent, with interests in high-energy physics, quantum field theory, string theory, cosmology and collider physics. Arkani-Hamed is a member of the permanent faculty at the Institute for Advanced Study in Princeton, New Jersey. He is also Director of the Carl P. Feinberg Cross-Disciplinary Program in Innovation at the Institute and director of The Center for Future High Energy Physics (CFHEP) in Beijing, China.
Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.
Mohammad-Ali Najafi is an Iranian mathematician and reformist politician who was the Mayor of Tehran, serving in the post for eight months, until April 2018. He held cabinet portfolios during the 1980s, 1990s and 2010s. He is also a retired professor of mathematics at Sharif University of Technology.
Abbas Edalat is a British-Iranian academic who is a professor of computer science and mathematics at the Department of Computing, Imperial College London and a political activist. In a 2018 letter to The Guardian, 129 experts in computer science, mathematics and machine learning described him as "a prominent academic, making fundamental contributions to mathematical logic and theoretical computer science" Edalat also founded SAF and CASMII, a campaign against sanctions and military intervention in Iran.
Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada and a Visiting Professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.
András Hajnal was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.
Mehdi Behzad is an Iranian mathematician specializing in graph theory. He introduced his total coloring theory during his Ph.D. studies in 1965. Despite the active work during the last 50 years this conjecture remains as challenging as it is open. In fact, Behzad's conjecture now belongs to mathematics’ classic open problems.
Fred Stephen Roberts is an American mathematician, a professor of mathematics at Rutgers University, and a former director of DIMACS.
A Euclidean graph is periodic if there exists a basis of that Euclidean space whose corresponding translations induce symmetries of that graph. Equivalently, a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph. A Euclidean graph is uniformly discrete if there is a minimal distance between any two vertices. Periodic graphs are closely related to tessellations of space and the geometry of their symmetry groups, hence to geometric group theory, as well as to discrete geometry and the theory of polytopes, and similar areas.
Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University. He specializes in probabilistic combinatorics, graph theory, graph algorithms, Steiner trees, web graphs, mine optimization, and other areas in combinatorics.
Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Ortrud R. Oellermann is a South African mathematician specializing in graph theory. She is a professor of mathematics at the University of Winnipeg.
Dara Moazzami is an Iranian engineering scientist.
Rebecca N. Wright is an American computer scientist known for her research in computer security. She is the Druckenmiller Professor of Computer Science at Barnard College.
Hao Huang is a mathematician known for solving the sensitivity conjecture. Huang is currently an associate professor in the mathematics department at National University of Singapore.
References
- 1 2 "E. S. Mahmoodian". sharif.ir. Retrieved 2017-03-22.
- ↑ "Ebadollah Mahmoodian – The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.edu. Retrieved 2017-03-22.
- ↑ Charles J. Colbourn; Ebadollah S. Mahmoodian, eds. (1995). Combinatorics Advances. Mathematics and its Applications, 329. Dordrecht: Kluwer Academic Publishers Group.
- ↑ Mahmoodian, E.S; Naserasr, Reza; Zaker, Manouchehr (1997). "Defining sets in vertex colorings of graphs and latin rectangles". Discrete Mathematics. 167–168: 451–60. doi: 10.1016/S0012-365X(96)00247-6 .
- ↑ "DIMACS – RUTGERS EXPERIMENTAL MATHEMATICS SEMINAR". dimacs.rutgers.edu. Retrieved 2017-03-25.
