"Baseball, Optimization and the World Wide Web". (with I.Adler, A. Erera and E. Olinick). Manuscript, May 1998.
"An optimal algorithm for the Bottleneck transportation problem with a bounded number of sources". (with Gerhard J. Woeginger). Manuscript, February 1998.
"A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine". (with Fabian Chudak). Manuscript, August 1997.
"Approximating a Generalization of MAX 2SAT and MIN 2SAT." (with A. Pathria) Manuscript UC Berkeley, January 1997.
"The Pseudoflow algorithm: A new algorithm and a new simplex algorithm for the maximum flow problem ". Manuscript, April 1997.
"The Pseudoflow algorithm: A new algorithm for the maximum flow problem, manuscript, April (1997). Submitted to Algorithmica.
"The Pseudoflow-simplex algorithm for the maximum flow problem". Manuscript 1998.
"A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine" (with Fabian Chudak). Manuscript, August 1997. submitted to Operations Research Letters.
"The Bounded Cycle Cover Problem". (with Eli Olinick). Manuscript, July 1997. submitted to INFORMS J. on Computing.
Approximating a Generalization of MAX 2SAT and MIN 2SAT". (with A. Pathria), manuscript, July (1997). Submitted to Discrete Applied math.
"A linear time approximation scheme for the makespan problem". (with D. Shmoys). Manuscript, June 1996.
"A new-old algorithm for minimum cut in closure graphs," manuscript June (1996), submitted to Mathematical Programming.
"A framework for half integrality and good approximations." Manuscript UC Berkeley, April, (1996). Submitted to SIAM J. on Computing.
"Polynomiality, Strong Polynomiality and NP-hardness of Nonlinear Network Optimization" August 1995.
"LU -matching" (with Anu Pathria) November 1994. Manusript.
"Analysis of the Greedy Approach in Covering Problems," (with Anu Pathria), August (1994). Submitted to Naval Research Quarterly .
"Node-Optimal Connected k-Subgraphs," (with Anu Pathria). Manuspcript, August (1994).
"Components Assembly in the Semiconductor Industry," (with O. Goldschmidt, and G. Yu), Technical Report, Department of IE\&OR, University of California at Berkeley, May (1993).
"Can a System of Linear Diophantine Equations be Solved in Strongly Polynomial Time?," manuscript, (with A. Pathria). January (1995).
"Scheduling of Photolithographic Machines in the Production of Semiconductor Chips," with Dan Landy.
"On a Polynomial Class of Nonlinear Integer Optimization Problems," manuscript, August 1989, revised May 1992.
"An Extension of Tardos' Algorithm to Linear Programming" (with H. Narayanan), December 1984.
"A Greedy Algorithm for the Minimum 3-Cut Problem and Its Worst- Case Bound" (with L. Tsai), Working Paper No. IP-318, in Economic Theory and Econometrics, U.C. Berkeley, September 1983. Revised June (1990).
"Fast Approximation Algorithms for the Robot Placement Problem" (with W. Maass), University of California, Berkeley, March 1983.
"Edge Coloring Multigraphs Is Easier than It Seems" (with D. Shmoys), manuscript, 1983.
"Fast Approximation Algorithms for Some Integer Programming Problems," GSIA Working Paper No. 21-80-81, October 1980 (under revision).
"A Note about the Empirical Performance of Khachiyan's Algorithms," October 1979.
"A Note about the Integrality of the Set Covering Problem," February 1981.
"Comparison between Heuristics for Hard Problems," GSIA Working Paper No. 41-80-81, Carnegie-Mellon University, February 1981.
"The Distribution of Storage-Constrained Databases in a Computer Network," GSIA Working Paper No. 76-79-80, June 1980.
"The Probabilistic Asymptotic Properties of Some Combinatorial Geometric Problems," GSIA Working Paper No. 30-79-80, October 1979.