Arnab Bhattacharyya
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics top 10%
- Computer Graphics and Computer-Aided Design top 10%
- Co-authors
- Elena GrigorescuSofya RaskhodnikovaDavid P. WoodruffKyomin JungMadhu SudanA. ShapiraSwastik KoppartyGrant Schoenebeck
- Topics
- Complexity and Algorithms in Graphs (20 papers)Advanced Graph Theory Research (9 papers)Machine Learning and Algorithms (7 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputational Mathematics
- Partner nations
- United StatesSingaporeIndia
In The Last Decade
Arnab Bhattacharyya
32 papers receiving 203 citations
Peers
Comparison fields: 5 of 43
- Computational Theory and Mathematics 160
- Artificial Intelligence 130
- Computer Networks and Communications 56
- Discrete Mathematics and Combinatorics 25
- Computer Graphics and Computer-Aided Design 16
Countries citing papers authored by Arnab Bhattacharyya
This map shows the geographic impact of Arnab Bhattacharyya'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 Arnab Bhattacharyya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnab Bhattacharyya more than expected).
Fields of papers citing papers by Arnab Bhattacharyya
This network shows the impact of papers produced by Arnab Bhattacharyya. 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 Arnab Bhattacharyya. The network helps show where Arnab Bhattacharyya may publish in the future.
Co-authorship network of co-authors of Arnab Bhattacharyya
This figure shows the co-authorship network connecting the top 25 collaborators of Arnab Bhattacharyya. A scholar is included among the top collaborators of Arnab Bhattacharyya 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 Arnab Bhattacharyya. Arnab Bhattacharyya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 1 | |
| 3 | 2 | |
| 4 | 3 | |
| 5 | 2 | |
| 6 | 0 | |
| 7 | 2 | |
| 8 | 4 | |
| 9 | 2 | |
| 10 | 12 | |
| 11 | 1 | |
| 12 | The Complexity of Linear Dependence Problems in Vector Spaces. | 4 |
| 13 | Separations of Matroid Freeness Properties | 1 |
| 14 | Testing monotonicity of distributions over general partial orders. | 3 |
| 15 | 5 | |
| 16 | Transitive-Closure Spanners of the Hypercube and the Hypergrid. | 4 |
| 17 | 21 | |
| 18 | 9 | |
| 19 | A Note on the Distance to Monotonicity of Boolean Functions. | 1 |
| 20 | Testing Linear-Invariant Non-Linear Properties. | 1 |
About Arnab Bhattacharyya
Arnab Bhattacharyya is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 34 papers that have together received 220 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (9 papers) and Machine Learning and Algorithms (7 papers). The work is most often cited by research in Computational Theory and Mathematics (160 citations), Discrete Mathematics and Combinatorics (25 citations) and Computational Mathematics (3 citations). Arnab Bhattacharyya has collaborated with scholars based in United States, Singapore and India. Frequent co-authors include Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Kyomin Jung, Madhu Sudan, A. Shapira, Swastik Kopparty, Grant Schoenebeck, David Zuckerman and Eldar Fischer. Their work appears in journals such as Communications of the ACM, Artificial Intelligence and SIAM Journal on Computing.
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.