A note on the strong polynomiality of convex quadratic programming. - Sung-Pil Hong; Sushil Verma (Math. Program., 1995)

Combinatorial Complexity of the Central Curve. - Peter A. Beling; Sushil Verma (STOC, 1997)

A fast symmetric penalty algorithm for the linear complementarity problem. - Peter A. Beling; Sushil Verma (SMC, 1998)

Flowshop scheduling with identical jobs and uniform parallel machines. - Maged M. Dessouky; Mohamed I. Dessouky; Sushil K. Verma (Eur. J. Oper. Res., 1998)

Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties. - Sushil K. Verma; Maged M. Dessouky (Math. Oper. Res., 1998)

A probabilistic analysis of a measure of combinatorial complexity for the central curve. - Peter A. Beling; Sushil Verma (Math. Program., 2000)

Sufficient matrices belong to L. - Ilan Adler; Richard W. Cottle; Sushil Verma (Math. Program., 2006)

A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games - Ilan Adler; Sushil Verma (CoRR, 2013)