Deeparnab Chakrabarty

1.7k total citations
45 papers, 492 citations indexed

About

Deeparnab Chakrabarty is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Deeparnab Chakrabarty has authored 45 papers receiving a total of 492 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 27 papers in Computer Networks and Communications and 16 papers in Artificial Intelligence. Recurrent topics in Deeparnab Chakrabarty's work include Complexity and Algorithms in Graphs (27 papers), Optimization and Search Problems (23 papers) and Auction Theory and Applications (14 papers). Deeparnab Chakrabarty is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Optimization and Search Problems (23 papers) and Auction Theory and Applications (14 papers). Deeparnab Chakrabarty collaborates with scholars based in United States, India and Canada. Deeparnab Chakrabarty's co-authors include Rajan M. Lukose, Y. Zhou, Gagan Goel, C. Seshadhri, Sanjeev Khanna, Julia Chuzhoy, Chaitanya Swamy, David Pritchard, Nikhil R. Devanur and Aranyak Mehta and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Mathematics of Operations Research.

In The Last Decade

Deeparnab Chakrabarty

42 papers receiving 458 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Deeparnab Chakrabarty United States	12	226	196	195	104	97	45	492
Gagan Goel United States	14	330 1.5×	418 2.1×	132 0.7×	116 1.1×	143 1.5×	32	624
M. X. Goemans United States	10	307 1.4×	183 0.9×	343 1.8×	105 1.0×	11 0.1×	13	696
Chinmay Karande United States	9	214 0.9×	143 0.7×	118 0.6×	104 1.0×	33 0.3×	11	421
MohammadHossein Bateni United States	12	172 0.8×	62 0.3×	165 0.8×	107 1.0×	21 0.2×	33	404
Nick Gravin Singapore	12	104 0.5×	300 1.5×	52 0.3×	66 0.6×	77 0.8×	37	394
Shaddin Dughmi United States	17	222 1.0×	556 2.8×	56 0.3×	99 1.0×	190 2.0×	45	677
Shuichi Miyazaki Japan	14	196 0.9×	257 1.3×	276 1.4×	109 1.0×	15 0.2×	45	694
Yishay Mansour Israel	19	701 3.1×	154 0.8×	160 0.8×	126 1.2×	18 0.2×	50	917
Paolo Penna Italy	10	219 1.0×	118 0.6×	48 0.2×	46 0.4×	18 0.2×	48	367
Varsha Dani United States	10	243 1.1×	402 2.1×	85 0.4×	362 3.5×	19 0.2×	22	582

Countries citing papers authored by Deeparnab Chakrabarty

Since Specialization

Citations

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

Fields of papers citing papers by Deeparnab Chakrabarty

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Deeparnab Chakrabarty

This figure shows the co-authorship network connecting the top 25 collaborators of Deeparnab Chakrabarty. A scholar is included among the top collaborators of Deeparnab Chakrabarty 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 Deeparnab Chakrabarty. Deeparnab Chakrabarty is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chakrabarty, Deeparnab, et al.. (2022). Improved Lower Bounds for Submodular Function Minimization. 118. 245–254. 2 indexed citations

Assadi, Sepehr, Deeparnab Chakrabarty, & Sanjeev Khanna. (2021). Graph connectivity and single element recovery via linear and OR queries. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 7. 1 indexed citations

Chakrabarty, Deeparnab, et al.. (2020). . Theory of Computing. 16(1). 1–36. 1 indexed citations

Chakrabarty, Deeparnab, et al.. (2019). Fair Algorithms for Clustering. Neural Information Processing Systems. 32. 4954–4965. 9 indexed citations

Chakrabarty, Deeparnab, et al.. (2019). Faster Matroid Intersection. 1146–1168. 7 indexed citations

Chakrabarty, Deeparnab, Alina Ene, Ravishankar Krishnaswamy, & Debmalya Panigrahi. (2018). Online Buy-at-Bulk Network Design. SIAM Journal on Computing. 47(4). 1505–1528. 1 indexed citations

Chakrabarty, Deeparnab, et al.. (2017). Subquadratic submodular function minimization. 1220–1231. 11 indexed citations

Chakrabarty, Deeparnab, et al.. (2017). Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 80. 14. 3 indexed citations

Chakrabarty, Deeparnab, et al.. (2016). A Õ(n) Non-Adaptive Tester for Unateness.. Electronic colloquium on computational complexity. 23. 133. 1 indexed citations

10.

Bhartia, Apurv, Deeparnab Chakrabarty, Krishna Chintalapudi, et al.. (2016). IQ-Hopping. 9 indexed citations

11.

Chakrabarty, Deeparnab, et al.. (2015). Property testing on product distributions: optimal testers for bounded derivative properties. Symposium on Discrete Algorithms. 13(2). 1809–1828. 2 indexed citations

12.

Chakrabarty, Deeparnab & C. Seshadhri. (2014). . Theory of Computing. 10(1). 453–464. 12 indexed citations

13.

Chakrabarty, Deeparnab, Gagan Goel, Vijay V. Vazirani, Lei Wang, & Changyuan Yu. (2014). Submodularity Helps in Nash and Nonsymmetric Bargaining Games. SIAM Journal on Discrete Mathematics. 28(1). 99–115. 2 indexed citations

14.

Chakrabarty, Deeparnab, et al.. (2014). On (1,∊)-Restricted Assignment Makespan Minimization. 1087–1101. 6 indexed citations

15.

Chakrabarty, Deeparnab & C. Seshadhri. (2013). Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. 419–428. 19 indexed citations

16.

Chakrabarty, Deeparnab, et al.. (2010). G-parking functions, acyclic orientations and spanning trees. Discrete Mathematics. 310(8). 1340–1353. 17 indexed citations

17.

Chakrabarty, Deeparnab, Aranyak Mehta, & Vijay V. Vazirani. (2010). Design is as Easy as Optimization. SIAM Journal on Discrete Mathematics. 24(1). 270–286.

18.

Pritchard, David & Deeparnab Chakrabarty. (2010). Approximability of Sparse Integer Programs. Algorithmica. 61(1). 75–93. 12 indexed citations

19.

Ammar, Mostafa, et al.. (2009). Algorithms for Message Ferrying on Mobile ad hoc Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4. 13–24. 5 indexed citations

20.

Chakrabarty, Deeparnab, Aranyak Mehta, & Viswanath Nagarajan. (2005). Fairness and optimality in congestion games. 52–57. 25 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