Deepankar Medhi

623 total citations
12 papers, 285 citations indexed

About

Deepankar Medhi is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Numerical Analysis. According to data from OpenAlex, Deepankar Medhi has authored 12 papers receiving a total of 285 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computer Networks and Communications, 5 papers in Electrical and Electronic Engineering and 3 papers in Numerical Analysis. Recurrent topics in Deepankar Medhi's work include Network Traffic and Congestion Control (4 papers), Advanced Optimization Algorithms Research (3 papers) and Advanced Optical Network Technologies (3 papers). Deepankar Medhi is often cited by papers focused on Network Traffic and Congestion Control (4 papers), Advanced Optimization Algorithms Research (3 papers) and Advanced Optical Network Technologies (3 papers). Deepankar Medhi collaborates with scholars based in United States, Sweden and Poland. Deepankar Medhi's co-authors include Karthikeyan Ramasamy, Amit Kumar Sinha, David Tipper, Kenneth Mitchell, William Yurcik and Sanjay Srivastava and has published in prestigious journals such as Mathematical Programming, Annals of Operations Research and Journal of Optimization Theory and Applications.

In The Last Decade

Deepankar Medhi

12 papers receiving 253 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Deepankar Medhi United States 7 200 120 34 28 25 12 285
Lorant Porkolab Germany 9 128 0.6× 40 0.3× 32 0.9× 104 3.7× 25 1.0× 14 267
Ralf Diekmann Germany 8 152 0.8× 91 0.8× 15 0.4× 46 1.6× 72 2.9× 13 239
Kenneth J. Thurber United States 9 216 1.1× 65 0.5× 31 0.9× 33 1.2× 144 5.8× 42 301
János Balogh Hungary 9 120 0.6× 41 0.3× 22 0.6× 44 1.6× 4 0.2× 33 246
C. Chase United States 8 130 0.7× 183 1.5× 29 0.9× 30 1.1× 82 3.3× 18 331
Doron Chen Israel 9 47 0.2× 28 0.2× 19 0.6× 71 2.5× 10 0.4× 20 238
Jean-Charles Tournier Switzerland 11 87 0.4× 132 1.1× 23 0.7× 51 1.8× 46 1.8× 21 262
R. J. Swan United States 7 230 1.1× 37 0.3× 62 1.8× 26 0.9× 214 8.6× 11 317
Frédéric Roupin France 8 64 0.3× 29 0.2× 40 1.2× 121 4.3× 4 0.2× 18 210
Rene L. Cruz United States 13 533 2.7× 298 2.5× 50 1.5× 13 0.5× 43 1.7× 35 601

Countries citing papers authored by Deepankar Medhi

Since Specialization
Citations

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

Fields of papers citing papers by Deepankar Medhi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Deepankar Medhi

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

All Works

12 of 12 papers shown
1.
Medhi, Deepankar & Karthikeyan Ramasamy. (2007). Network Routing: Algorithms, Protocols, and Architectures. CERN Document Server (European Organization for Nuclear Research). 209 indexed citations
2.
Sinha, Amit Kumar, Kenneth Mitchell, & Deepankar Medhi. (2005). Periodicity in TCP Session Arrivals in Broadband Fixed Wireless Access Networks. 3. 2092–2095. 2 indexed citations
3.
Sinha, Amit Kumar, Kenneth Mitchell, & Deepankar Medhi. (2004). Flow-level upstream traffic behavior in broadband access networks: DSL versus broadband fixed wireless. 135–141. 9 indexed citations
4.
Srivastava, Sanjay, et al.. (2004). Backup path restoration design using path generation technique. Lund University Publications (Lund University). 77–84. 3 indexed citations
5.
Yurcik, William, David Tipper, & Deepankar Medhi. (2002). Scalable survivable ATM group communications. 2. 1031–1036. 1 indexed citations
6.
Yurcik, William, David Tipper, & Deepankar Medhi. (2000). The use of hop-limits to provide survivable ATM group communications. 131–140. 2 indexed citations
7.
Medhi, Deepankar & David Tipper. (1997). Towards Fault Recovery and Management in Communication Networks. Journal of Network and Systems Management. 5(2). 101–103. 6 indexed citations
8.
Medhi, Deepankar, et al.. (1996). Generalized proximal point algorithm for convex optimization. Journal of Optimization Theory and Applications. 88(2). 475–488. 3 indexed citations
9.
Medhi, Deepankar, et al.. (1995). Optimization and performance of restoration schemes for wide-area teletraffic networks. Journal of Network and Systems Management. 3(3). 265–294. 15 indexed citations
10.
Medhi, Deepankar. (1994). Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs. Mathematical Programming. 66(1-3). 79–101. 6 indexed citations
11.
Medhi, Deepankar. (1990). Parallel bundle-based decomposition for large-scale structured mathematical programming problems. Annals of Operations Research. 22(1). 101–127. 20 indexed citations
12.
Medhi, Deepankar. (1987). Decomposition of structured large-scale optimization problems and parallel optimization. Minds at UW (University of Wisconsin). 9 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