"Generalized p-Center Problems: Complexity Results and Approximation Algorithms," (with Anu Pathria), march (1995). To appear European Journal of Operational Research.

"An Optimal Test Compression Procedure for Combinational circuits," August (1994). To appear IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

"k-edge Subgraph Problems," (with O. Goldschmidt) UC Berkeley, manuscript, June (1994). to appear Discrete Applied Math.

"Approximation algorithms for the k-Clique Covering Problem" (with O. Goldschmidt, C. Hurken and G. Yu), to appear, SIAM J. of Discrete Math.

"A new and fast approach to very large scale integrated sequential circuits test generation," (with Jeniffer Adams), to appear Operations Research.

"Approximation Algorithms for Network Design Problems on Bounded Subsets," (with Seffi Naor), UC Berkeley, manuscript, November (1993), to appear J. on Algorithms.

"Algorithms and Heuristics for Scheduling Semiconductor Burn-in Operations," (with D. Landy), August (1994), To appear Operations Research.

"Scheduling with Batching: Two Job Types," (with D. Landy), UC Berkeley, manuscript, June (1993). To appear, Discrete Applied Math (Moehring).

"A Nonlinear Knapsack Problem,", Operations Research Letters 17 (1995) 103-110.

"About Strongly Polynomial Time Algorithms for Quadratic Optimization Over Submodular Constraints," (with S.P. Hong). Mathematical Programming 69, (1995) 269-309.

"On the Complexity of the Production-Transportation Problem, (with S.P. Hong), UC Berkeley, manuscript, March (1993), to appear SIAM J. on optimization.

"Scheduling with Batching: Minimizing the Weighted Number of Tardy Jobs," (with D. Landy), Operations Research Letters, 16 (1994) 79-86.

"An O(log k) approximation algorithm for the k-minimum spanning tree problem in the plane," (with N. Garg). Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC) (1994) 432-438. To appear Algorithmica.

"A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound" (with O. Goldschmidt, and G. Yu), Information Processing Letters 48 (1993) 305-310.

"Complexity and Algorithms for Logical Constraints with Applications to VLSI Layout, Compaction and Clocking". Studies in Locational Analysis, ISOLDE VI proceedings, 159-164 June (1993).

"Tight Bounds and 2-approximation Algorithms for Integer Programs with Two Variables Per Inequality," (with N. Megiddo, J. Naor and A. Tamir), Mathematical Programming, 62 (1993) 69-83.

"Polynomial Algorithms for Convex Network Optimization," in Network Optimization Problems: Algorithms, Complexity and Applications, edited by D. Du and P. M. Pardalos, World Scientific, 63-92, (1993).

"Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems," Mathematics of Operations Research, Vol. 19, No 2, 390-409, May (1994).

"A Polynomial Algorithm for the K-Cut Problem" (with 0. Goldschmidt), Mathematics of Operations Research Vol 19. No. 1 Feb (1994) 24-37.

"The Empirical Performance of a Polynomial Algorithm for Constrained Nonlinear Optimization" (with S. Seshadri), Annals of Operations Research, Vol. 43 (eds. G. Mitra and I. Maros), 229-248, (1993).

"Simple and Fast Algorithms for Linear and Integer Programs with Two Variables per Inequality," (with J. Naor) SIAM Journal on Computing vol 23 No. 6, (1994), 1179-1192. (earlier version in Proceedings of IPCO, Second Integer Programming and Combinatorial Optimization Conference, Carnegie Mellon University, May 1992, 41-60.)

"A Strongly Polynomial Algorithm for the Quadratic Transportation Problem with Fixed Number of Suppliers" (with S. Cosares), Mathematics of Operations Research Vol 19. No. 1 Feb (1994) 94-111.

"An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs," August 1988, Operations Research, Vol. 40, No. 5, pp. 923-935, (1992).

"Why Should Biconnected Components Be Identified First," Discrete Applied Mathematics, \fB42, (1993), 203-210.

"The Multicovering Problem" (with N. Hall), European Journal on Operational Research, 62, (1992) 323-339.

"A Polynomial Algorithm for an Integer Quadratic Nonseparable Transportation Problem" (with J. G. Shanthikumar and R. Shamir), Mathematical Programming, Vol. 55, No. 3, pp. 359-372, (1992).

"On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions," Proceedings of the Integer Programming and Combinatorial Optimization Conference, May 1990, 261- 274.

"Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problems" (with R. Shamir), Operations Research, Vol. 39, No. 4, (1991), 648-653.

"Nonlinear Separable Optimization is Not Much Harder than Linear Optimization" (with J.G. Shanthikumar), Journal of ACM, Vol. 37, No. 4 (1990), 843-862.

"The Complexity of Nonlinear Optimization" (with J. G. Shanthikumar), Lecture Notes in Computer Science, 372, Springer-Verlag, July 1989, pp. 461-472.

"Asymptotically Optimal Linear Algorithms for the Minimum K-Cut in a Random Graph" (with O. Goldschmidt), SIAM J. on Discrete Mathematics, February 1990, Vol. 3, No. 1, pp. 58-73.

"A Fast Perfect Matching Algorithm in Random Graphs" (with O. Goldschmidt), SIAM J. on Discrete Mathematics, February 1990, Vol. 3, No. 1, pp. 48-57.

"Minimizing the Number of Tardy Job Limits under Release Time Contraints" (with R. Shamir), Discrete Applied Mathematics, Vol. 28 (1990), 45-57.

"O(nlog2n) Algorithm for the Maximum Weighted Tardiness Problem" (with R. Shamir), Information Processing Letters, 31 (1989), 215-219.

"An Algorithm for the Detection and Construction of Monge Sequences" (with A. Alon, S. Cosares and R. Shamir), Linear Algebra and its Applications, 114/115 (1989), 669-680.

