Amit Kumar

4.8k citations
119 papers · 2.3k indexed · h-index 26

Amit Kumar

107 papers receiving 2.2k citations

Peers

Amit Kumar
Comparison fields: 5 of 103
  • Computer Networks and Communications 1.4k
  • Computational Theory and Mathematics 532
  • Computer Graphics and Computer-Aided Design 87
  • Signal Processing 267
  • Industrial and Manufacturing Engineering 209
Replace S. S. Ravi with:
S. S. Ravi United States
Yuval Rabani Israel
Daniel J. Rosenkrantz United States
Naveen Garg India
Giorgio Ausiello Italy
Adam Meyerson United States
Giuseppe F. Italiano Italy
Alberto Marchetti-Spaccamela Italy
MohammadTaghi Hajiaghayi United States
Nikhil Bansal United States
Amit Kumar relative to S. S. Ravi United States S. S. Ravi's profile →
Citations per field
00.5×1.5×
S. S. Ravi · 1×
Citations per year

Countries citing papers authored by Amit Kumar

Since Specialization
Citations

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

Fields of papers citing papers by Amit Kumar

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network

The 25 scholars most cited alongside Amit Kumar, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Amit Kumar Line = papers co-authored together Amit Kumar links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20250
2 20240
3 20230
4 20231
5 20222
6 20201
7 20200
8 20201
9 20190
10 20185
11 20172
12
Some fixed point theorem in generalized metric spaces
20161
13 20157
14 20148
15
Fixed point theorem for set valued maps in G-metric space
20131
16
WALCOM : algorithms and computation : 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011 : proceedings
20111
17
On the Optimality of a Class of LP-based Algorithms
20091
18 20051
19
A Constant-Factor Approximation Algorithm for the Multicommodity
200217
20 2002164

About Amit Kumar

Amit Kumar is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics, having authored 119 papers that have together received 2.3k indexed citations. Recurring topics across this work include Optimization and Search Problems (39 papers), Complexity and Algorithms in Graphs (29 papers), Advanced Graph Theory Research (15 papers), Scheduling and Optimization Algorithms (12 papers), Data Management and Algorithms (11 papers), Mobile Ad Hoc Networks (8 papers), Algorithms and Data Compression (7 papers) and Network Traffic and Congestion Control (7 papers). The work is most often cited by research in Computer Networks and Communications (1.4k citations), Computational Theory and Mathematics (532 citations) and Computer Graphics and Computer-Aided Design (87 citations). Amit Kumar has collaborated with scholars based in India, United States and Germany. Frequent co-authors include Jon Kleinberg, Anupam Gupta, David Kempe, Minos Garofalakis, Bülent Yener, Tim Roughgarden, Yogish Sabharwal, Rajeev Rastogi, Naveen Garg and Subhankar Sen. Their work appears in journals such as Algorithmica, SIAM Journal on Computing, IEEE/ACM Transactions on Networking, Journal of Computer and System Sciences and Mathematics of Operations Research.

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