Sushil Verma

According to our database, Sushil Verma authored at least 8 papers between 1995 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games

Ilan Adler, Sushil Verma

CoRR, 2013

2006

Sufficient matrices belong to L.

Ilan Adler, Richard W. Cottle, Sushil Verma

Math. Program., 2006

2000

A probabilistic analysis of a measure of combinatorial complexity for the central curve.

Peter A. Beling, Sushil Verma

Math. Program., 2000

1998

Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties.

Sushil K. Verma, Maged M. Dessouky

Math. Oper. Res., 1998

Flowshop scheduling with identical jobs and uniform parallel machines.

Maged M. Dessouky, Mohamed I. Dessouky, Sushil K. Verma

Eur. J. Oper. Res., 1998

A fast symmetric penalty algorithm for the linear complementarity problem.

Peter A. Beling, Sushil Verma

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1997

Combinatorial Complexity of the Central Curve.

Peter A. Beling, Sushil Verma

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1995

A note on the strong polynomiality of convex quadratic programming.

Sung-Pil Hong, Sushil Verma

Math. Program., 1995