"A Polynomial Algorithm for the K-cut Problem" (with O. Goldschmidt), Proceedings of 29th Annual Symposium on Foundations of Computer Science (October 1988), pp. 444-451.

"A Best Possible Parallel Approximation Algorithm to a Graph Theoretic Problem" (with D. Shmoys), Operational Research (1987), 933- 938.

"Analysis of a Flow Problem with Fixed Charges" (with A. Segev), Networks, Vol. 19 (1989), 291-312.

"A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach" (with D. Shmoys), SIAM J. on Computing, 17:3 (1988), 539-551.

"The Concept of Best Possibility on the Analysis of Approximation Algorithms," Proceedings of the Israel Mathematical Union Conference, Tel-Aviv University, Israel (1987), 36-42.

"Fast Approximation Algorithms for a Non-Convex Covering Problem" (with W. Maass), Journal of Algorithms, 8 (1987), 305-323.

"Lagrangian Relaxation for Testing Infeasibility in VLSI Routing" (with T. Feo), Operations Research, 34:6 (1986).

"A Fast Approximation Algorithm for the Multicovering Problem" (with N. Hall), Discrete Applied Mathematics, 15 (1986), 35-40.

"A Packing Problem You Can Almost Solve by Sitting on Your Suitcase" (with D. Shmoys), SIAM Journal on Algebraic and Discrete Methods, 7:2 (April 1986), 247-257.

"Using Dual Approximation Algorithms for Scheduling Problems: Practical and Theoretical Results" (with D. Shmoys), Journal of ACM, 34:1 (January 1987), 144-162.

"The Linzertorte Problem - Or a Unified Approach to Painting, Baking and Weaving" (with E. Wigderson), Discrete Applied Mathematics, 14 (1986), 17-32.

"A Unified Approach to Approximation Algorithms for Bottleneck Problems" (with D. Shmoys), Journal of ACM, 33:3 (July 1986), 533-550.

"An O(V2) Algorithm for the Planar 3-Cut Problem" (with D. Shmoys), SIAM Journal on Algebraic and Discrete Methods, 6:4 (1985), 707-712.

"A Better than 'Best Possible' Algorithm to Edge Color Multigraphs" (with D. Shmoys and T. Nishizeki), Journal of Algorithms, 7:1 (March 1986), 79-104.

"A Best Possible Heuristic for the K-Center Problem" (with D. Shmoys), Mathematics of Operations Research, 10:2 (May 1985), 180-184.

"Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI" (with W. Maass), Journal of ACM, 32:1 (January 1985), 130-136.

"Best Possible Heuristics for the Bottleneck Wandering Salesperson and Bottleneck Vehicle Routing Problems" (with D. Shmoys), European Journal of Operational Research, 26 (1986), 380-384.

"Easy Solutions for the K-Center Problem or the Dominating Set Problem on Random Graphs," Annals of Discrete Mathematics, 25 (1985), 189-210.

"Approximation Schemes for Covering and Packing Problems in Robotics and VLSI" (with W. Maass), Springer-Verlag Lecture Notes in Computer Science, 166 (April 1984).

"Powers of Graphs: A Powerful Approximation Algorithm Technique" (with D. Shmoys), Proceedings of the Symposium on Theory of Computing, May 1984.

"When are NP-hard Location Problems Easy," Annals of Operations Research, 1 (1984), 201-214.

"Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems," Discrete Applied Mathematics, 6 (1983), 243-254.

"On the Fractional Solution to the Set Covering Problem," SIAM Journal of Algebraic and Discrete Methods, 4:2 (1983), 221-222.

"Approximation Algorithms for the Weighted Set Covering and Node Cover Problems," GSIA Working Paper No. 64-79-80, April 1980; also, SIAM Journal of Computing, 11:3 (1982), 555-556.

"Steinhaus' Geometric Location Problem for Random Samples in the Plane" (with J. Michael Steele), Advanced Applied Probability, 14 (1982), 56-67.

"Heuristics for the Fixed Cost Median Problem," Mathematical Programming, 22:2 (1982), 148-162.

"Database Location in Computer Networks" (with M.L. Fisher), Journal of the Association for the Computing Machinery, 27:4 (October 1980).

"Probabilistic Analysis of the Euclidean K-Median Problem" (with M.L. Fisher), Mathematics of Operations Research, 5:1 (February 1980).

"A Quantitative Analysis of Astigmatism Induced by Pterygium" (with S. Moskowitz and J. Wirtschafter), Journal of Biomechanics, 10 (1977), 735-46.

"Polynomiality, Strong Polynomiality and NP-hardness of Nonlinear Network Optimization" August 1995. Submitted to Management Science.

"LU -matching" (with Anu Pathria) November 1994. Manusript.

"Forest Harvesting and Minimum Cuts" (with Anu Pathria) July 1995. Manusript. Submitted to Forest Science (July17, 95.)

"Path Costs in Evolutionary Tree Reconstruction" (with Anu Pathria), march (1995). Submitted to Journal of computational biology.

"Analysis of the Greedy Approach in Covering Problems," (with Anu Pathria), August (1994). Submitted to Naval Research Quarterly (June 95)

"The bottleneck Graph Partition Problem," (with A. Pathria), UC Berkeley, manuscript, August (1993). Submitted to Networks, Aug (1993). Will check on status, june 95.

"Semiconductor Assembly (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, submitted to Information and computation, (with A. Pathria). January (1995). (sent to Albert Meyer).

"Scheduling of Photolithographic Machines in the Production of Semiconductor Chips," with Dan Landy.

"Nonlinear Network Optimization: Recent Results," manuscript, April (1992).

"Improved Planning for the Open - Pit Mining Problem," (with A. Chen), manuscript, April (1992).

"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.