| 2025 | IPCO | Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition. | Diego Cifuentes, Santanu S. Dey, Jingye Xu |
| 2024 | IPCO | Sensitivity Analysis for Mixed Binary Quadratic Programming. | Diego Cifuentes, Santanu S. Dey, Jingye Xu |
| 2021 | IPCO | Lifting Convex Inequalities for Bipartite Bilinear Programs. | Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard |
| 2021 | SODA | Branch-and-Bound Solves Random Binary IPs in Polytime. | Santanu S. Dey, Yatharth Dubey, Marco Molinaro |
| 2020 | ICML | Upper bounds for Model-Free Row-Sparse Principal Component Analysis. | Guanyi Wang, Santanu S. Dey |
| 2014 | IPCO | How Good Are Sparse Cutting-Planes? | Santanu S. Dey, Marco Molinaro, Qianyi Wang |
| 2013 | IPCO | A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets. | Diego Alejandro Morn Ramrez, Santanu S. Dey |
| 2011 | IPCO | On the Chvtal-Gomory Closure of a Compact Convex Set. | Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma |
| 2011 | IPCO | Design and Verify: A New Scheme for Generating Cutting-Planes. | Santanu S. Dey, Sebastian Pokutta |
| 2010 | IPCO | Experiments with Two Row Tableau Cuts. | Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey |
| 2010 | IPCO | The Chvtal-Gomory Closure of an Ellipsoid Is a Polyhedron. | Santanu S. Dey, Juan Pablo Vielma |
| 2008 | IPCO | Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. | Santanu S. Dey, Laurence A. Wolsey |
| 2007 | IPCO | Sequential-Merge Facets for Two-Dimensional Group Problems. | Santanu S. Dey, Jean-Philippe P. Richard |