An O(|V|³) Algorithm for Finding Maximum Flows in Networks. - Vishv M. Malhotra; M. Pramodh Kumar; S. N. Maheshwari (Inf. Process. Lett., 1978)

Parallel algorithms for the convex hull problem in two dimensions. - Dhruva Nath; S. N. Maheshwari; P. C. P. Bhatt (CONPAR, 1981)

Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. - Dhruva Nath; S. N. Maheshwari (Inf. Process. Lett., 1982)

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees. - Dhruva Nath; S. N. Maheshwari; P. C. P. Bhatt (IEEE Trans. Computers, 1983)

An O(n²) Algorithm for Fan-Out Free Query Optimization. - Pratul Dublish; S. N. Maheshwari (FSTTCS, 1987)

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. - Sanjiv Kapoor; S. N. Maheshwari (SCG, 1988)

On O(N²) Equivalence Algorithm for Fan-Out Free Queries. - Pratul Dublish; S. N. Maheshwari (ICDT, 1988)

Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. - Joseph Cheriyan; S. N. Maheshwari (J. Algorithms, 1988)

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. - Pratul Dublish; S. N. Maheshwari (PODS, 1989)

The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. - Joseph Cheriyan; S. N. Maheshwari (Inf. Process. Lett., 1989)

Analysis of Preflow Push Algorithms for Maximum Network Flow. - Joseph Cheriyan; S. N. Maheshwari (SIAM J. Comput., 1989)

Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. - Pratul Dublish; S. N. Maheshwari (MFCS, 1990)

Crash Recovery in an Open and Safe Nested Transaction Model. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001; Bharat K. Bhargava (DEXA, 1997)

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. - Sanjiv Kapoor; S. N. Maheshwari; Joseph S. B. Mitchell (Discret. Comput. Geom., 1997)

Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001 (IADT, 1998)

On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001 (ADBIS, 1999)

An open and safe nested transaction model: concurrency and recovery. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001; Bharat K. Bhargava (J. Syst. Softw., 2000)

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. - Sanjiv Kapoor; S. N. Maheshwari (SIAM J. Comput., 2000)

Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001 (Data Knowl. Eng., 2001)

Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction Model. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001; Bharat K. Bhargava (Int. J. Cooperative Inf. Syst., 2001)

Virtual partition algorithm in a nested transaction environment and its correctness. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001 (Inf. Sci., 2001)

A Concurrency Control Algorithm for an Open and Safe Nested. - Sanjay Kumar Madria; S. N. Maheshwari; B. Chandra 001 (J. Inf. Sci. Eng., 2003)

The Web as a Dynamic Graph. - S. N. Maheshwari (Handbook of Data Structures and Applications, 2004)

Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting. - Rahul Agarwal; Mahender Bisht; S. N. Maheshwari; Sanjiva Prasad (ICDCIT, 2005)

An Efficient Graph Cut Algorithm for Computer Vision Problems. - Chetan Arora 001; Subhashis Banerjee; Prem Kalra; S. N. Maheshwari (ECCV (3), 2010)

A near optimal algorithm for finding Euclidean shortest path in polygonal domain - Rajasekhar Inkulu; Sanjiv Kapoor; S. N. Maheshwari (CoRR, 2010)

Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP. - Chetan Arora 001; Subhashis Banerjee; Prem Kalra; S. N. Maheshwari (ECCV (5), 2012)

Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems. - Chetan Arora 001; Subhashis Banerjee; Prem Kumar Kalra; S. N. Maheshwari (CVPR, 2014)

Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems. - Chetan Arora 001; S. N. Maheshwari (CVPR, 2014)

Generalized Flows for Optimal Inference in Higher Order MRF-MAP. - Chetan Arora 001; Subhashis Banerjee; Prem Kumar Kalra; S. N. Maheshwari (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

Inference in Higher Order MRF-MAP Problems With Small and Large Cliques. - Ishant Shanu; Chetan Arora 001; S. N. Maheshwari (CVPR, 2018)

An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100. - Ishant Shanu; Siddhant Bharti; Chetan Arora 001; S. N. Maheshwari (ECCV (20), 2020)