### Journal Publications

*
An Approximate Dual Projective Algorithm for Solving Assignment
Problems
*
A.Kamath,N.Karmarkar,K.G.Ramakrishnan
(DIMACS,AMS '93)
*
An $O(nL)$ Iteration Algorithm for
Computing Bounds in Quadratic Optimization Problems
*
A.Kamath,N.Karmarkar
(Complexity in Numerical Optimization '93)
*
A Continuous Approach to the Inductive Inference Problem *
A.Kamath,N.Karmarkar,K.G.Ramakrishnan,M.Resende
(Mathematical Programming '92)
*
Continuous Approach to Computing Bounds in Quadratic Optimization
Problems with Integer variables *
A.Kamath,N.Karmarkar
(Journal of Global Optimization '92)
*
Computational experience with the Interior Point Algorithm for
0-1 Integer programming on the Satisfiability problem*
A.Kamath,N.Karmarkar,K.G.Ramakrishnan,M.Resende
(Annals of Operations Research '91)

### Conferences Proceedings and Technical Reports

*Routing and Admission Control in General
Topology
Networks with Poisson Arrivals.*
A. Kamath, O. Palmon, and S. Plotkin.
(SODA 1996).
*
Routing and Admission Control of Virtual Circuits in General
Topology Networks*
R.Gawlick,A.Kamath,S.Plotkin,K.G.Ramakrishnan
(Technical Memorandum, Bell Labs, 95).
* A
Improved Interior Point Algorithms for Exact and Approximate solution
of Multi-commodity Flow Problems *,
A.Kamath,O.Palmon,S.Plotkin
(SODA '95).
*
Fast Approximation Algorithm for Minimum Cost Multi-commodity
Flow
, *
A.Kamath,O.Palmon,S.Plotkin
(SODA '95).
*
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
*
A.Kamath,R.Motwani,K.Palem,P.Spirakis
(FOCS '94).
*
An Interior Point approach to Boolean Vector Function Synthesis
*,
A.Kamath,N.Karmarkar,K.G.Ramakrishnan,M.Resende
(IEEE - Circuits and Systems '93).
*
Computational and Complexity results for an Interior Point
Algorithm on Multi-Commodity Flow Problem
*
A.Kamath,N.Karmarkar,K.G.Ramakrishnan
(Netflow '93).
*
Interior Point Approach to deriving Upper Bounds in Quadratic Maximization
Problem Over Integer Constraints
*
A.Kamath,N.Karmarkar
(Global Optimization '91).