Hamed Hatami

1.2k total citations
53 papers, 540 citations indexed

About

Hamed Hatami is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Hamed Hatami has authored 53 papers receiving a total of 540 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 22 papers in Discrete Mathematics and Combinatorics and 15 papers in Artificial Intelligence. Recurrent topics in Hamed Hatami's work include Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (21 papers) and Complexity and Algorithms in Graphs (16 papers). Hamed Hatami is often cited by papers focused on Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (21 papers) and Complexity and Algorithms in Graphs (16 papers). Hamed Hatami collaborates with scholars based in Canada, United States and Iran. Hamed Hatami's co-authors include Serguei Norine, Shachar Lovett, Alexander Razborov, Jan Hladký, Daniel Král͏̌, Michael Molloy, Farshad Mirzaee Valadi, Davood Taherinia, László Lovász and Balázs Szegedy and has published in prestigious journals such as Journal of Alloys and Compounds, Energy & Fuels and Journal of Electroanalytical Chemistry.

In The Last Decade

Hamed Hatami

50 papers receiving 501 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Hamed Hatami Canada 12 385 244 153 100 73 53 540
Ilia Ponomarenko Russia 14 141 0.4× 299 1.2× 162 1.1× 151 1.5× 189 2.6× 75 509
Jarosław Grytczuk Poland 13 515 1.3× 276 1.1× 114 0.7× 124 1.2× 69 0.9× 52 549
Sebastian M. Cioabă United States 16 584 1.5× 309 1.3× 711 4.6× 62 0.6× 30 0.4× 61 842
Anna de Mier Spain 11 198 0.5× 231 0.9× 99 0.6× 50 0.5× 42 0.6× 37 308
B. Tayfeh‐Rezaie Iran 13 179 0.5× 193 0.8× 278 1.8× 237 2.4× 170 2.3× 52 520
Steven D. Noble United Kingdom 10 176 0.5× 141 0.6× 123 0.8× 32 0.3× 21 0.3× 35 299
Vilmar Trevisan Brazil 15 380 1.0× 112 0.5× 542 3.5× 29 0.3× 21 0.3× 82 655
Carlos Hoppen Brazil 9 163 0.4× 154 0.6× 157 1.0× 26 0.3× 35 0.5× 51 269
J. Sheehan United Kingdom 14 516 1.3× 446 1.8× 287 1.9× 180 1.8× 57 0.8× 39 696
Lane Clark United States 12 289 0.8× 134 0.5× 160 1.0× 49 0.5× 150 2.1× 39 428

Countries citing papers authored by Hamed Hatami

Since Specialization
Citations

This map shows the geographic impact of Hamed Hatami's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hamed Hatami with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hamed Hatami more than expected).

Fields of papers citing papers by Hamed Hatami

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hamed Hatami. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hamed Hatami. The network helps show where Hamed Hatami may publish in the future.

Co-authorship network of co-authors of Hamed Hatami

This figure shows the co-authorship network connecting the top 25 collaborators of Hamed Hatami. A scholar is included among the top collaborators of Hamed Hatami based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hamed Hatami. Hamed Hatami is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hatami, Hamed, et al.. (2025). Block Complexity and Idempotent Schur Multipliers. International Mathematics Research Notices. 2025(24).
2.
Hatami, Hamed, et al.. (2024). Typical structure of hereditary properties of binary matroids. Journal of Combinatorial Theory Series B. 167. 283–302.
3.
Taherinia, Davood, Hamed Hatami, Farshad Mirzaee Valadi, & Elham Akbarzadeh. (2023). Boosting the electrocatalytic performance of FeSe2 in oxygen evolution reaction via composite formation with halloysite clay mineral. Journal of Alloys and Compounds. 945. 169251–169251. 13 indexed citations
4.
Hatami, Hamed, et al.. (2022). On public-coin zero-error randomized communication complexity. Information Processing Letters. 178. 106293–106293. 1 indexed citations
5.
Taherinia, Davood, Hamed Hatami, Farshad Mirzaee Valadi, & Elham Akbarzadeh. (2022). NiSe2 Nanoparticles Supported on Halloysite Sheets as an Efficient Electrocatalyst toward Alkaline Oxygen Evolution Reaction. Energy & Fuels. 36(23). 14331–14340. 12 indexed citations
6.
Hatami, Hamed, et al.. (2022). . Theory of Computing. 18(1). 1–22. 1 indexed citations
7.
Hatami, Hamed, et al.. (2020). Lower bounds for graph bootstrap percolation via properties of polynomials. Journal of Combinatorial Theory Series A. 174. 105253–105253. 4 indexed citations
8.
Filmus, Yuval, et al.. (2019). Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 1 indexed citations
9.
Dagan, Yuval, Yuval Filmus, Hamed Hatami, & Yaqiao Li. (2018). . Theory of Computing. 14(1). 1–73. 2 indexed citations
10.
Hatami, Hamed, et al.. (2017). Polynomial method and graph bootstrap percolation. arXiv (Cornell University). 4 indexed citations
11.
Hatami, Hamed, et al.. (2016). General systems of linear forms: Equidistribution and true complexity. eScholarship (California Digital Library). 6 indexed citations
12.
Filmus, Yuval & Hamed Hatami. (2014). Bounds on the sum of L1 influences.. arXiv (Cornell University). 2 indexed citations
13.
Hatami, Hamed, et al.. (2014). The inducibility of blow-up graphs. Journal of Combinatorial Theory Series B. 109. 196–212. 12 indexed citations
14.
Hatami, Hamed, Jan Hladký, Daniel Král͏̌, Serguei Norine, & Alexander Razborov. (2013). On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory Series A. 120(3). 722–732. 66 indexed citations
15.
Hatami, Hamed & Shachar Lovett. (2011). Correlation testing for affine invariant properties on F p n in the high error regime. 187–194. 5 indexed citations
16.
Hatami, Hamed. (2009). Decision Trees and Influences of Variables Over Product Probability Spaces. Combinatorics Probability Computing. 18(3). 357–369. 8 indexed citations
17.
Hatami, Hamed, et al.. (2007). Fourier analysis and large independent sets in powers of complete graphs. Journal of Combinatorial Theory Series B. 98(1). 164–172. 5 indexed citations
18.
Hatami, Hamed, et al.. (2005). On the computational complexity of defining sets. Discrete Applied Mathematics. 149(1-3). 101–110. 5 indexed citations
19.
Hatami, Hamed. (2005). Random cubic graphs are not homomorphic to the cycle of size 7. Journal of Combinatorial Theory Series B. 93(2). 319–325. 9 indexed citations
20.
Hatami, Hamed, et al.. (2005). On the size of the minimum critical set of a Latin square. Discrete Mathematics. 293(1-3). 121–127. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026