Probabilistic Analysis of Some Bin-Packing Problems - Narendra Karmarkar (FOCS, 1982)

An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem - Narendra Karmarkar; Richard M. Karp (FOCS, 1982)

A new polynomial-time algorithm for linear programming. - Narendra Karmarkar (Comb., 1984)

Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. - Ilan Adler; Narendra Karmarkar; Mauricio G. C. Resende; Geraldo Veiga (INFORMS J. Comput., 1989)

An implementation of Karmarkar's algorithm for linear programming. - Ilan Adler; Mauricio G. C. Resende; Geraldo Veiga; Narendra Karmarkar (Math. Program., 1989)

Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. - Anil P. Kamath; Narendra Karmarkar; K. G. Ramakrishnan; Mauricio G. C. Resende (IPCO, 1990)

An Interior-Point Approach to NP-Complete Problems. - Narendra Karmarkar (IPCO, 1990)

An Approximate Dual Projective Algorithm for Solving Assignment Problems. - K. G. Ramakrishnan; Narendra Karmarkar; Anil P. Kamath (Network Flows And Matching, 1991)

A new parallel architecture for sparse matrix computation based on finite projective geometries. - Narendra Karmarkar (SC, 1991)

Computational results of an interior point algorithm for large scale linear programming. - Narendra Karmarkar; K. G. Ramakrishnan (Math. Program., 1991)

An interior point algorithm to solve computationally difficult set covering problems. - Narendra Karmarkar; Mauricio G. C. Resende; K. G. Ramakrishnan (Math. Program., 1991)

An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. - Narendra Karmarkar; S. A. Thakur (IPCO, 1992)

A continuous method for computing bounds in integer quadratic optimization problems. - Anil P. Kamath; Narendra Karmarkar (J. Glob. Optim., 1992)

A continuous approach to inductive inference. - Anil P. Kamath; Narendra Karmarkar; K. G. Ramakrishnan; Mauricio G. C. Resende (Math. Program., 1992)

A Monte-Carlo Algorithm for Estimating the Permanent. - Narendra Karmarkar; Richard M. Karp; Richard J. Lipton; László Lovász 001; Michael Luby (SIAM J. Comput., 1993)

Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. - Narendra Karmarkar; Yagati N. Lakshman (ISSAC, 1996)

On Approximate GCDs of Univariate Polynomials. - Narendra Karmarkar; Yagati N. Lakshman (J. Symb. Comput., 1998)

An Approach to Data Reduction and Clustering with Theoretical Guarantees. - Partha Niyogi; Narendra Karmarkar (ICML, 2000)

Beyond Convexity: New Perspectives in Computational Optimization. - Narendra Karmarkar (SEAL, 2010)

Towards a Broader View of Theory of Computing. - Narendra Karmarkar (CoRR, 2014)