Narendra Karmarkar

7.9k total citations · 2 hit papers
27 papers, 4.6k citations indexed

About

Narendra Karmarkar is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Industrial and Manufacturing Engineering. According to data from OpenAlex, Narendra Karmarkar has authored 27 papers receiving a total of 4.6k indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 8 papers in Numerical Analysis and 7 papers in Industrial and Manufacturing Engineering. Recurrent topics in Narendra Karmarkar's work include Advanced Optimization Algorithms Research (8 papers), Optimization and Packing Problems (7 papers) and Computational Geometry and Mesh Generation (5 papers). Narendra Karmarkar is often cited by papers focused on Advanced Optimization Algorithms Research (8 papers), Optimization and Packing Problems (7 papers) and Computational Geometry and Mesh Generation (5 papers). Narendra Karmarkar collaborates with scholars based in United States, India and Germany. Narendra Karmarkar's 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 and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Annals of Operations Research.

In The Last Decade

Narendra Karmarkar

25 papers receiving 4.1k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A new polynomial-time algorithm for linear programming

1984 2.9k citations Narendra Karmarkar COMBINATORICA profile →
A new polynomial-time algorithm for linear programming

1984 587 citations Narendra Karmarkar profile →

Peers

Narendra Karmarkar

CTM

NA

CNC

AI

EEE

Hoàng Tụy Vietnam

Reiner Horst Germany

Franz Rendl Austria

Henry Wolkowicz Canada

Jon Lee United States

J. B. Rosen United States

Katta G. Murty United States

Alan J. Hoffman United States

Michel X. Goemans United States

Kazuo Murota Japan

Hoàng Tụy Vietnam

Narendra Karmarkar

1.7k ×0.8

CTM

1.8k ×1.1

NA

557 ×0.6

CNC

326 ×0.5

AI

719 ×1.0

EEE

Citations per year, relative to Narendra Karmarkar Narendra Karmarkar (= 1×) peers Hoàng Tụy

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

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

20 of 20 papers shown

1.

Amrutur, Bharadwaj, Rajendra Joshi, & Narendra Karmarkar. (2003). A projective geometry architecture for scientific computation. 64–80.

2.

Niyogi, Partha & Narendra Karmarkar. (2000). An Approach to Data Reduction and Clustering with Theoretical Guarantees. 679–686. 3 indexed citations

3.

Karmarkar, Narendra & Y. N. Lakshman. (1998). On Approximate GCDs of Univariate Polynomials. Journal of Symbolic Computation. 26(6). 653–666. 73 indexed citations

4.

Karmarkar, Narendra & Y. N. Lakshman. (1996). Approximate polynomial greatest common divisors and nearest singular polynomials. 35–39. 60 indexed citations

5.

Karmarkar, Narendra, Richard M. Karp, Richard Lipton, László Lovász, & Michael Luby. (1993). A Monte-Carlo Algorithm for Estimating the Permanent. SIAM Journal on Computing. 22(2). 284–293. 57 indexed citations

6.

Karmarkar, Narendra, et al.. (1992). An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems.. 406–420. 2 indexed citations

7.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1992). A continuous approach to inductive inference. Mathematical Programming. 57(1-3). 215–238. 62 indexed citations

8.

Kamath, Anil & Narendra Karmarkar. (1992). A continuous method for computing bounds in integer quadratic optimization problems. Journal of Global Optimization. 2(3). 9 indexed citations

9.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1990). Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. 333–349. 3 indexed citations

10.

Karmarkar, Narendra. (1990). An Interior-Point Approach to NP-Complete Problems. 351–366. 14 indexed citations

11.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1990). Computational experience with an interior point algorithm on the satisfiability problem. Annals of Operations Research. 25(1). 43–58. 43 indexed citations

12.

Adler, Ilan, Maurício G. C. Resende, Geraldo Veiga, & Narendra Karmarkar. (1989). An implementation of Karmarkar's algorithm for linear programming. Mathematical Programming. 44(1-3). 297–335. 258 indexed citations

13.

Adler, Ilan, Narendra Karmarkar, Maurício G. C. Resende, & Geraldo Veiga. (1989). Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS Journal on Computing. 1(2). 84–106. 65 indexed citations

14.

Karmarkar, Narendra, Richard M. Karp, George S. Lueker, & Andrew Odlyzko. (1986). Probabilistic analysis of optimum partitioning. Journal of Applied Probability. 23(3). 626–645. 34 indexed citations

15.

Karmarkar, Narendra, Richard M. Karp, George S. Lueker, & Andrew Odlyzko. (1986). Probabilistic analysis of optimum partitioning. Journal of Applied Probability. 23(3). 626–645. 23 indexed citations

16.

Karmarkar, Narendra. (1984). A new polynomial-time algorithm for linear programming. COMBINATORICA. 4(4). 373–395. 2867 indexed citations breakdown →

17.

Karmarkar, Narendra. (1984). A new polynomial-time algorithm for linear programming. 302–311. 587 indexed citations breakdown →

18.

Karmarkar, Narendra. (1983). Coping with np-complete problems. 3 indexed citations

19.

Karmarkar, Narendra. (1982). Probabilistic analysis of some bin-packing problems. 107–111. 29 indexed citations

20.

Karmarkar, Narendra & Richard M. Karp. (1982). An efficient approximation scheme for the one-dimensional bin-packing problem. 312–320. 277 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