(19, 9, 4) Hadamard Designs and Their Residual Designs. - N. M. Singhi (J. Comb. Theory A, 1974)

On the Number of Latin Rectangles and Chromatic Polynomial of L(Kr, s). - Krishna B. Athreya; C. R. Pranesachar; Navin M. Singhi (Eur. J. Comb., 1980)

Intersection Graphs of k-uniform Linear Hypergraphs. - Ranjan N. Naik; S. B. Rao; S. S. Shrikhande; N. M. Singhi (Eur. J. Comb., 1982)

On Functions of Strenth t. - Michel Deza; Peter Frankl; N. M. Singhi (Comb., 1983)

Linear Dependencies among Subsets of a Finite Set. - Peter Frankl; Navin M. Singhi (Eur. J. Comb., 1983)

On a problem of Erdös and Larson. - S. S. Shrikhande; N. M. Singhi (Comb., 1985)

Maximal arcs in designs. - Sharad S. Sane; S. S. Shrikhande; N. M. Singhi (Graphs Comb., 1985)

A Reciprocity Relation for t-Designs. - N. M. Singhi; S. S. Shrikhande (Eur. J. Comb., 1987)

Rigid pentagons in hypercubes. - Michel Deza; N. M. Singhi (Graphs Comb., 1988)

First distribution invariants and EKR theorems. - Nachimuthu Manickam; N. M. Singhi (J. Comb. Theory A, 1988)

On existence and number of orthogonal arrays. - Dwijendra K. Ray-Chaudhuri; Navin M. Singhi (J. Comb. Theory A, 1988)

On Existence of t-Designs with Large v and lambda. - Dwijendra K. Ray-Chaudhuri; Navin M. Singhi (SIAM J. Discret. Math., 1988)

An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs. - Mohan S. Shrikhande; Navin M. Singhi (Discret. Math., 1990)

Partitions in Matrices and Graphs. - Daniel R. Hughes; Navin M. Singhi (Eur. J. Comb., 1991)

Signed graphs with least eigenvalue <-2. - Navin M. Singhi; Gurusamy Rengasamy Vijayakumar (Eur. J. Comb., 1992)

Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code. - Dwijendra K. Ray-Chaudhuri; Navin M. Singhi; S. Sanyal; P. S. Subramanian (IEEE Trans. Computers, 1994)

Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications. - N. M. Singhi; Iyengar Shriniwas; T. A. Antony (Eur. J. Comb., 1996)

Set-magic labelings of infinite graphs. - N. M. Singhi; Gurusamy Rengasamy Vijayakumar; N. Usha Devi (Ars Comb., 2002)

Tags on Subsets. - N. M. Singhi (Electron. Notes Discret. Math., 2003)

On maximal instantaneous codes. - Stephan Foldes; Navin M. Singhi (Electron. Notes Discret. Math., 2006)

A Multiprocessor Communication Architecture For High Speed Networks - S. Iyengar; N. Apte; A. A. Roy; S. Sanyal; Navin M. Singhi; Wu Geng Feng (CoRR, 2010)

Projective planes I. - Navin M. Singhi (Eur. J. Comb., 2010)

Studying designs via multisets. - Navin M. Singhi; Dwijendra K. Ray-Chaudhuri (Des. Codes Cryptogr., 2012)

Friendship 3-hypergraphs. - Pak Ching Li; G. H. John van Rees; Stela Hanbyeol Seo; N. M. Singhi (Discret. Math., 2012)

Some approaches for solving the general (t, k)-design existence problem and other related problems. - Amitava Bhattacharya; Navin M. Singhi (Discret. Appl. Math., 2013)