JPEG compression history estimation for color images R Neelamani, R De Queiroz, Z Fan, S Dash, RG Baraniuk IEEE Transactions on Image Processing 15 (6), 1365-1378, 2006 | 146 | 2006 |

Solution of a min-max vehicle routing problem D Applegate, W Cook, S Dash, A Rohe INFORMS Journal on computing 14 (2), 132-143, 2002 | 112 | 2002 |

Exact solutions to linear programming problems DL Applegate, W Cook, S Dash, DG Espinoza Operations Research Letters 35 (6), 693-699, 2007 | 106 | 2007 |

On the matrix-cut rank of polyhedra W Cook, S Dash Mathematics of Operations Research 26 (1), 19-30, 2001 | 80 | 2001 |

MIR closures of polyhedral sets S Dash, O Günlük, A Lodi Mathematical Programming 121 (1), 33-60, 2010 | 75 | 2010 |

Valid inequalities based on simple mixed-integer sets S Dash, O Günlük Mathematical Programming 105 (1), 29-53, 2006 | 73 | 2006 |

A time bucket formulation for the traveling salesman problem with time windows S Dash, O Günlük, A Lodi, A Tramontani INFORMS Journal on Computing 24 (1), 132-147, 2012 | 69 | 2012 |

A model for fusion and code motion in an automatic parallelizing compiler U Bondhugula, S Dash, O Gunluk, L Renganarayanan 2010 19th International Conference on Parallel Architectures and Compilation …, 2010 | 57 | 2010 |

Projected Chvátal–Gomory cuts for mixed integer linear programs P Bonami, G Cornuéjols, S Dash, M Fischetti, A Lodi Mathematical Programming 113 (2), 241-257, 2008 | 50 | 2008 |

Strengthened benders cuts for stochastic integer programs with continuous recourse M Bodur, S Dash, O Günlük, J Luedtke INFORMS Journal on Computing 29 (1), 77-91, 2016 | 47 | 2016 |

Exponential lower bounds on the lengths of some classes of branch-and-cut proofs S Dash Mathematics of Operations Research 30 (3), 678-700, 2005 | 40 | 2005 |

Numerically safe Gomory mixed-integer cuts W Cook, S Dash, R Fukasawa, M Goycoolea INFORMS Journal on Computing 21 (4), 641-649, 2009 | 36 | 2009 |

On the MIR closure of polyhedra S Dash, O Günlük, A Lodi International Conference on Integer Programming and Combinatorial …, 2007 | 36 | 2007 |

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra S Dash, SS Dey, O Günlük Mathematical programming 135 (1-2), 221-254, 2012 | 33 | 2012 |

Valid inequalities based on the interpolation procedure S Dash, O Günlük Mathematical Programming 106 (1), 111-136, 2006 | 30 | 2006 |

On the strength of Gomory mixed-integer cuts as group cuts S Dash, O Günlük Mathematical Programming 115 (2), 387-407, 2008 | 27 | 2008 |

Two-step MIR inequalities for mixed integer programs S Dash, M Goycoolea, O Günlük INFORMS Journal on Computing 22 (2), 236-249, 2010 | 26 | 2010 |

Production design for plate products in the steel industry S Dash, J Kalagnanam, C Reddy, SH Song IBM journal of research and development 51 (3.4), 345-362, 2007 | 25 | 2007 |

A heuristic to generate rank-1 GMI cuts S Dash, M Goycoolea Mathematical Programming Computation 2 (3-4), 231-257, 2010 | 24 | 2010 |

On the matrix cuts of Lovász and Schrijver and their use in Integer Programming S Dash | 24 | 2001 |