Sepehr Assadi
- Computer Networks and Communications top 5%
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Management Science and Operations Research top 10%
- Computer Science Applications top 10%
- Co-authors
- Sanjeev KhannaJustin HsuShahin JabbariSahil SinglaYang LiGillat KolVíctor M. PreciadoYu Chen
- Topics
- Complexity and Algorithms in Graphs (33 papers)Optimization and Search Problems (28 papers)Advanced Graph Theory Research (13 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsComputer Science Applications
- Journals
- SHILAP Revista de lepidopterologíaSIAM Journal on ComputingAlgorithmica
- Partner nations
- United StatesNetherlandsIsrael
In The Last Decade
Sepehr Assadi
43 papers receiving 295 citations
Peers
Comparison fields: 5 of 40
- Computer Networks and Communications 171
- Computational Theory and Mathematics 156
- Artificial Intelligence 110
- Management Science and Operations Research 67
- Computer Science Applications 37
Countries citing papers authored by Sepehr Assadi
This map shows the geographic impact of Sepehr Assadi'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 Sepehr Assadi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sepehr Assadi more than expected).
Fields of papers citing papers by Sepehr Assadi
This network shows the impact of papers produced by Sepehr Assadi. 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 Sepehr Assadi. The network helps show where Sepehr Assadi may publish in the future.
Co-authorship network of co-authors of Sepehr Assadi
This figure shows the co-authorship network connecting the top 25 collaborators of Sepehr Assadi. A scholar is included among the top collaborators of Sepehr Assadi 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 Sepehr Assadi. Sepehr Assadi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 11 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 3 | |
| 5 | 6 | |
| 6 | 1 | |
| 7 | Improved Bounds for Distributed Load Balancing | 1 |
| 8 | 3 | |
| 9 | 11 | |
| 10 | 2 | |
| 11 | 0 | |
| 12 | 4 | |
| 13 | 6 | |
| 14 | Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. | 13 |
| 15 | 10 | |
| 16 | 12 | |
| 17 | 13 | |
| 18 | 19 | |
| 19 | 16 | |
| 20 | On the Rectangle Escape Problem. | 2 |
About Sepehr Assadi
Sepehr Assadi is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research, having authored 48 papers that have together received 296 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (33 papers), Optimization and Search Problems (28 papers) and Advanced Graph Theory Research (13 papers). The work is most often cited by research in Computational Theory and Mathematics (156 citations), Computer Networks and Communications (171 citations) and Computer Science Applications (37 citations). Sepehr Assadi has collaborated with scholars based in United States, Netherlands and Israel. Frequent co-authors include Sanjeev Khanna, Justin Hsu, Shahin Jabbari, Sahil Singla, Yang Li, Yang Li, Gillat Kol, Víctor M. Preciado, Yu Chen and Yang Li. Their work appears in journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Algorithmica.
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.