Devdatt Dubhashi
Impact in
-
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
Papers in
-
- Complexity and Algorithms in Graphs 22
- Graph Labeling and Dimension Problems 4
-
- Limits and Structures in Graph Theory 11
- Advanced Combinatorial Mathematics 4
- Co-authors
- Alessandro Panconesi (12 shared papers)Desh Ranjan (4 shared papers)Fredrik Johansson (10 shared papers)Olof Mogren (3 shared papers)Malte Hermansson (3 shared papers)Nina Tahmasebi (2 shared papers)Jaikumar Radhakrishnan (1 shared paper)Aravind Srinivasan (1 shared paper)
In The Last Decade
Devdatt Dubhashi
80 papers receiving 2k citations
Devdatt Dubhashi's Hit Papers
Peers
Comparison fields: 5 of 112
- Computational Theory and Mathematics 437
- Discrete Mathematics and Combinatorics 112
- Modeling and Simulation 104
- Artificial Intelligence 569
- Computer Networks and Communications 366
Countries citing papers authored by Devdatt Dubhashi
This map shows the geographic impact of Devdatt Dubhashi'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 Devdatt Dubhashi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Devdatt Dubhashi more than expected).
Fields of papers citing papers by Devdatt Dubhashi
This network shows the impact of papers produced by Devdatt Dubhashi. 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 Devdatt Dubhashi. The network helps show where Devdatt Dubhashi may publish in the future.
Co-authors
The 25 scholars most cited alongside Devdatt Dubhashi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 88 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Concentration of Measure for the Analysis of Randomized Algorithms Hit paper breakdown → | 2009 | 570 |
| 2 | 1998 | 226 | |
| 3 | 2014 | 134 | |
| 4 | 2020 | 131 | |
| 5 | 2005 | 119 | |
| 6 | 2011 | 113 | |
| 7 | 2022 | 76 | |
| 8 | 2009 | 66 | |
| 9 | 1998 | 47 | |
| 10 | 2013 | 43 | |
| 11 | 1996 | 38 | |
| 12 | Global graph kernels using geometric embeddings | 2014 | 34 |
| 13 | 2006 | 22 | |
| 14 | 2006 | 22 | |
| 15 | 2015 | 22 | |
| 16 | 1996 | 17 | |
| 17 | 1995 | 16 | |
| 18 | Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery | 2017 | 15 |
| 19 | 2006 | 14 | |
| 20 | 1998 | 13 |
About Devdatt Dubhashi
Devdatt Dubhashi is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Statistics and Probability, Artificial Intelligence and Computer Networks and Communications, having authored 88 papers that have together received 2.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (22 papers), Probability and Statistical Research (12 papers), Limits and Structures in Graph Theory (11 papers), Optimization and Search Problems (5 papers), Advanced Combinatorial Mathematics (4 papers), Graph Theory and Algorithms (4 papers), Graph Labeling and Dimension Problems (4 papers) and Embedded Systems Design Techniques (4 papers). The work is most often cited by research in Computational Theory and Mathematics (437 citations), Discrete Mathematics and Combinatorics (112 citations), Modeling and Simulation (104 citations), Artificial Intelligence (569 citations) and Computer Networks and Communications (366 citations). Devdatt Dubhashi has collaborated with scholars based in Sweden, Germany and India. Frequent co-authors include Alessandro Panconesi, Desh Ranjan, Fredrik Johansson, Olof Mogren, Malte Hermansson, Nina Tahmasebi, Jaikumar Radhakrishnan, Aravind Srinivasan, Alessandro Mei and MADHAV V. MARATHE. Their work appears in journals such as Theoretical Computer Science, Communications of the ACM, Random Structures and Algorithms, Nature Communications and BMC Bioinformatics.
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.