Narendra Karmarkar

7.9k citations
27 papers · 4.6k indexed · 2 hit papers · h-index 16
Topics
Advanced Optimization Algorithms Research (8 papers)Optimization and Packing Problems (7 papers)Computational Geometry and Mesh Generation (5 papers)

In The Last Decade

Narendra Karmarkar

25 papers receiving 4.1k citations

Hit Papers

A new polynomial-time algorithm for linear programming19842026199820121984198450010001.5k2.0k2.5k

Peers

Narendra Karmarkar
Comparison fields: 5 of 124
  • Computational Theory and Mathematics 2.2k
  • Numerical Analysis 1.7k
  • Computer Networks and Communications 922
  • Artificial Intelligence 713
  • Electrical and Electronic Engineering 702
Replace Reiner Horst with:
Reiner Horst Germany
Franz Rendl Austria
Henry Wolkowicz Canada
J. B. Rosen United States
Michel X. Goemans United States
Leonid Khachiyan United States
Jon Lee United States
Katta G. Murty United States
Kazuo Murota Japan
Alan J. Hoffman United States
Narendra Karmarkar relative to Reiner Horst Germany Reiner Horst's profile →
Citations per field
00.5×1.5×
Reiner Horst · 1×
Citations per year

Countries citing papers authored by Narendra Karmarkar

Since Specialization
Citations

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

Fields of papers citing papers by Narendra Karmarkar

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Narendra Karmarkar

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

All Works

20 of 20 papers shown
#WorkIndexed citations
1 0
2
An Approach to Data Reduction and Clustering with Theoretical Guarantees
3
3 73
4 60
5 57
6
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems.
2
7 62
8 9
9
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem
3
10
An Interior-Point Approach to NP-Complete Problems
14
11 43
12 258
13 65
14 34
15 23
16
A new polynomial-time algorithm for linear programmingbreakdown →
2867
17
A new polynomial-time algorithm for linear programmingbreakdown →
587
18
Coping with np-complete problems
3
19 29
20 277

About Narendra Karmarkar

Narendra Karmarkar is a scholar working on Computational Mathematics, Numerical Analysis and Computer Graphics and Computer-Aided Design, having authored 27 papers that have together received 4.6k indexed citations. Recurring topics across this work include Advanced Optimization Algorithms Research (8 papers), Optimization and Packing Problems (7 papers) and Computational Geometry and Mesh Generation (5 papers). The work is most often cited by research in Numerical Analysis (1.7k citations), Computational Theory and Mathematics (2.2k citations) and Computer Graphics and Computer-Aided Design (273 citations). Narendra Karmarkar has collaborated with scholars based in United States, India and Germany. Frequent co-authors include Richard M. Karp, Maurício G. C. Resende, Ilan Adler, Geraldo Veiga, K. G. Ramakrishnan, Y. N. Lakshman, Anil Kamath, George S. Lueker, Andrew Odlyzko and Richard Lipton. Their work appears in journals such as Mathematical Programming, SIAM Journal on Computing and Annals 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