Mohsen Ghaffari

2.3k total citations
77 papers, 610 citations indexed

About

Mohsen Ghaffari is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Mohsen Ghaffari has authored 77 papers receiving a total of 610 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computer Networks and Communications, 48 papers in Computational Theory and Mathematics and 34 papers in Artificial Intelligence. Recurrent topics in Mohsen Ghaffari's work include Complexity and Algorithms in Graphs (46 papers), Optimization and Search Problems (25 papers) and Cryptography and Data Security (19 papers). Mohsen Ghaffari is often cited by papers focused on Complexity and Algorithms in Graphs (46 papers), Optimization and Search Problems (25 papers) and Cryptography and Data Security (19 papers). Mohsen Ghaffari collaborates with scholars based in Switzerland, United States and Germany. Mohsen Ghaffari's co-authors include Fabian Kühn, Bernhard Haeupler, Merav Parter, Manuela Fischer, Jason Li, Keren Censor-Hillel, Slobodan Mitrović, Calvin Newport, Nancy Lynch and Jara Uitto and has published in prestigious journals such as SHILAP Revista de lepidopterología, Expert Systems with Applications and SIAM Journal on Computing.

In The Last Decade

Mohsen Ghaffari

74 papers receiving 590 citations

Peers

Mohsen Ghaffari
Bernhard Haeupler United States
Magnus Wahlström United Kingdom
Desh Ranjan United States
Stasys Jukna Germany
Uri N. Peled United States
Lap Chi Lau Hong Kong
Andrej Bogdanov Hong Kong
Bernhard Haeupler United States
Mohsen Ghaffari
Citations per year, relative to Mohsen Ghaffari Mohsen Ghaffari (= 1×) peers Bernhard Haeupler

Countries citing papers authored by Mohsen Ghaffari

Since Specialization
Citations

This map shows the geographic impact of Mohsen Ghaffari'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 Mohsen Ghaffari with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mohsen Ghaffari more than expected).

Fields of papers citing papers by Mohsen Ghaffari

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mohsen Ghaffari. 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 Mohsen Ghaffari. The network helps show where Mohsen Ghaffari may publish in the future.

Co-authorship network of co-authors of Mohsen Ghaffari

This figure shows the co-authorship network connecting the top 25 collaborators of Mohsen Ghaffari. A scholar is included among the top collaborators of Mohsen Ghaffari 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 Mohsen Ghaffari. Mohsen Ghaffari 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.
Emek, Yuval, et al.. (2024). Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM Journal on Computing. 53(2). 247–286.
2.
Ghaffari, Mohsen, et al.. (2024). Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. 2148–2179. 1 indexed citations
3.
Ghaffari, Mohsen, et al.. (2023). Node and edge averaged complexities of local graph problems. Distributed Computing. 36(4). 451–473. 1 indexed citations
4.
Ghaffari, Mohsen, et al.. (2023). Formal Specification and Testing for Reinforcement Learning. Proceedings of the ACM on Programming Languages. 7(ICFP). 125–158. 3 indexed citations
5.
Ghaffari, Mohsen, et al.. (2023). Faster Deterministic Distributed MIS and Approximate Matching. 1777–1790. 5 indexed citations
6.
Haeupler, Bernhard, Harald Räcke, & Mohsen Ghaffari. (2022). Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. 1325–1338. 8 indexed citations
7.
Ghaffari, Mohsen, et al.. (2021). Hop-constrained oblivious routing. 1208–1220. 5 indexed citations
8.
Ghaffari, Mohsen, et al.. (2020). Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 179. 34. 2 indexed citations
9.
Emek, Yuval, et al.. (2019). Distributed Algorithms for Low Stretch Spanning Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–14. 1 indexed citations
10.
Ghaffari, Mohsen, Silvio Lattanzi, & Slobodan Mitrović. (2019). Improved Parallel Algorithms for Density-Based Network Clustering. International Conference on Machine Learning. 2201–2210. 8 indexed citations
11.
Ghaffari, Mohsen, et al.. (2019). Improved Network Decompositions using Small Messages with Applications\n on MIS, Neighborhood Covers, and Beyond. arXiv (Cornell University). 2 indexed citations
12.
Even, Guy, et al.. (2018). Distributed set cover approximation: Primal-dual with optimal locality. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 121. 14. 1 indexed citations
13.
Ghaffari, Mohsen, Andreas Karrenbauer, Fabian Kühn, Christoph Lenzen, & Boaz Patt-Shamir. (2018). Near-Optimal Distributed Maximum Flow. SIAM Journal on Computing. 47(6). 2078–2117. 10 indexed citations
14.
Ghaffari, Mohsen, et al.. (2018). Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 129–138. 38 indexed citations
15.
Clementi, Andrea, et al.. (2018). A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
16.
Fischer, Manuela & Mohsen Ghaffari. (2017). Deterministic Distributed Matching: Simpler, Faster, Better.. arXiv (Cornell University). 2 indexed citations
17.
Fischer, Manuela & Mohsen Ghaffari. (2017). Sublogarithmic Distributed Algorithms for Lov\\'asz Local lemma, and the\n Complexity Hierarchy. arXiv (Cornell University). 10 indexed citations
18.
Ghaffari, Mohsen, David R. Karger, & Debmalya Panigrahi. (2017). Random Contractions and Sampling for Hypergraph and Hedge Connectivity. DSpace@MIT (Massachusetts Institute of Technology). 1101–1114. 6 indexed citations
19.
Ghaffari, Mohsen & Bernhard Haeupler. (2015). Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. 202–219. 21 indexed citations
20.
Ghaffari, Mohsen & Farid Ashtiani. (2009). A New Routing Algorithm for Sparse Vehicular Ad-Hoc Networks with Moving Destinations. 1–6. 6 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