| 2020 | ECCV | An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100. | Ishant Shanu, Siddhant Bharti, Chetan Arora, S. N. Maheshwari |
| 2018 | CVPR | Inference in Higher Order MRF-MAP Problems With Small and Large Cliques. | Ishant Shanu, Chetan Arora, S. N. Maheshwari |
| 2014 | CVPR | Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems. | Chetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari |
| 2014 | CVPR | Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems. | Chetan Arora, S. N. Maheshwari |
| 2012 | ECCV | Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP. | Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari |
| 2010 | ECCV | An Efficient Graph Cut Algorithm for Computer Vision Problems. | Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari |
| 2005 | ICDCIT | Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting. | Rahul Agarwal, Mahender Bisht, S. N. Maheshwari, Sanjiva Prasad |
| 1999 | ADBIS | On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. | Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra |
| 1997 | DEXA | Crash Recovery in an Open and Safe Nested Transaction Model. | Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava |
| 1990 | MFCS | Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. | Pratul Dublish, S. N. Maheshwari |
| 1989 | PODS | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. | Pratul Dublish, S. N. Maheshwari |
| 1988 | ICDT | On O(N²) Equivalence Algorithm for Fan-Out Free Queries. | Pratul Dublish, S. N. Maheshwari |